Pagini recente » Istoria paginii utilizator/mihaiprodann | Monitorul de evaluare | Cod sursa (job #1251714) | Cod sursa (job #1115964) | Cod sursa (job #1994792)
#include <fstream>
#include <vector>
using namespace std;
const int mod = 666013;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, x, op;
vector<int> v[mod];
/*void DisplayMatrix()
{
for (int j = 0;j < mod;j++)
{
for (int i = 0;i < v[j].size();i++)
cout << v[j][i] << " ";
cout << "\n";
}
}*/
void add()
{
v[x%mod].push_back(x);
}
void remove()
{
int j = x % mod;
for (int i = 0;i < v[j].size();i++)
if(v[j][i] == x)
{
v[j][i] = v[j].back();
v[j].pop_back();
}
}
int search()
{
int j = x % mod;
for (int i = 0;i < v[j].size();i++)
if (v[j][i] == x)
return 1;
return 0;
}
int main()
{
f >> n;
for (int i = 1;i <= n;i++)
{
f >> op >> x;
if (op == 1)
add();
if (op == 2)
remove();
if (op == 3)
if (search())
g << 1 << "\n";
else
g << 0 << "\n";
}
f.close();
g.close();
return 0;
}