Cod sursa(job #1602451)
| Utilizator | Data | 16 februarie 2016 19:45:07 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_set>
#define mod 13831
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[mod];
int n;
unordered_set<int> m;
int main()
{ int i,t,x;
f>>n;
for(i=1;i<=n;i++)
{ f>>t>>x;
if (t==1) m.insert(x);
if (t==2) m.erase(x);
if (t==3) g<<((m.count(x))>0)<<"\n";
}
return 0;
}
