Subash Chandran posted: "def isprime(n): c=0 for i in range(1,n+1): if(n%i==0): c=c+1 if c==2: return 1 else: return 0 n=int(input()) c=0 x=1 while(c<=n): x=x+1 for i in range(2,x+1): if isprime(i): "
def isprime(n): c=0 for i in range(1,n+1): if(n%i==0): c=c+1 if c==2: return 1 else: return 0 n=int(input()) c=0 x=1 while(c<=n): x=x+1 for i in range(2,x+1): if isprime(i): c+=1 print(x)
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.