python中判断素数的代码 python判断素数的程序
\u5224\u65ad\u4e00\u4e2a\u6570\u662f\u5426\u4e3a\u7d20\u6570python1\u3001\u5b9a\u4e49\u5224\u65ad\u7d20\u6570\u7684\u51fd\u6570isPrime
import math
def isPrime(num):
sqt = int(math.sqrt(num))
for i in range(2, sqt + 1):
if num % i == 0:
return False
return True
2\u3001\u8c03\u7528\u51fd\u6570\u5e76\u6253\u5370\u7ed3\u679c
a = int(input("\u8bf7\u8f93\u5165\u4e00\u4e2a\u6570\u5b57\uff1a"))
if isPrime(a):
print(a)
else:
print("\u4e0d\u662f\u7d20\u6570")
3\u3001\u9a8c\u8bc1\u7ed3\u679c
\uff081\uff09\u8f93\u5165\u7684\u662f\u7d20\u6570
\u8bf7\u8f93\u5165\u4e00\u4e2a\u6570\u5b57\uff1a3
3
\uff082\uff09\u8f93\u5165\u7684\u4e0d\u662f\u7d20\u6570
\u8bf7\u8f93\u5165\u4e00\u4e2a\u6570\u5b57\uff1a12
\u4e0d\u662f\u7d20\u6570
\u4ee5\u4e0b\u662f\u6c42100\u4ee5\u5185\u7d20\u6570\u7684\u4ee3\u7801\uff1a
i = 2;
while(i < 100):
j = 2;
while (j <= (i/j)):
if not (i%j):break
j = j +1
if(j > i /j):print (i," \u662f\u7d20\u6570")
i = i+1
if num > 1:
for i in range(2,num):
if (num % i) == 0:
print(num,"不是质数")
print(i,"乘于",num//i,"是",num)
break
else:
print(num,"是质数")
else:
print(num,"不是质数")
绛旓細涓鑸潵璇达紝姣1澶т絾涓嶆槸绱犳暟鐨鏁扮О涔嬩负鍚堟暟锛岃1鍜0鏃㈤潪绱犳暟涔熼潪鍚堟暟锛岀礌鏁板叾瀹炴槸涓庡悎鏁扮浉瀵圭珛鐨勪袱涓蹇碉紝浜岃呭悓鏃舵瀯鎴愪簡鏁拌褰撲腑鏈鍩虹鐨勫畾涔変箣涓銆鍦╬ython涓垽鏂涓涓暟鏄惁涓虹礌鏁伴氬父鏈夊嚑绉嶆柟娉曪紝鍏蜂綋鏂规硶涓猴細1銆佽繍鐢╬ython鐨勬暟瀛﹀嚱鏁 鍏蜂綋鐨勬寚浠や负锛歩mport math def isPrime(n):if n = 1:retur...
绛旓細鍒ゆ柇绱犳暟鐨鏂规硶Python浠ｇ爜濡備笅锛歚``pythondef is_prime(n): if n <= 1: return False elif n <= 3: return True elif n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: ...
绛旓細1銆佸垽鏂槸鍚︿负绱犳暟鐨勬柟娉曪細鍒╃敤for寰幆鍜宐reak璇彞锛屼唬鐮佷负銆恌oriinrange(2锛宬+2)锛歩fm%i==0锛歜reak銆戙傚埄鐢╳hile寰幆鍜宐ool鍙橀噺銆2銆佷唬鐮佷腑鍏堝畾涔変簡涓涓垽鏂礌鏁扮殑鍑芥暟is_prime()锛岀劧鍚庤緭鍏ュ尯闂寸殑璧风偣鍜岀粓鐐癸紝鏈鍚庨亶鍘嗗尯闂翠腑鐨勬墍鏈夋暟骞跺垽鏂槸鍚︿负绱犳暟锛岃緭鍑虹礌鏁板嵆鍙3銆乶%a==0锛屾崲瑷涔嬶紝濡傛灉娌...
绛旓細涓嬮潰鏄竴涓娇鐢≒ython缂栧啓鐨勭礌鏁板垽鏂嚱鏁帮細杩欎釜鍑芥暟棣栧厛妫鏌鏄惁灏忎簬鎴栫瓑浜1锛屽鏋滄槸锛屽垯杩斿洖False锛屽洜涓1涓嶆槸绱犳暟銆傜劧鍚庯紝瀹冧娇鐢ㄤ竴涓惊鐜潵妫鏌鏄惁鑳藉琚瘮瀹冨皬鐨勬墍鏈夋鏁存暟鏁撮櫎銆傚惊鐜殑鑼冨洿鏄粠2鍒皀鐨勫钩鏂规牴锛堝洜涓轰竴涓ぇ浜巒鐨勫钩鏂规牴鐨勬鏁存暟涓嶅彲鑳芥暣闄锛夈傚鏋渘鑳藉琚惊鐜腑鐨勪换浣曚竴涓暟鏁撮櫎锛屽垯...
绛旓細print("\n鍏辫%d涓礌鏁般" % count)绋嬪簭涓鍏堝畾涔変簡涓涓悕涓篿sPrime鐨勫嚱鏁锛岀敤浜庡垽鏂竴涓暟鏄惁涓虹礌鏁般傚綋n灏忎簬绛変簬1鏃讹紝鐩存帴杩斿洖False锛涘綋n澶т簬1鏃讹紝瀵逛簬浠2鍒皀鐨勫钩鏂规牴鐨勬墍鏈夋暟杩涜鍒ゆ柇锛屽鏋渘鑳藉琚繖浜涙暟鏁撮櫎锛屽垯n涓嶆槸绱犳暟锛涘鏋滀笉瀛樺湪杩欐牱鐨勬暟锛屽垯n鏄礌鏁般傛帴涓嬫潵锛岀▼搴忎娇鐢ㄥ惊鐜粠2鍒999...
绛旓細1銆佸疄鐜版簮鐮 def isPrime():n = int(input("璇疯緭鍏ヤ竴涓暟瀛楋細"))if n > 1:for k in range(2, n):if n % k == 0:print(n, "涓嶆槸绱犳暟")break else:print(n, "鏄礌鏁")else:print(n, "涓嶆槸绱犳暟")isPrime()2銆佸疄鐜扮粨鏋 璇疯緭鍏ヤ竴涓暟瀛楋細5 5 鏄礌鏁 璇疯緭鍏ヤ竴涓暟瀛楋細10 10 ...
绛旓細鍒ゆ柇鏄惁涓绱犳暟鐨鏂规硶锛1銆佸埄鐢╢or寰幆鍜宐reak璇彞锛浠ｇ爜涓恒恌or i in range(2, k+2):if m % i == 0:break銆戙2銆佸埄鐢╳hile寰幆鍜宐ool鍙橀噺銆python浣跨敤鎶宸 濡傛灉鍦ㄥ紓甯稿鐞嗙▼搴忔垨 finally 鍧椾腑寮曞彂寮傚父锛岄粯璁ゆ儏鍐典笅锛屽紓甯告満鍒朵細闅愬紡宸ヤ綔浼氬皢鍏堝墠鐨勫紓甯搁檮鍔犱负鏂板紓甯哥殑 __context__ 灞炴с傝繖灏...
绛旓細1銆佹墦寮pycharm锛岀偣鍑籪ile锛岀偣鍑籲ew锛屾柊寤轰竴涓┖鐧界殑pyrthon鏂囦欢锛2銆佽繖閲屽紑濮嬬紪鍐鍒ゆ柇绱犳暟鐨勪唬鐮锛屽垽鏂礌鏁扮殑涓婇檺鏈鍑嗙‘鐨勫簲璇ヤ娇鐢ㄥ钩鏂规牴鍙栨暣鍔犱竴锛屾澶勭敤鍒颁袱灞傚惊鐜紝绗竴灞傞亶鍘0鍒100鐨勬暟锛岀浜屽眰寰幆鍒ゆ柇婊¤冻鏉′欢鐨勭礌鏁般傝繖閲屾湁涓涓猠lse瑕佹敞鎰忔槸鍜宖or瀵归綈鑰屼笉鏄痠f瀵归綈锛屽鏋滃拰if瀵归綈鍙涓嶈兘琚2鏁撮櫎...
绛旓細2銆佷笅闈㈡槸涓涓Python绋嬪簭锛屽彲浠ュ疄鐜板嚱鏁癙rme(n)锛屾帴鏀舵鏁存暟n浣滀负鍙傛暟锛屽垽鏂姝ｆ暣鏁版槸鍚︿负绱犳暟銆傚湪杩欎釜绋嬪簭涓紝鎴戜滑瀹氫箟浜嗗嚱鏁癙rme(n)锛屾帴鏀朵竴涓鏁存暟n浣滀负鍙傛暟銆3銆佹墦寮pycharm锛岀偣鍑籪ile锛岀偣鍑籲ew锛屾柊寤轰竴涓┖鐧界殑pyrthon鏂囦欢锛氳繖閲屽紑濮嬬紪鍐鍒ゆ柇绱犳暟鐨勪唬鐮锛屽垽鏂礌鏁扮殑涓婇檺鏈鍑嗙‘鐨勫簲璇ヤ娇鐢ㄥ钩鏂规牴鍙栨暣...
绛旓細1銆佸畾涔鍒ゆ柇绱犳暟鐨鍑芥暟isPrime import math def isPrime(num):sqt = int(math.sqrt(num))for i in range(2, sqt + 1):if num % i == 0:return False return True 2銆佽皟鐢ㄥ嚱鏁板苟鎵撳嵃缁撴灉 a = int(input("璇疯緭鍏ヤ竴涓暟瀛楋細"))if isPrime(a):print(a)else:print("涓嶆槸绱犳暟")3銆侀獙璇...
