Pagini recente » Cod sursa (job #388817) | Cod sursa (job #493055) | Cod sursa (job #597467) | Cod sursa (job #2650935) | Cod sursa (job #1802656)
#include<fstream>
using namespace std;
ifstream in("dtcsu.in");
ofstream out("dtcsu.out");
#define MOD 666037
bool bloom_filter[666037];
int main()
{
unsigned long long x;
for (int i = 1; i <= 276997; ++i)
{
in >> x;
bloom_filter[x % MOD] = 1;
bloom_filter[(x+27) % MOD] = 1;
bloom_filter[(x+314) % MOD] = 1;
bloom_filter[(x+42424) % MOD] = 1;
bloom_filter[(x+131234) % MOD] = 1;
}
int Q,nr=0;
in >> Q;
for (int i = 1; i <= Q; ++i)
{
in >> x;
if (bloom_filter[x % MOD] & bloom_filter[(x + 27) % MOD] & bloom_filter[(x + 314) % MOD] & bloom_filter[(x + 42424) % MOD] & bloom_filter[(x + 131234) % MOD])
{
while (x % 2 == 0)
x /= 2;
while (x % 3 == 0)
x /= 3;
while (x % 5 == 0)
x /= 5;
while (x % 7 == 0)
x /= 7;
while (x % 11 == 0)
x /= 11;
nr += (x == 1);
}
}
out << nr;
return 0;
}