Cod sursa(job #2304189)
| Utilizator | Data | 17 decembrie 2018 18:03:24 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <int> meow;
int n, a, b;
int main()
{
fin >> n;
for (int i=1;i<=n;i++) {
fin >> a >> b;
if (a==1) meow.push_back(b);
else if (a==2) {
for (int h=1;h<=meow.size();h++)
if (meow[h]==b) {swap(meow[h],meow[meow.size()]); meow.pop_back(); h = h-1;}
}
else {
if (find(meow.begin(),meow.end(),b)!=meow.end()) fout << 1 << '\n';
else fout << 0 << '\n';
}
}
return 0;
}
