..

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758import mathdef isPrime(n): if(n==1): return False count=0 for i in range(2,(int)(math.sqrt(n))+1): if(n%i==0): count=count+1 if(count==0): return True else: return Falsedef sieve(n): if n

123456789101112131415161718192021222324252627282930313233import matharr=[]arr_result=[]sum_result=0def isChogwasoo(n): sum=1 for i in range(2,(int)(math.sqrt(n))+1): if(n%i==0): temp=(int)(n/i) if(temp!=i): sum=sum+i sum=sum+temp else: sum=sum+temp if(sum>n): return True else: return Falsefor i in range(1,28124): if(isChogwasoo(i)): arr.append(i)for i in range(0,len(arr)): for j in range(0,len(a..

1234567891011121314151617count=0for n in range(1,101): for r in range(0, n+1): n_r=n-r boonza=1 boonmo=1 for i in range(2,n+1): boonza=boonza*i for j in range(2,r+1): boonmo=boonmo*j for k in range(2,n_r+1): boonmo=boonmo*k combination=boonza/boonmo if(combination>1000000): count=count+1print(count)#반환 시간 : 0.1scs 조합을 구하고 백만이 넘어가면 카운트를 셌다.