Cod sursa(job #2890940)
| Utilizator | Data | 17 aprilie 2022 00:17:06 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
#define PRM 666013
vector<int> v[PRM + 2];
int main()
{
int n,i,j,k,tip,nr,ok,cheie;
fin>>n;
for(i = 1; i<=n; i++)
{
fin>>tip>>nr;
cheie = nr % PRM;
if(tip == 1)
{
ok = 1;
for(int j = 0; j< v[cheie].size(); j++)
{
if(v[cheie][j] == nr){
ok = 0;
break;
}
}
if(ok == 1)
v[cheie].push_back(nr);
}
else if(tip == 2)
{
ok = 1;
for(int j = 0; j< v[cheie].size(); j++)
{
if(v[cheie][j] == nr){
ok = 0;
break;
}
}
if(ok == 0)
v[cheie].erase(v[cheie].begin() + j);
}
else if(tip == 3)
{
ok = 1;
for(j = 0; j<v[cheie].size(); j++)
{
if(v[cheie][j] == nr)
{
fout<<1<<'\n';
ok = 0;
break;
}
}
if(ok == 1)
{
fout<<0<<'\n';
}
}
}
return 0;
}
