Cod sursa(job #3128535)
Utilizator | Data | 9 mai 2023 20:10:23 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
unordered_map<int,bool> m;
int n,x,y;
int main()
{
in>>n;
for(int i=0;i<n;i++)
{in>>x>>y;
if(x==1)
m[y]=true;
else if(x==2)
m[y]=false;
else
out<<m[y]<<"\n";
}
return 0;
}