Pagini recente » Cod sursa (job #1987042) | Cod sursa (job #1720449) | Cod sursa (job #1013038) | Cod sursa (job #2387347) | Cod sursa (job #1043800)
#include<cstdio>
#include<bitset>
#define NMAX 276997
#define LL long long
#define LMAX 5000000
using namespace std;
FILE *fin,*fout;
int v[]={3,5,7,11},q,sol,L;
LL n,nr;
bitset<LMAX> use;
const int SZ=100000;
char input[SZ+1],*in;
union TIP
{
LL n;
char x[8];
}Var;
inline LL conv()
{
LL nr=0;
for(;!(*in>='0' && *in<='9') && *in;in++);
if(in==input+SZ)
{
fread(input,1,SZ,fin);
in=input;
}
for(;*in>='0' && *in<='9';in++)
{
nr=nr*10+(*in-'0');
if(in+1==input+SZ)
{
fread(input,1,SZ,fin);
in=input-1;
}
}
return nr;
}
inline int H(short len, short seed)
{
size_t m = 0x5bd1e995,r = 24,h = seed ^ len;
const unsigned char * data = (const unsigned char *)Var.x;
for(size_t k;len >= 4;data += 4,len -= 4)
{
k = *(unsigned int *)data;
k *= m;
k ^= k >> r;
k *= m;
h *= m;
h ^= k;
}
switch(len)
{
case 3: h ^= data[2] << 16;
case 2: h ^= data[1] << 8;
case 1: h ^= data[0];
h *= m;
};
h ^= h >> 13;
h *= m;
h ^= h >> 15;
return h%LMAX;
}
int main()
{
fin=fopen("dtcsu.in","r");
fout=fopen("dtcsu.out","w");
fread(input,1,SZ,fin);
in=input;
for(int i=0;i<NMAX;i++)
{
Var.n=conv();
if(Var.n^1)
continue;
use[H(8,127)]=1;
use[H(8,126)]=1;
use[H(8,120)]=1;
}
q=conv();
for(;q;q--)
{
Var.n=n=conv();
for(;n^1;n>>=1);
if(!use[H(8,127)] || !use[H(8,126)] || !use[H(8,120)])
continue;
for(int i=0;i<4 && n!=1;i++)
for(;n%v[i]==0;n/=v[i]);
sol+=(n==1);
}
fprintf(fout,"%d",sol);
return 0;
}