Pagini recente » Cod sursa (job #1077381) | Cod sursa (job #2517582) | Cod sursa (job #2940526) | Cod sursa (job #2645227) | Cod sursa (job #2745149)
#include <fstream>
#include <vector>
using namespace std;
const long long int mod=666013;
vector<int> has[mod];
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,op,nr;
fin>>n;
bool found;
for(int i=0;i<n;i++)
{
fin>>op>>nr;
if(op==1)
has[nr%mod].push_back(nr);
if(op==2)
for(int j=0;j<(int)has[nr%mod].size();j++)
if(has[nr%mod][j]==nr)
has[nr%mod].erase(has[nr%mod].begin()+j-1);
if(op==3)
{
found=false;
for(int j=0;j<(int)has[nr%mod].size();j++)
if(has[nr%mod][j]==nr)
found=true;
if(found)fout<<1<<'\n';
else fout<<0<<'\n';
}
}
fin.close();
fout.close();
return 0;
}