#100377 (Python3) No.308 素数は通れません

• 問題: No.308 素数は通れません
• ユーザー: paruki
• 提出日時: 2016-06-29 09:48:29
• 言語: Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
• 結果: AC
• 実行時間: 27 ms / 1,000 ms
• コード長: 676 bytes
• コンパイル時間: 92 ms
• コンパイル使用メモリ: 10,808 KB
• 実行使用メモリ: 9,688 KB
• 最終ジャッジ日時: 2023-08-18 13:27:12
• 合計ジャッジ時間: 6,401 ms
• ジャッジサーバーID （参考情報）: judge11 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	26 ms; 9,508 KB
testcase_01	AC	27 ms; 9,528 KB
testcase_02	AC	26 ms; 9,480 KB
testcase_03	AC	26 ms; 9,632 KB
testcase_04	AC	26 ms; 9,672 KB
testcase_05	AC	25 ms; 9,476 KB
testcase_06	AC	26 ms; 9,528 KB
testcase_07	AC	26 ms; 9,484 KB
testcase_08	AC	26 ms; 9,624 KB
testcase_09	AC	26 ms; 9,476 KB
testcase_10	AC	26 ms; 9,624 KB
testcase_11	AC	26 ms; 9,584 KB
testcase_12	AC	26 ms; 9,632 KB
testcase_13	AC	26 ms; 9,448 KB
testcase_14	AC	26 ms; 9,440 KB
testcase_15	AC	27 ms; 9,444 KB
testcase_16	AC	26 ms; 9,528 KB
testcase_17	AC	25 ms; 9,508 KB
testcase_18	AC	26 ms; 9,528 KB
testcase_19	AC	25 ms; 9,632 KB
testcase_20	AC	27 ms; 9,672 KB
testcase_21	AC	25 ms; 9,588 KB
testcase_22	AC	27 ms; 9,620 KB
testcase_23	AC	26 ms; 9,680 KB
testcase_24	AC	26 ms; 9,640 KB
testcase_25	AC	26 ms; 9,680 KB
testcase_26	AC	26 ms; 9,616 KB
testcase_27	AC	26 ms; 9,636 KB
testcase_28	AC	26 ms; 9,528 KB
testcase_29	AC	25 ms; 9,640 KB
testcase_30	AC	26 ms; 9,508 KB
testcase_31	AC	26 ms; 9,480 KB
testcase_32	AC	26 ms; 9,504 KB
testcase_33	AC	26 ms; 9,684 KB
testcase_34	AC	26 ms; 9,512 KB
testcase_35	AC	27 ms; 9,628 KB
testcase_36	AC	26 ms; 9,680 KB
testcase_37	AC	26 ms; 9,628 KB
testcase_38	AC	26 ms; 9,480 KB
testcase_39	AC	26 ms; 9,580 KB
testcase_40	AC	26 ms; 9,636 KB
testcase_41	AC	26 ms; 9,632 KB
testcase_42	AC	26 ms; 9,508 KB
testcase_43	AC	26 ms; 9,516 KB
testcase_44	AC	25 ms; 9,580 KB
testcase_45	AC	25 ms; 9,620 KB
testcase_46	AC	25 ms; 9,440 KB
testcase_47	AC	25 ms; 9,636 KB
testcase_48	AC	26 ms; 9,608 KB
testcase_49	AC	26 ms; 9,512 KB
testcase_50	AC	26 ms; 9,612 KB
testcase_51	AC	26 ms; 9,640 KB
testcase_52	AC	26 ms; 9,528 KB
testcase_53	AC	26 ms; 9,508 KB
testcase_54	AC	25 ms; 9,480 KB
testcase_55	AC	26 ms; 9,508 KB
testcase_56	AC	26 ms; 9,680 KB
testcase_57	AC	26 ms; 9,612 KB
testcase_58	AC	26 ms; 9,480 KB
testcase_59	AC	26 ms; 9,680 KB
testcase_60	AC	26 ms; 9,672 KB
testcase_61	AC	26 ms; 9,632 KB
testcase_62	AC	26 ms; 9,524 KB
testcase_63	AC	25 ms; 9,608 KB
testcase_64	AC	26 ms; 9,632 KB
testcase_65	AC	25 ms; 9,480 KB
testcase_66	AC	26 ms; 9,508 KB
testcase_67	AC	26 ms; 9,688 KB
testcase_68	AC	26 ms; 9,528 KB
testcase_69	AC	26 ms; 9,648 KB
testcase_70	AC	25 ms; 9,528 KB
testcase_71	AC	26 ms; 9,480 KB
testcase_72	AC	26 ms; 9,512 KB
testcase_73	AC	26 ms; 9,636 KB
testcase_74	AC	26 ms; 9,640 KB
testcase_75	AC	26 ms; 9,508 KB
testcase_76	AC	25 ms; 9,576 KB
testcase_77	AC	26 ms; 9,508 KB
testcase_78	AC	26 ms; 9,504 KB
testcase_79	AC	26 ms; 9,528 KB
testcase_80	AC	26 ms; 9,496 KB
testcase_81	AC	26 ms; 9,684 KB
testcase_82	AC	26 ms; 9,688 KB
testcase_83	AC	26 ms; 9,616 KB
testcase_84	AC	27 ms; 9,624 KB
testcase_85	AC	27 ms; 9,512 KB
testcase_86	AC	27 ms; 9,636 KB
testcase_87	AC	26 ms; 9,636 KB
testcase_88	AC	26 ms; 9,576 KB
testcase_89	AC	25 ms; 9,444 KB
testcase_90	AC	26 ms; 9,628 KB
testcase_91	AC	25 ms; 9,640 KB
testcase_92	AC	26 ms; 9,500 KB
testcase_93	AC	26 ms; 9,640 KB
testcase_94	AC	25 ms; 9,512 KB
testcase_95	AC	27 ms; 9,480 KB
testcase_96	AC	27 ms; 9,676 KB
testcase_97	AC	26 ms; 9,480 KB
testcase_98	AC	26 ms; 9,608 KB
testcase_99	AC	26 ms; 9,500 KB
testcase_100	AC	26 ms; 9,636 KB
testcase_101	AC	26 ms; 9,680 KB
testcase_102	AC	26 ms; 9,472 KB
testcase_103	AC	26 ms; 9,472 KB
testcase_104	AC	26 ms; 9,620 KB
testcase_105	AC	26 ms; 9,484 KB
testcase_106	AC	26 ms; 9,572 KB

ソースコード

import random
import queue

def is_prime(n):
	if n==1: return False
	if n==2: return True
	if n%2==0: return False
	q = (n-1)>>1
	while q&1 == 0:
		q >>= 1
	# print("n={}, q={}".format(n, q))
	for i in range(30):
		a = random.randint(1, n-1)
		a_pow = pow(a, q, n)
		if a_pow == 1:
			continue
		j = 0
		while a_pow != n-1 and (1<<(j+1))*q != n-1:
			a_pow *= a_pow
			a_pow %= n
			j+=1
		if (1<<(j+1))*q==n-1 and a_pow != n-1:
			return False
	return True

magic = [0, 1, 0, 0, 3, 0, 5, 0, 7, 7, 7, 0, 11, 0, 13, 7, 7, 0, 8, 0, 19, 19, 7, 0, 23, 23, 8, 8, 8, 0]
N = int(input())
if N < 30:
	print(magic[N])
else:
	if N%8 == 1 and is_prime(N-8):
		print(14)
	else:
		print(8)