You are viewing a single comment's thread. Return to all comments →
This is very easy approach for this problem
prime=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47] for i in range(int(input())): count,result=0,1 n=int(input()) for j in prime: result*=j if(result<=n): count+=1 print(count)
Seems like cookies are disabled on this browser, please enable them to open this website
Leonardo's Prime Factors
You are viewing a single comment's thread. Return to all comments →
This is very easy approach for this problem