Pagini recente » Cod sursa (job #227798) | Diferente pentru problema/produse intre reviziile 2 si 1 | Atasamentele paginii Poze preONI 2007 - pregatiri | Cod sursa (job #236892) | Cod sursa (job #2011042)
#include <bits/stdc++.h>
#define Nmax 300001
using namespace std;
vector <int> v,sol;
int main()
{
srand(time(NULL));
int n,x,y,i;
long long s=0;
freopen("congr.in","r",stdin);
freopen("congr.out","w",stdout);
scanf("%d",&n);
v.assign(2*n+1,0);
sol.assign(2*n+1,0);
for(i=1;i<2*n;i++)
{
scanf("%d",&v[i]);
sol[i]=i;
if(i<=n) s+=v[i];
}
while(s%n)
{
x=rand()%n+1;
y=rand()%(n-1)+n+1;
s+=v[sol[y]]-v[sol[x]];
swap(sol[x],sol[y]);
}
for(i=1;i<=n;i++)
printf("%d ",sol[i]);
return 0;
}