Pagini recente » Cod sursa (job #434707) | Cod sursa (job #1117383) | Cod sursa (job #670953) | Cod sursa (job #1117333) | Cod sursa (job #1766423)
#include <vector>
#include <fstream>
#include <iostream>
#define MOD 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector < int > mylist[MOD];
int n;
inline vector <int>:: iterator find_value(int x)
{
x = x % MOD;
for(vector<int>::iterator it = mylist[x].begin(); it != mylist[x].end(); ++it)
{
if(*it == x) return it;
}
return mylist[x].end();
}
inline void insert_list(int x)
{
x = x % MOD;
if(find_value(x) == mylist[x].end())
{
mylist[x].push_back(x);
}
}
inline void delete_list(int x)
{
x = x % MOD;
vector <int>::iterator it = find_value(x);
if(it != mylist[x].end())
{
mylist[x].erase(it);
}
}
inline void search_list(int x)
{
g << (find_value(x) != mylist[x].end()) << '\n';
}
int main()
{
int op, x;
f >> n;
for(int i = 1; i <= n; ++i)
{
f >> op >> x;
if(op == 1) insert_list(x);
else if(op == 2) delete_list(x);
else search_list(x);
}
}