Cod sursa(job #1481383)
Utilizator | Data | 4 septembrie 2015 12:39:07 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
unordered_map <int,bool> M;
int main()
{
int n,x,op;
f>>n;
for(int i=1;i<=n;i++)
{
f>>op>>x;
if(op==1)
M[x]=1;
else
if(op==2)
M[x]=0;
else
g<<M[x]<<"\n";
}
return 0;
}