Pagini recente » Cod sursa (job #236805) | Cod sursa (job #2041669) | Cod sursa (job #1275097) | Cod sursa (job #1385162) | Cod sursa (job #1035178)
#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 tmp;
int main()
{
for(int i=1;i<=Nmax;++i)getline(f,tmp);
getline(f,tmp);
Q=0;
for(int i=0;i<tmp.size();++i)Q=Q*10+(tmp[i]-'0');
for(int i=1;i<=Q;++i)
{
getline(f,tmp);
long long N=0;
for(int i=0;i<tmp.size();++i)N=N*10+(tmp[i]-'0');
g<<N<<'\n';
while(N && N%2==0)N/=2;
while(N && N%3==0)N/=3;
while(N && N%5==0)N/=5;
while(N && N%7==0)N/=7;
while(N && N%11==0)N/=11;
if(N==1)++sol;
}
g<<sol<<'\n';
f.close();g.close();
return 0;
}