Pagini recente » Cod sursa (job #1765857) | Cod sursa (job #1486924) | Istoria paginii runda/winners21 | Cod sursa (job #898864) | Cod sursa (job #1609105)
#include <iostream>
#include<fstream>
using namespace std;
int v[1000009],n,k,t,x;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int caut(int x)
{
int i;
for(i=k;i>=1;i--)
if(v[i]==x) return i;
return 0;
}
int main()
{int i,j;
fin>>n;
k=0;
for(i=1;i<=n;i++)
{
fin>>t>>x;
j=caut(x);
if(t==1)
{
if(j==0) {k++;
v[k]=x;}
}
if(t==2)
{
if(j>0)
{
v[j]=v[k];
k--;
}
}
if(t==3)
{
fout<<(j>0)<<"\n";
}
}
fout.close();
fin.close();
return 0;
}