Pagini recente » iconcurs17 | Cod sursa (job #597072) | Cod sursa (job #2869693) | Cod sursa (job #1811245) | Cod sursa (job #1802753)
#include<fstream>
#include<bitset>
using namespace std;
ofstream out("dtcsu.out");
int hash_keys[5] = { 666013, 1000003, 826663, 797593, 959473 };
bitset<1000006> bloom_filter [5];
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
}
else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
}
else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
int main()
{
long long x;
InParser in("dtcsu.in");
for (int i = 1; i <= 276997; ++i)
{
in >> x;
for (int j = 0; j < 3; ++j)
bloom_filter[j][x%hash_keys[j]] = 1;
}
int Q,nr=0;
in >> Q;
for (int i = 1; i <= Q; ++i)
{
in >> x;
int j;
for (j = 0; j < 3; ++j)
if (bloom_filter[j][x%hash_keys[j]] == 0)
break;
if (j == 3)
{
if (x)
x /= x&(-x);
while (x % 15 == 0)
x /= 15;
while (x %= 35)
x /= 35;
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;
}