Cod sursa(job #3211590)
Utilizator | Data | 9 martie 2024 16:32:02 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.99 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
vector <int> v[666040];
int i, j, n, x, op, k, ok, sff, val, p;
int main()
{
fin>>n;
for(j=1; j<=n; j++)
{
fin>>op>>x;
val=x%666013;
if(op == 1)
{
ok=0;
for(i=0; i<v[val].size(); i++)
if(v[val][i] == x)
ok=1;
if(ok==0)
v[val].push_back(x);
}
if(op == 2)
for(i=0; i<v[val].size(); i++)
if(v[val][i] == x)
v[val].erase(v[val].begin()+i);
if(op == 3)
{
ok=0;
for(i=0; i<v[val].size(); i++)
if(v[val][i] == x)
{
fout<<1<<endl;
ok=1;
break;
}
if(ok == 0)
fout<<0<<endl;
}
}
}