hdu2138 How many prime numbers 米勒测试

hdu2138 How many prime numbers

 #include <bits/stdc++.h>
 using namespace std;
 typedef long long ll;

 ll prime[] = {,,,,};
 ll qmul(ll a, ll b, ll mod) {
     ll res = ;
     while (b) {
         if (b&) res = (res+a)%mod;
         a = (a+a)%mod;
         b >>= ;
     }
     return res;
 }
 ll qpow(ll a, ll b, ll mod) {
     ll res = ;
     while (b) {
        if (b&) res = qmul(res,a,mod);
        a = qmul(a,a,mod);
        b >>= ;
     }
     return res;
 }
 bool Miller_Rabin(ll p) {
     if (p < ) return ;
     if (p !=  && p %  == ) return false;
     ll s = p-;
     while (!(s&)) s >>= ;
     for (int i = ; i < ; i++) {
         if (p == prime[i]) return true;
         ll t = s, m = qpow(prime[i],s,p);
         while (t != p- && m !=  && m != p-) {
             m = qmul(m,m,p);
             t <<= ;
         }
         if (m != p- && !(t&)) return false;
     }
     return true;
 }
 int main() {
     int n;
     while (~scanf("%d",&n)) {
         int ans = ;
         for (int i = ; i <= n; i++) {
                 ll x; scanf("%lld",&x);
             if (Miller_Rabin(x)) ans++;
         }
         printf("%d\n",ans);
     }
     return ;
 }