Pagini recente » Cod sursa (job #2132114) | Cod sursa (job #2733133) | Cod sursa (job #1559580) | Cod sursa (job #2715882) | Cod sursa (job #1032363)
#include <fstream>
#include <algorithm>
using namespace std;
#define Nmax 300000
using namespace std;
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
int Q,sol;
long long N,x;
int main()
{
for(int i=1;i<=276997;++i)f>>x;
f>>Q;
for(int i=1;i<=Q;++i)
{
long long N;
f>>N;
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;
}