We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Project Euler #168: Number Rotations
Project Euler #168: Number Rotations
Sort by
recency
|
43 Discussions
|
Please Login in order to post a comment
can anyone exlain the problem?
getting error for this logic after m=15
n=int(input()) sum=0 for i in range(11,10**n): nfinal=str(i)[-1]+str(i)[0:len(str(i))-1] if(int(nfinal)%i==0): sum+=i print(sum%(10**5))
i am getting timeout error being my code so short. please help anuone
If 495 is the result of the scenario when n=2 and the constituent numbers are 11,22,33,44,55,66,77,88,99 then... How are 22,33,44,55,66,77,88,99 special numbers? Obviously 11 is... (1 * 10) + 1 = 1 * (1 * 10) + 1 But take 22 for instance: 22 is (2 * 10) + 2 != 2 * (2 * 10) + 2 By my understanding 22 is not a special number, neither are 33,44,...,99.