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