Cod sursa(job #3005419)
Utilizator | Data | 16 martie 2023 23:06:47 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <unordered_map>
#include <fstream>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, bool> f;
int main()
{
int q, i, t, x;
fin>>q;
for(i=1;i<=q;i++)
{
fin>>t>>x;
if(t==1)
{
f[x]=1;
}
else
if(t==2)
{
f[x]=0;
}
else
{
if(f[x]==1)
{
fout<<1<<"\n";
}
else
{
fout<<0<<"\n";
}
}
}
}