Pagini recente » Cod sursa (job #2875740) | Cod sursa (job #1043927) | Cod sursa (job #3130928) | Cod sursa (job #1442046) | Cod sursa (job #3130872)
#include <fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
struct lista
{
long element;
lista *next;
};
lista lis[100001];
int main()
{
long long n,x,ind,i,op;
in>>n;
lista *list1,*list2;
for(i=1;i<=n;i++)
{
in>>op>>x;
ind= x % 100000 - 1;
list1= lis + ind;
if (op==1)
{while (list1->next && list1->element != x)
list1=list1->next;
if (list1->element != x)
{
list2=new lista;
list2->element=x;
list2->next=NULL;
list1->next=list2;
}
}
else
if(op==2)
{
while(list1->next && list1->next->element != x)
list1=list1->next;
if (list1->next)
{ list2=list1->next;
list1->next=list1->next->next;
delete list2;
}
}
else
if (op==3)
{
while(list1->next && list1->element != x)
list1=list1->next;
if (list1->element == x) out << 1 << endl;
else out<<0<<"\n";
}
}
in.close();
out.close();
return 0;
}