Pagini recente » Cod sursa (job #382188) | Cod sursa (job #2604733) | Cod sursa (job #607429) | Cod sursa (job #1269686) | Cod sursa (job #947575)
Cod sursa(job #947575)
#include<fstream>
#include<vector>
using namespace std;
vector <int> a[1000000];
int v,x,i,n,m,j,y;
bool ok;
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f >> n;
for (i=1;i<=n;i++)
{
f >> v >> x;
y=(long long)x*50%n;
if (v==1)
{
ok=false;
for (j=0;j<a[y].size();j++)
if (x==a[y][j])
{
ok=true;
break;
}
if (!ok)
a[y].push_back(x);
}
else if (v==2)
{
m=a[y].size();
for (j=0;j<m;j++)
if (x==a[y][j])
{
a[y][j]=a[y][m-1];
a[y].pop_back();
}
}
else
{
ok=false;
for (j=0;j<a[y].size();j++)
if (x==a[y][j])
{
g << 1 << "\n";
ok=true;
break;
}
if (!ok)
g << 0 << "\n";
}
}
return 0;
}