Pagini recente » Cod sursa (job #2751824) | Cod sursa (job #1193869) | Cod sursa (job #281678) | Cod sursa (job #1314532) | Cod sursa (job #1387814)
#include <fstream>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int v[1000002], n, nr;
unsigned tip_1(int x)
{
nr++;
v[nr]=x;
//sort()
}
unsigned tip_2(int x)
{
int i=1;
while(v[i]!=x)
i++;
for(i=i+1; i<=nr; i++)
v[i-1]=v[i];
}
unsigned tip_3(int x)
{
int a=0, b=1;
for(int i=1;i<=n;i++)
if(v[i]==x)
{
fout<<"1\n";
return 0;
}
fout<<"0\n";
}
int main()
{
fin>>n;
int t, x;
for(int i=1;i<=n;i++)
{
v[0]=nr;
fin>>t>>x;
if(t==1)
tip_1(x);
if(t==2)
tip_2(x);
if(t==3)
tip_3(x);
}
return 0;
}