Cod sursa(job #2327842)
| Utilizator | Data | 25 ianuarie 2019 00:55:05 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout("hashuri.out");
int n,i,op,x,key;
const int p=7919;
set<int> v[p+3];
int main(){
fin>>n;
for (i=1;i<=n;i++){
fin>>op>>x;
key=x%p;
if (op==1)
v[key].insert(x);
if (op==2)
v[key].erase(x);
if (op==3){
if (v[key].find(x)!=v[key].end())
fout<<"1\n";
else
fout<<"0\n";
}
}
fin.close();
fout.close();
return 0;
}
