Cod sursa(job #3293638)
| Utilizator | Data | 12 aprilie 2025 10:38:35 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <map>
#include <unordered_map>
using namespace std;
ifstream cin ("hashuri.in");
ofstream cout ("hashuri.out");
int main()
{
map <int,int> m;
int n;
cin>>n;
int c,x;
for (int i=1;i<=n;i++)
{
cin>>c>>x;
if (c==1)
{
m[x]=1;
}
if (c==2)
{
m[x]=0;
}
if (c==3)
{
if (m[x]==1)
{
cout<<"1"<<'\n';
}
else
cout<<"0"<<'\n';
}
}
return 0;
}
