You are viewing a single comment's thread. Return to all comments →
Just use basic maths and your code reduces further.
import math n=int(input()) a=(math.ceil(pow(10,1-1/n))) for i in range(a,10): print(pow(i,n))
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #63: Powerful digit counts
You are viewing a single comment's thread. Return to all comments →
Just use basic maths and your code reduces further.