Cod sursa(job #3276341)
Utilizator | Data | 13 februarie 2025 13:46:30 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <unordered_map>
#define nmax (int)(5e4+1)
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int n,x,task;
unordered_map<int,bool>mp;
signed main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>task>>x;
if(task==1)
mp[x]=1;
else if(task==2)
mp[x]=0;
else
cout<<mp[x]<<'\n';
}
return 0;
}