Cod sursa(job #724025)
| Utilizator | Data | 26 martie 2012 10:07:12 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#include<set>
#include<algorithm>
#define _B 262144
using namespace std;
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
static set<int> hash_t[_B];
int nOp; fin>>nOp;
for (int i=1;i<=nOp;i++)
{
int op, val;
fin>>op>>val;
switch (op)
{
case 1: hash_t[val%_B].insert(val); break;
case 2:
if (hash_t[val%_B].count(val)==1)
hash_t[val%_B].erase(val);
break;
case 3: fout<<hash_t[val%_B].count(val)<<'\n';
}
}
return 0;
}
