You are viewing a single comment's thread. Return to all comments →
Simple solution in python:
n=int(input().strip()) i=1 while True: p=pow(i,n) if len(str(p))==n: print(p) if len(str(p))>n: break i+=1
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 →
Simple solution in python: