题解：How many prime numbers（Miller-Rabin测试算法模板32位内素数检查）

Give you a lot of positive integers, just to find out how many prime numbers there are.
Input
There are a lot of cases. In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32-bit signed integer, and each of them won’t be less than 2.
Output
For each case, print the number of prime numbers you have found out.
Sample Input
3
2 3 4
Sample Output
2

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long quickpow(long long a,long long b,long long m)
{
 long long c=1;
 while(b)
 {
  if(b%2) c=(c*a)%m;
  a=(a*a)%m;
  b/=2;	
 }
 return c;	
}
bool Miller_Rabin(long long x,long long n)//选取x为底，判定n是否可能为素数
{
 long long y=n-1;
 while(!(y&1)) y>>=1;
 x