Pagini recente » Cod sursa (job #2802142) | Cod sursa (job #3192582) | Cod sursa (job #658821) | Cod sursa (job #988456) | Cod sursa (job #2399178)
#include <bits/stdc++.h>
using namespace std;
const int DIM = 600005;
pair<int, int> arr[DIM];
int main(void) {
freopen("congr.in", "r", stdin);
freopen("congr.out", "w", stdout);
int p; cin >> p;
random_device rd; mt19937 gen(rd());
uniform_int_distribution<> dis1(1, p), dis2(p + 1, 2 * p - 1);
long long sum = 0;
for (int i = 1; i <= 2 * p - 1; ++i) {
cin >> arr[i].first; arr[i].second = i;
if (i <= p) {
sum += arr[i].first; } }
/*while (sum % p) {
int p1 = dis1(gen), p2 = dis2(gen);
sum = sum - arr[p1].first + arr[p2].first;
swap(arr[p1], arr[p2]); }
for (int i = 1; i <= p; ++i) {
cout << arr[i].second << " "; } */
return 0; }