Cod sursa(job #2601336)
| Utilizator | Data | 14 aprilie 2020 12:49:20 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <stdio.h>
#include <unordered_map>
using namespace std;
unordered_map<int, int> mapi;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int n;
int t;
int nr;
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%d", &t);
scanf("%d", &nr);
if(t==1){
if(mapi[nr]==0){
mapi[nr] = 1;
}
}
if(t==2){
if(mapi[nr]==1){
mapi[nr] = 0;
}
}
if(t==3){
printf("%d\n", mapi[nr]);
}
}
}
