Cod sursa(job #2562128)
| Utilizator | Data | 29 februarie 2020 12:24:55 | |
|---|---|---|---|
| Problema | Congr | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
#include <time.h>
using namespace std;
ifstream fin("congr.in");
ofstream fout ("congr.out");
const long long MAXN = 600001;
long long a[MAXN],n,p,sum;
int main() {
fin >> p;
n = 2*p-1;
for(long long i = 1; i <= n; ++i) {
fin >> 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];
swap(a[p1],a[p2]);
}*/
for ( int i = 1; i <= p; ++i)
fout << a[i] << " ";
}
