Cod sursa(job #1345285)
Utilizator | Data | 17 februarie 2015 15:10:58 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <unordered_map>
#include <fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
unordered_map<int,bool> v;
int main()
{
int n,i,op,x;
in>>n;
for(i=0;i<n;i++)
{
in>>op>>x;
switch(op)
{
case 1:v[x] = 1; break;
case 2:v[x] = 0; break;
case 3:out<<(int)v[x]<<"\n"; break;
}
}
return 0;
}