Pagini recente » Cod sursa (job #1289861) | Cod sursa (job #1770125) | Cod sursa (job #2385812) | Cod sursa (job #2268741) | Cod sursa (job #1035044)
#include <fstream>
#include <stdio.h>
#include <algorithm>
#define Nmax 276997
using namespace std;
//ifstream f("dtcsu.in");
//ofstream g("dtcsu.out");
int Q,sol;
long long N,x;
int main()
{
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
for(int i=1;i<=Nmax;++i)scanf("%lld\n",&N);
//f>>Q;
scanf("%d\n",&Q);
for(int i=1;i<=Q;++i)
{
long long N;
//f>>N;
scanf("%d\n",&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;
}
printf("%d\n",sol);
//g<<sol<<'\n';
//f.close();g.close();
return 0;
}