Pagini recente » Cod sursa (job #2376607) | Cod sursa (job #3183054) | Cod sursa (job #1037832) | Cod sursa (job #2164563) | Cod sursa (job #2893782)
#include <bits/stdc++.h>
using namespace std;
ifstream f("hasuri.in");
ofstream g("hasuri.out");
#define cin f
#define cout g
const int mod = 9973;
int main() {
vector<int> tabela[mod];
int t, op, nr;
cin >> t;
while(t--) {
cin >> op >> nr;
int index = nr % mod;
if(op == 1) {
bool gasit = false;
for(int i = 0; i < tabela[index].size(); i++)
if(nr == tabela[index][i]) {
gasit = true;
break;
}
if(!gasit) tabela[index].push_back(nr);
}
else
if(op == 2) {
for(int i = 0; i < tabela[index].size(); i++)
if(nr == tabela[index][i]) {
for(int j = i; j < tabela[index].size(); j++)
tabela[index][j] = tabela[index][j + 1];
tabela[index].pop_back();
break;
}
}
else
if(op == 3) {
bool gasit = false;
for(int i = 0; i < tabela[index].size(); i++)
if(nr == tabela[index][i]) {
gasit = true;
break;
}
if(gasit) cout << "1\n";
else cout << "0\n";
}
}
}