Pagini recente » Cod sursa (job #2600991) | Cod sursa (job #305026) | Cod sursa (job #1366868) | Cod sursa (job #2368159) | Cod sursa (job #2562187)
#include <fstream>
#include <stdlib.h>
using namespace std;
ifstream fin("congr.in");
ofstream fout ("congr.out");
const long long MAXN = 600001;
pair <long long,long long> a[MAXN];
long long n,p,sum;
int main() {
fin >> p;
n = 2*p-1;
for(long long i = 1; i <= n; ++i) {
fin >> a[i].first,a[i].second = i;
a[i].first %= p;
if(i <= p)
sum += a[i].first;
}
srand(unsigned(time(0)));
while( sum % p) {
int p1 = rand() % p + 1;
int p2 = rand() % p + p+1;
sum += -a[p1].first + a[p2].second;
swap(a[p1],a[p2]);
}
for ( int i = 1; i <= p; ++i,fout << " ")
fout << a[i].second << " ";
}