Cod sursa(job #764725)
| Utilizator | Data | 5 iulie 2012 23:30:43 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
# include <fstream>
# include <iostream>
# include <set>
# define P 16843
using namespace std;
set<int>S[P+10];
int main ()
{
ifstream fin("hashuri.in");
ofstream fout ("hashuri.out");
int n;
fin>>n;
int op, x;
for(int i=1;i<=n;++i)
{
fin>>op>>x;
int indx=x%P;
if (op==1)S[indx].insert(x);
if (op==2)S[indx].erase(x);
if (op==3)
{
if (S[indx].find(x)!=S[indx].end())
fout<<"1\n";
else
fout<<"0\n";
}
}
return 0;
}
