Cod sursa(job #1891290)
Utilizator | Data | 23 februarie 2017 21:30:07 | |
---|---|---|---|
Problema | Hashuri | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int mod=666013;
int n,tip,x,m;
set <int> a[mod];
set <int>::iterator cauta;
int main()
{
f>>n;
while(n--)
{
f>>tip>>x;
m=x%mod;
cauta=a[m].find(x);
if(tip==1&&cauta==a[m].end())
a[m].insert(x);
else if(tip==2&&cauta!=a[m].end())
a[m].erase(cauta);
else if(tip==3)
g<<(cauta!=a[m].end())<<endl;
}
return 0;
}