Cod sursa(job #357695)
| Utilizator | Data | 20 octombrie 2009 12:41:59 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <vector>
#include <set>
using namespace std;
const int prim=19009 ;
int main(){
set<int> v[prim];
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int n;in>>n;
for(int i=0;i<n;i++){
int c,x;in>>c>>x;
if(c==1){
v[x%prim].insert(x);
}
if(c==2){
v[x%prim].erase(x);
}
if(c==3){
if(v[x%prim].find(x)!=v[x%prim].end()) out<<1<<"\n";
else out<<0<<"\n";
}
}
}
