Cod sursa(job #3225294)
Utilizator | Data | 17 aprilie 2024 12:00:21 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unordered_map<int, bool> m;
int n, op, x;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>op>>x;
if(op==1)
m[x]=true;
else if(op==2)
m[x]=false;
else
cout<<m[x]<<'\n';
}
}