HDU 2138 How many prime numbers

 记得 sqrt(a*1.0）或者 sqrt(a)+1

不然开根开出来后会取整，导致wrong answer

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
#define maxn 1050
using namespace std;
int a[maxn];
bool is_Prime(int a){
	int temp=2;
	for(int i=2;i<=sqrt(a*1.0);i++)
	{
		if(a%i) continue;
		else return 0;
	}
	return 1;
}
int main(){
	int n,m=0,index;
	int a1,b1,c1;
	double count=0;
	int t,cnt=0;
	is_prim(1000000);
	while(cin>>t){
		cnt=0;
		for(int i=0;i<t;i++){
			cin>>a[i];
			if(is_Prime(a[i])){
				cnt++;
			}
		}
		cout<<cnt<<endl;
	}
	return 0;
}