Cod sursa(job #2896604)
Utilizator | Data | 30 aprilie 2022 00:00:48 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map <int,int> ump;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,x,y,i;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x>>y;
if(x==1){
ump[y]=1;}
else
if(x==2){
if(ump[y]==1)
ump[y]=0;
}
else
if(x==3)
if(ump[y]==1)
g<<y<<endl;
}
return 0;
}