Cod sursa(job #2772065)
Utilizator | Data | 30 august 2021 17:25:18 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.21 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> H[999983];
int main()
{
int N,op,x,a;
f>>N;
for(a=1; a<=N; a++)
{
f>>op>>x;
if(op==1)
{
int i=x%999983,ok=0;
for(int j=0; j<H[i].size(); j++)
if(x==H[i][j])
{
ok=1;
break;
}
if(ok==0)
H[i].push_back(x);
}
else if(op==2)
{
int i=x%999983;
for(int j=0; j<H[i].size(); j++)
if(x==H[i][j])
{
H[i][j]=H[i][H[i].size()-1];
H[i].pop_back();
break;
}
}
else
{
int i=x%999983,ok=0;
for(int j=0; j<H[i].size(); j++)
if(x==H[i][j])
{
ok=1;
break;
}
if(ok==1)
g<<"1\n";
else
g<<"0\n";
}
}
return 0;
}