Files
project_euler/63/main.py
2025-09-06 11:02:01 +02:00

13 lines
271 B
Python

def sol():
base = 1
while base < 10:
exponent = 1
while exponent <= (digits := len(str(n := base**exponent))):
if digits == exponent:
yield n
exponent += 1
base += 1
print(len([n for n in sol()]))