Mai intai trebuie sa te autentifici.
Cod sursa(job #2177383)
| Utilizator | Data | 18 martie 2018 15:14:51 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.03 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N;
struct List
{
vector <int> val;
};
List Hash[9913];
void Read()
{
fin>>N;
int op,X;
int mod;
bool gasit;
for(int i=1; i<=N; ++i)
{
fin>>op>>X;
mod=X%9913;
if(op==1)
{
gasit=0;
for(int i=0; i<Hash[mod].val.size(); ++i)
if(Hash[mod].val[i]==X)
{
gasit=1;
break;
}
if(gasit==0) Hash[mod].val.push_back(X);
}
if(op==2)
{
gasit=0;
for(int i=0; i<Hash[mod].val.size(); ++i)
if(Hash[mod].val[i]==X)
{
Hash[mod].val.erase(Hash[mod].val.begin()+i);
break;
}
}
if(op==3)
{
gasit=0;
for(int i=0; i<Hash[mod].val.size(); ++i)
if(Hash[mod].val[i]==X)
{
gasit=1;
break;
}
fout<<gasit<<'\n';
}
}
}
int main()
{
Read();
return 0;
}
