Cod sursa(job #1999949)
Utilizator | Draghici Razvan razvandraghici | Data | 12 iulie 2017 13:51:39 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.3 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout("hashuri.out");
int n, a, b, i, c[1000003], u, j, k, dim;
vector<int> H[1000003];
int hashuire(int x){
return x%u;
}
int main()
{
fin>>n;
for(i=2;i<=n+10;i++){
if(c[i]==0){
for(j=i+i;j<=n+10;j+=i)
c[j]=1;
u=i;
}
}
for(i=1;i<=n;i++){
fin>>a>>b;
if(a==1){
H[hashuire(b)].push_back(b);
}
else
if(a==2){
dim=H[hashuire(b)].size();
for(j=0;j<=dim && dim!=0;j++)
if(H[hashuire(b)][j]==b)
break;
for(k=j;k<=dim-1;k++)
H[hashuire(b)][k]=H[hashuire(b)][k+1];
dim--;
}
else
if(a==3){
dim=H[hashuire(b)].size();
for(j=0;j<=dim && dim!=0;j++)
if(H[hashuire(b)][j]==b){
fout<<1<<'\n';
break;
}
if(j==dim+1 || (j==dim && dim==0))
fout<<0<<'\n';
}
}
return 0;
}