Pagini recente » Cod sursa (job #41817) | Cod sursa (job #1949819) | Cod sursa (job #1839382) | Cod sursa (job #918774) | Cod sursa (job #1144321)
#include<fstream>
#include<vector>
using namespace std;
ifstream in( "hashuri.in" );
ofstream out( "hashuri.out" );
const int mod = 666013;
vector <int> has[mod];
int p, x, n, key, j;
bool avem;
int main()
{
int player_unu=0;
in>>n;
for(int i = 0; i < n; i++)
{
in>>p>>x;
key = x % mod;
for(j = 0; j<(int)has[key].size(); j++)
{
if(has[key][j]==x)
{
avem = 1;
break;
}
}
if(p==1 && avem==0)
{
has[key].push_back(x);
}
if (p==2 && avem==1)
{
has[key][j] = has[key][has[key].size() - 1];
has[key].resize(has[key].size() - 1);
}
if (p==3)
{
out<<avem<<'\n';
}
avem = 0;
}
return player_unu;
}