Pagini recente » Cod sursa (job #1130237) | Cod sursa (job #2672719) | Istoria paginii runda/pregatireoji-lensumin120pct2 | Cod sursa (job #1067530) | Cod sursa (job #1041090)
#include<fstream>
#include<algorithm>
#include<cstring>
#include<bitset>
#define DIM 10000000
#define M1 846733
#define M2 841219
#define M3 522337
#define M4 661231
#define C 276997
using namespace std;
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
char s[DIM];
bitset<M1> H1;
bitset<M2> H2;
bitset<M3> H3;
bitset<M4> H4;
long long nr;
int sol,st,dr,mij,t,nb,i,n;
int main ()
{
f.get(s,DIM,EOF);
while(s[0])
{
n=strlen(s);
for(i=0;i<n;++i)
{
if(s[i]<='9'&&s[i]>='0')
nr=nr*10+s[i]-'0';
else
{
if(nb>C)
{
while(!(nr&1))
nr>>=1;
if(!H1[nr%M1]||!H2[nr%M2]||!H3[nr%M3]||!H4[nr%M4])
continue;
while(nr%3==0)
nr/=3;
while(nr%5==0)
nr/=5;
while(nr%7==0)
nr/=7;
while(nr%11==0)
nr/=11;
if(nr==1)
sol++;
}
else
if(nb<C)
{
nb++;
if(!(nr&1))
continue;
H1[nr%M1]=1;
H2[nr%M2]=1;
H3[nr%M3]=1;
H4[nr%M4]=1;
}
else
nb++;
nr=0;
}
}
f.get(s,DIM,EOF);
}
g<<sol;
return 0;
}