Pagini recente » Cod sursa (job #481651) | Cod sursa (job #1177877) | Cod sursa (job #2428722) | Cod sursa (job #499431) | Cod sursa (job #2305860)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin( "hashuri.in" );
ofstream fout( "hashuri.out" );
const int MOD = 100003;
int N;
vector <int> Hash[MOD];
bool Hash_check( int val )
{
int mod = val % MOD;
bool found = false;
for( int i = 0; i < Hash[mod].size(); ++i )
if( Hash[mod][i] == val )
return true;
return false;
}
void Hash_add( int val )
{
if( ! Hash_check( val ) )
Hash[ val % MOD ].push_back( val );
}
void Hash_del( int val )
{
int mod = val % MOD;
for( int i = 0; i < Hash[mod].size(); ++i )
if( Hash[mod][i] == val )
{
Hash[mod][i] = -1;
return;
}
}
void Read()
{
fin >> N;
int op, val;
for( int i = 1; i <= N; ++i )
{
fin >> op >> val;
if( op == 1 ) Hash_add( val );
if( op == 2 ) Hash_del( val );
if( op == 3 ) fout << Hash_check( val ) << '\n';
}
fin.close();
fout.close();
}
int main()
{
Read();
return 0;
}