Cod sursa(job #1364362)
| Utilizator | Data | 27 februarie 2015 17:15:25 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,Q,x;
map<int,bool> m;
set<int> S;
int main()
{
f>>n;
while(n--)
{
f>>Q>>x;
if (Q == 1)
m[x] = 1;
else if (Q == 2)
m[x] = 0;
else g<<(m[x]?1:0)<<'\n';
}
return 0;
}
