Cod sursa(job #2680490)
| Utilizator | Data | 3 decembrie 2020 17:24:31 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<cstdio>
#include<queue>
#include<map>
#include<unordered_map>
using namespace std;
FILE*in=fopen("hashuri.in","r");
FILE*out=fopen("hashuri.out","w");
//const int P1=1000000007,P2=1000000009;
int n,i,op,a;
unordered_map<int,bool> m;
int main()
{
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(in,"%d%d",&op,&a);
if(op==1)
{
m[a]=1;
}
else if(op==2)
{
m[a]==0;
}
else
{
fprintf(out,"%d\n",m[a]);
}
}
}
