Pagini recente » Cod sursa (job #2204374) | Cod sursa (job #2593661) | Cod sursa (job #2545250) | Cod sursa (job #1376159) | Cod sursa (job #1499981)
#include <fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,op,x,v[10001][10001],r=9997;
void cas()
{
f>>n;
int i,j,k,l;
for(i=1;i<=n;i++)
{
f>>op>>x;
if(op==1)
{ v[x%r][0]++;
v[x%r][v[x%r][0]]=x;
}
if(op==2)
{ int ok=1;
for(j=1;j<=v[x%r][0]&&ok;j++) if(v[x%r][j]==x) ok=0;
v[x%r][j-1]=0;
for(k=j-1;k<v[x%r][0];k++) v[x%r][k]=v[x%r][k+1];
}
if(op==3)
{ int ok=1;
for(j=1;j<=v[x%r][0]&&ok;j++) if(v[x%r][j]==x) ok=0;
g<<!ok<<'\n';
}
/* for(j=1;j<=20;++j)
{
for( k=1;k<=2;++k) g<<v[j][k]<<" ";
g<<'\n';
}g<<'\n';*/
}
}
int main()
{
cas();
return 0;
}