Pagini recente » Cod sursa (job #2166656) | Cod sursa (job #1644848) | Cod sursa (job #2225664) | Cod sursa (job #631256) | Cod sursa (job #2670544)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int mod = 818959;
vector <int> v[mod];
int main()
{
int n;
fin >> n;
for(int i = 0; i < n; i++)
{
int c, x;
fin >> c >> x;
if(c == 1)
{
v[x % mod].push_back(x);
}
if(c == 2)
{
int nr = x % mod;
for(int j = 0; j < v[nr].size(); j++)
if(v[nr][j] == x)
v[nr][j] = -1;
}
if(c == 3)
{
int nr = x % mod;
bool ok = 0;
for(int j = 0; j < v[nr].size(); j++)
if(v[nr][j] == x)
{
ok = 1;
break;
}
fout << ok << '\n';
}
}
}