Pagini recente » Cod sursa (job #985257) | Cod sursa (job #1479025) | Cod sursa (job #1759033) | Cod sursa (job #1584786) | Cod sursa (job #1035579)
#include<fstream>
#include<algorithm>
#include<cstdlib>
#define NMAX 276997
#define LL long long
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
int v[]={2,3,5,7,11},q,sol;
LL n,nr;
const int SZ=50000;
char input[SZ+1],*in;
LL atoi()
{
for(;!(*in>='0' && *in<='9') && *in;in++);
if(!*in)
{
fin.read(input,SZ);
in=input;
for(;!(*in>='0' && *in<='9') && *in;in++);
}
for(nr=0LL;*in>='0' && *in<='9';in++)
{
nr=nr*10+(*in-'0');
if(!*(in+1))
{
fin.read(input,SZ);
in=input-1;
}
}
return nr;
}
int main()
{
for(int i=0;i<NMAX;i++)
fin.getline(input,SZ);
fin.read(input,SZ);
in=input;
q=atoi();
for(;q;q--)
{
n=atoi();
for(int i=1;i<5;i++)
for(;n%v[i]==0;n/=v[i]);
if(n>=1 && (n&(n-1))==0)
sol++;
}
fout<<sol;
return 0;
}