Pagini recente » Cod sursa (job #3265622) | Cod sursa (job #3188607) | Cod sursa (job #615669) | Cod sursa (job #1105687) | Cod sursa (job #239167)
Cod sursa(job #239167)
#include<fstream>
#include<vector>
#define prim 1000003
using namespace std;
vector<int>a[prim];
bool gasit(int x){
vector<int>::iterator it;
int i;
for(it=a[x%prim].begin(),i=0;it!=a[x%prim].end();++it,++i)
if(*it==x/prim)
return i;
return -1;
}
int main(){
int n, i,cod,x;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(i=0;i<n;i++)
{
f>>cod>>x;
if(cod==1){
a[x%prim].push_back(x/prim);
}
else if(cod==3) if(gasit(x)!=-1) g<<"1\n";else g<<"0\n";
else if(cod==2){
int c=gasit(x);
if(c!=-1){
a[x%prim][c]=a[x%prim][*(a[x%prim].end()-1)];
a[x%prim].pop_back();
}
}
}
f.close();
g.close();
return 0;
}