用python写出以内的素数:

用python写出以内的素数:

In [207]: def count_prime(n):
     ...:     for i in range(2,n+1):
     ...:         flag=0
     ...:         for j in range(2,i-1):
     ...:             if i%j==0:
     ...:                 flag=1
     ...:                 break
     ...:         if flag==0:
     ...:             print(i)
     ...:

In [208]: count_prime(200)

刚开始没加判断条件导致输出很多重复结果。
使用循环:

In [235]: def count_prime1(n):
     ...:     i=2
     ...:     while i<=n:
     ...:         flag=0
     ...:         j=2
     ...:         while j<i:
     ...:             if i%j==0:
     ...:                 flag=1
     ...:                 break
     ...:             j+=1
     ...:         if flag==0:
     ...:             print(i)
     ...:         i+=1
     ...:
     ...:
     ...:

In [236]: count_prime1(10)

猜你喜欢

转载自blog.csdn.net/qq_33694881/article/details/82730342