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.
check this one out
def fact(a):
if a==0:
return 1
else:
return a*fact(a-1)
def g(i):
n=1
h=0
while(i!=h):
sum1=0
sum2=0
k=str(n)
for u in k:
sum1=sum1+fact(int(u))
e=str(sum1)
for j in e:
sum2=sum2+int(j)
h=sum2
n=n+1
else:
return (n-1)
def res(h,m):
q=[]
d=[]
for i in range(1,h+1):
sum11=0
t=str(g(i))
if(len(t)==1):
d.append(int(t))
else:
for i in t:
sum11=sum11+int(i)
d.append(sum11)
print(sum(d)%m)
x1=int(input())
l=[]
for i in range(x1):
l.append([int(x) for x in input().split()])
for i in range(len(l)):
res(l[i][0],l[i][1])
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #254: Sums of Digit Factorials
You are viewing a single comment's thread. Return to all comments →
check this one out def fact(a): if a==0: return 1 else: return a*fact(a-1) def g(i):
n=1 h=0 while(i!=h): sum1=0 sum2=0 k=str(n) for u in k: sum1=sum1+fact(int(u))
e=str(sum1) for j in e: sum2=sum2+int(j)
h=sum2 n=n+1 else: return (n-1) def res(h,m):
q=[] d=[] for i in range(1,h+1): sum11=0 t=str(g(i)) if(len(t)==1): d.append(int(t)) else: for i in t: sum11=sum11+int(i) d.append(sum11)
print(sum(d)%m) x1=int(input()) l=[] for i in range(x1): l.append([int(x) for x in input().split()]) for i in range(len(l)): res(l[i][0],l[i][1])