http://community.topcoder.com/stat?c=problem_statement&pm=12496&rd=15495
The solution for the smaller problem:
def myfunc(n):
f = [0] *(n+1)
for i in range(2,n+1):
for j in range(2,i):
if(i%j==0 and f[i-j]==0):
f[i] =1
print [ (i,f[i]) for i in range(0,len(f))]
The solution for the bigger problem involves getting a pattern from the above solution.
http://apps.topcoder.com/wiki/display/tc/SRM+575
The solution for the smaller problem:
def myfunc(n):
f = [0] *(n+1)
for i in range(2,n+1):
for j in range(2,i):
if(i%j==0 and f[i-j]==0):
f[i] =1
print [ (i,f[i]) for i in range(0,len(f))]
The solution for the bigger problem involves getting a pattern from the above solution.
http://apps.topcoder.com/wiki/display/tc/SRM+575
trabzon
ReplyDeleteedirne
van
bingöl
yalova
SU86T1