-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathCodeForces 701A - Cards.cpp
More file actions
36 lines (28 loc) · 962 Bytes
/
CodeForces 701A - Cards.cpp
File metadata and controls
36 lines (28 loc) · 962 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define inc(a) a.begin(), a.end()
#define dec(a) a.rbegin(), a.rend()
#define Unique(n) (n).erase(unique(inc(n)), (n).end())
#define what_is(x) cerr << #x << " is " << x << '\n';
#define to(i, a, n) for(int i=a; i<n; i++)
#define fr(i, a, n) for(int i=a; i>=n; i--)
#define read(arr, l, r) for(int i=l; i<r; cin >> arr[i++])
#define prnt(arr, l, r) for(int i=l; i<r; cout << arr[i++] << " \n"[i==r])
typedef long long ll;
typedef long double ld;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, sum = 0, a[101]; cin >> n;
to(i, 0, n) cin >> a[i], sum += a[i];
sum /= n/2;
to(i, 0, n) to(j, 0, n) if(a[j] && i!=j && a[i]+a[j] == sum){
cout << i+1 << ' ' << j+1 << '\n';
a[j] = a[i] = 0;
break;
}
return 0;
}