Cod sursa(job #2317067)
Utilizator | Onut Andrei andreiomd1 | Data | 12 ianuarie 2019 18:57:59 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int MOD=666013;
set <int> H[MOD];
int N;
int main()
{
f.tie(NULL);
f>>N;
while(N--)
{
int Type, X;
f>>Type>>X;
if(Type == 1)
H[X%MOD].insert(X);
else if(Type == 2)
H[X%MOD].erase(X);
else
{
if(H[X%MOD].find(X) != H[X%MOD].end())
g<<1;
else
g<<0;
g<<'\n';
}
}
return 0;
}