Cod sursa(job #2892558)
| Utilizator | Data | 22 aprilie 2022 18:18:38 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.21 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int N, operatie, numar;
vector <int> v;
int main()
{
fin>>N;
for(int i=0;i<N;i++)
{
fin>>operatie>>numar;
if(operatie==1)
{
if(v.empty())
v.push_back(numar);
else
{
int ok1=0;
for(int j=0;j<v.size();j++)
if(v[j]==numar)
ok1=1;
if(ok1==0)
v.push_back(numar);
}
}
else if(operatie==2)
{
int pozitie=-1;
for(int k=0;k<v.size();k++)
if(v[k]== numar)
{
pozitie=k;
break;
}
if(pozitie!=-1)
{
swap(v[pozitie],v[v.size()-1]);
v.pop_back();
}
}
else
{
int ok3=0;
for(int j=0;j<v.size();j++)
if(v[j]==numar)
ok3=1;
fout<<ok3<<'\n';
}
}
return 0;
}
