Pagini recente » Cod sursa (job #2327987) | Cod sursa (job #706839) | Cod sursa (job #1278070) | Cod sursa (job #3156206) | Cod sursa (job #1692011)
#include <iostream>
#include <vector>
#include <fstream>
#include <ctime>
#include <stdlib.h>
#include <algorithm>
using namespace std;
vector<int> v, sol;
int main()
{
freopen("congr.in", "rt", stdin);
freopen("congr.out", "wt", stdout);
int N, i1, i2;
long long sum = 0;
scanf("%d", &N);
srand(time(NULL));
v.assign(2 * N + 1, 0);
sol.assign(2 * N + 1, 0);
for(int i = 1; i < 2 * N; ++i) {
scanf("%d", &v[i]);
sol[i] = i;
if(i <= N)
sum += v[i];
}
while( sum % N ) {
i1 = ( rand() % N ) + 1;
i2 = ( rand() % (N - 1) ) + N + 1;
sum += v[ sol[i2] ] - v[ sol[i1] ];
swap(sol[i1], sol[i2]);
//swap(v[i1], v[i2]);
}
for(int i = 1; i <= N; ++i)
cout << sol[i] << ' ';
cout << '\n' ;
return 0;
}