HDU 2138 How many prime numbers
Is to find the prime number. Very watery question. Fuzzy search for a question.
But it is twice. Change all long to int and % lld to % d.
Incredible.
#include
#include
#include
#include
#include#include
#include
#include
#include
#include
#include
#include
#define INF 0x7fffffff#define eps 1e-8#define LL long long#define PI 3.141592654#define CLR(a,b) memset(a,b,sizeof(a))#define FOR(i,a,b) for(int i=a;i
=b;i--)#define pb push_back#define mp make_pair#define ft first#define sd second#define sf scanf#define pf printf#define sz(v) ((int)(v).size())#define all(v) (v).begin(),(v).end()#define acfun std::ios::sync_with_stdio(false)#define SIZE 1000 +1using namespace std;bool is_prime(int m){ for(int i=2;i<=sqrt(m);i++) if(m%i==0)return 0; return 1;}int main(){ int m; while(~sf("%d",&m)) { int ans=0; while(m--) { int n; sf("%d",&n); if(is_prime(n))ans++; } pf("%d\n",ans); }}