Cod sursa(job #2011035)
| Utilizator | Data | 14 august 2017 22:59:40 | |
|---|---|---|---|
| Problema | Congr | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define Nmax 300001
using namespace std;
int v[Nmax];
int sol[Nmax];
ifstream f("congr.in");
ofstream g("congr.out");
int main()
{
srand(time(NULL));
int n,x,y,i;
long long s=0;
f>>n;
for(i=1;i<2*n;i++)
{
f>>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++)
g<<sol[i]<<' ';
return 0;
}
