Pagini recente » Cod sursa (job #683089) | Cod sursa (job #1974614) | Cod sursa (job #2079354) | Cod sursa (job #851168) | Cod sursa (job #1035170)
#include <fstream>
#include <algorithm>
#include <string>
using namespace std;
#define Nmax 276997
using namespace std;
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
int Q,sol;
long long N,x;
string S[50];
int main()
{
for(int i=1;i<=Nmax;++i)
{
string line;
getline(f,line);
}
f>>Q;
for(int i=1;i<=Q;++i)
{
string line;
getline(f,line);
long long N=0;
for(int j=0;j<=line.size();++j)N=N*10+(line[j]-'0');
while(N%2==0)N/=2;
while(N%3==0)N/=3;
while(N%5==0)N/=5;
while(N%7==0)N/=7;
while(N%11==0)N/=11;
if(N==1)++sol;
}
g<<sol<<'\n';
f.close();g.close();
return 0;
}