Cod sursa(job #1363296)
| Utilizator | Data | 26 februarie 2015 21:05:23 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int main()
{
int n, i;
long fr[100005], a[100005],b[100005];
fin >> n;
for(i = 1 ; i <= n ; ++ i)
{
fin >> a[i] >> b[i];
if(a[i] == 1)
{
if(fr[a[i]] == 0)
fr[a[i]]++;
}
if(a[i] == 2)
{
if(fr[a[i]] == 1)
fr[a[i]]--;
}
if(a[i] == 3)
{
if(fr[a[i]] == 0) fout<<"0"<<'\n';
else
fout<<"1"<<'\n';
}
}
return 0;
}
