Pagini recente » Cod sursa (job #3275068) | Cod sursa (job #2085090) | Cod sursa (job #1012034) | Cod sursa (job #1604084) | Cod sursa (job #2562162)
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
const long long MAXN = 600001;
long long a[MAXN],n,p,sum,i;
int main() {
FILE *fin,*fout;
fin = fopen("congr.in","r");
fout = fopen("congr.out","w");
fscanf(fin,"%lld",&p);
n = 2*p-1;
for(i = 1; i <= n; ++i) {
fscanf(fin,"%lld",&a[i]);
if(i <= p)
sum += a[i];
}
srand(unsigned(time(0)));
while( sum % p) {
int p1 = rand() % p + 1;
int p2 = rand() % p + p+1;
sum += -a[p1] + a[p2];
long long aux = a[p1];
a[p1] = a[p2];
a[p2] = aux;
}
for ( i = 1; i <= p; ++i)
fprintf(fout, "%lld ", a[i]);
return 0;
}