Cod sursa(job #1037949)
Utilizator | Data | 20 noiembrie 2013 21:31:24 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, x;
int t;
unordered_map<int, int> m;
int main()
{
f>>n;
while(n--){
f>>t>>x;
if(t==1) m[x]=1;
if(t==2) m[x]=0;
if(t==3)
if(m[x]) g<<1<<'\n';
else g<<0<<'\n';
}
return 0;
}