Pagini recente » Cod sursa (job #2981868) | Cod sursa (job #2807484) | Cod sursa (job #1921108) | Cod sursa (job #2903411) | Cod sursa (job #770997)
Cod sursa(job #770997)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define mod 666017
vector <long> T[mod+5];
long ok,tip,val,n;
long i,j;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int main()
{
in>>n;
for ( ; n; n-- )
{
in>>tip>>val;
ok=0;
if ( tip == 1 )
{
for ( i=0; i< T[val%mod].size(); i++ )
if ( T[val%mod][i] == val )
{
ok=1;
break;
}
if ( ok )
;
else
T[val%mod].pb(val);
}
if ( tip == 2 )
{
for ( i=0; i< T[val%mod].size(); i++ )
if ( T[val%mod][i] == val )
{
ok=1;
break;
}
if ( ok )
{
T[val%mod][i] = T[val%mod][ T[val%mod].size()-1 ];
T[val%mod].pop_back();
}
}
if ( tip == 3 )
{
for ( i=0; i< T[val%mod].size(); i++ )
if ( T[val%mod][i] == val )
{
ok=1;
break;
}
out<<ok<<"\n";
}
}
return 0;
}