Cod sursa(job #2389079)
| Utilizator | Data | 26 martie 2019 19:42:20 | |
|---|---|---|---|
| Problema | Dtcsu | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
void fact(long long &n, int p)
{
while(n%p==0) n=n/p;
}
long long x, n;
unordered_set <long long> H;
int main()
{
for(int i=1; i<=276997; ++i)
{
fin>>x;
if(x&1) H.insert(x);
}
int sol=0,v[5]={2,3,5,7,11};
fin>>n;
for(int i=1; i<=n; ++i)
{
fin>>x;
for(int j=0;j<5;j++) fact(x,v[j]);
if(x==1) sol++;
}
fout<<sol<<"\n";
return 0;
}
