Pagini recente » Cod sursa (job #349005) | Cod sursa (job #2338320) | Cod sursa (job #2449099) | Cod sursa (job #2512403) | Cod sursa (job #882254)
Cod sursa(job #882254)
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream in ("congr.in");
ofstream out ("congr.out");
int V[300010], Sol[300010];
int main()
{
int N, i, j, k;
long long S = 0;
in >> N;
for (i = 1; i < 2 * N; i ++){
in >> V[i];
Sol[i] = i;
if (i <= N)
S += V[i];
}
while (S % N){
j = 1 + rand () % N;
k = N + 1 + rand () % (N - 1);
S = S - V[j] + V[k];
Sol[j] = k;
Sol[k] = j;
}
for (i = 1; i <= N; i ++)
out << Sol[i] << " ";
return 0;
}