Cod sursa(job #2861892)
Utilizator | Data | 4 martie 2022 17:25:05 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,i,c,x;
unordered_map <int,int> m;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>c>>x;
if(c==1)
m[x]=1;
else
if(c==2)
m[x]=0;
else
g<<m[x]<<'\n';
}
return 0;
}