水了一下Miller-Rabin
代码巨水无比……虽然有一定概率出错，但小于0.01（测5组）
logn测试素数，很优秀
codevs素数判定2
http://codevs.cn/problem/1702/
1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> 4 #include<iostream> 5 #include<algorithm> 6 #define eps (0.5) 7 #define RG register 8 using namespace std; 9 typedef long long LL; 10 LL n; 11 int biao[367]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477}; 12 inline LL gll(){ 13 RG LL x=0;RG bool flag=0;RG char c=getchar(); 14 while((c<'0'||c>'9')&&c!='-') c=getchar(); 15 if(c=='-') c=getchar(),flag=1; 16 while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar(); 17 return flag?-x:x; 18 } 19 inline bool check(){ 20 for (RG int i=0;i<367&&biao[i]<n;++i) 21 if(n%biao[i]==0) 22 return 1; 23 return 0; 24 } 25 inline LL fbc(RG LL a,RG LL b){return (a*b-(LL)((long double)a/n*(long double)b+eps)*n+n)%n;} 26 inline LL q_pow(RG LL a,RG LL lim){ 27 LL ans=1; 28 while(lim){ 29 if(lim&1) ans=fbc(ans,a); 30 lim>>=1; 31 a=fbc(a,a); 32 } 33 return ans; 34 } 35 inline bool MR(){ 36 if(n==2) return 1; 37 if(n<2||check()) return 0; 38 for (RG int i=1;i<=5;++i){ 39 LL a=rand()%(n-2)+2; 40 if(q_pow(a,n)!=a) 41 return 0; 42 } 43 return 1; 44 } 45 inline void work(){ 46 n=gll(); 47 if(MR()) printf("Yes "); 48 else printf("No "); 49 } 50 int main(){ 51 work(); 52 return 0; 53 }