Codeforces Round #364 (Div. 2) A. Cards
来源:互联网 发布:热云数据 编辑:程序博客网 时间:2024/03/29 06:29
There are n cards (n is even) in the deck. Each card has a positive integer written on it. n / 2 people will play new card game. At the beginning of the game each player gets two cards, each card is given to exactly one player.
Find the way to distribute cards such that the sum of values written of the cards will be equal for each player. It is guaranteed that it is always possible.
The first line of the input contains integer n (2 ≤ n ≤ 100) — the number of cards in the deck. It is guaranteed that n is even.
The second line contains the sequence of n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is equal to the number written on the i-th card.
Print n / 2 pairs of integers, the i-th pair denote the cards that should be given to the i-th player. Each card should be given to exactly one player. Cards are numbered in the order they appear in the input.
It is guaranteed that solution exists. If there are several correct answers, you are allowed to print any of them.
61 5 7 4 4 3
1 36 24 5
410 10 10 10
1 23 4
In the first sample, cards are distributed in such a way that each player has the sum of numbers written on his cards equal to 8.
In the second sample, all values ai are equal. Thus, any distribution is acceptable.
签到题
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<string>using namespace std;#define N 6000#define INF 1e9+5int n, sum, mid;int a[1000000];int main(){int i, j;scanf("%d", &n);sum = 0;for (i = 1; i <= n; i++){scanf("%d", &a[i]);sum += a[i];}mid = sum * 2 / n;for (i = 1; i <= n; i++){if (a[i] == 0) continue;for (j = i + 1; j <= n; j++){if (a[i] + a[j] == mid){printf("%d %d\n", i, j);a[i] = 0;a[j] = 0;}}}return 0;}
- Codeforces Round #364 (Div. 2) A. Cards
- Codeforces Round #364 (Div. 2) A. Cards
- Cards(Codeforces 701A)(Codeforces Round #364Div.2 A)
- Codeforces Round #364 (Div. 2) A - Cards(水)
- 【Codeforces Round 364 (Div 2)A】【水题】Cards
- codeforces Round #364(Div.2)701A Cards 贪心算法
- Codeforces Round #235 (Div. 2) A. Vanya and Cards
- Codeforces Round #356 (Div. 2) A - Bear and Five Cards
- Codeforces Round #233 (Div. 1) A. Cards
- Codeforces Round #364(Div. 2) A. Cards【模拟】 && B. Cells Not Under Attack【SET/规律】
- ★【16.6.9】Codeforces Round #356 (Div. 2) A. Bear and Five Cards
- Codeforces Round #356 (Div. 2)-A. Bear and Five Cards(模拟)
- Codeforces Round #385 (Div. 2) E. Hongcow Buys a Deck of Cards DP+好题
- Codeforces Round #364 (Div. 2)【A,C】
- Codeforces Round #364 (Div. 2)(A ~ D)
- Codeforces Round #364 (Div. 2) A
- Codeforces Round #304 (Div. 2) C Soldier and Cards
- Codeforces-Round-#356-(Div.-2)-Bear-and-Five-Cards
- C语言alarm()函数:设置信号传送闹钟
- win7 卸载 Ubuntu14 启动项。
- DCT变换编码及C语言实现
- 剑指offer 36题 【时间空间效率的平衡】数组中的逆序对
- vector::empty ,vector::end , vector::erase
- Codeforces Round #364 (Div. 2) A. Cards
- 安装Ubuntu 16.04后要做的事
- mogoose_mongodb_entity
- 有趣算法-a到z所有组合情况,期待斧正
- Spring之整合Apache CXF框架实现WebServices远程调用
- 卡特兰数(Catalan Number)
- JavaSE面试题【每天一整理】
- UVA - 202 Repeating Decimals
- Notepad++进行php开发所必需的插件【转】