CodeForces Gym 100935E Pairs

Pairs

Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Description

standard input/output
Statements

In the secret book of ACM, it’s said: “Glory for those who write short ICPC problems. May they live long, and never get Wrong Answers” . Everyone likes problems with short statements. Right? Let’s have five positive numbers: X1,X2,X3,X4,X5. We can form 10 distinct pairs of these five numbers. Given the sum of each one of the pairs, you are asked to find out the original five numbers.

Input

The first line will be the number of test cases T. Each test case is described in one line which contains 10 numbers, these are the sum of the two numbers in each pair. Notice that the input has no particular order, for example: the first number doesn’t have to be equal to {X1+ X2}. All numbers are positive integers below 100,000,000.

Output

For each test case, print one line which contains the number of the test case, and the five numbers X1,X2,X3,X4,X5 in ascending order, see the samples and follow the output format. There always exists a unique solution.

Sample Input

Input

215 9 7 15 6 12 13 16 21 1412 18 13 10 17 20 21 15 16 14

Output

Case 1: 2 4 5 10 11Case 2: 4 6 8 9 12

先把给的数排一下序 在草稿本上写一下  很快就出来了 设结果从小到大为a b c d e第一个数肯定是a+b  最后一个数是d+e 然后c是sum/4-(a+b)-(d+e)

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define FIN     freopen("input.txt","r",stdin);
#define FOUT    freopen("output.txt","w",stdout);
#define INF     0x3f3f3f3f
#define lson    l,m,rt<<1
#define rson    m+1,r,rt<<1|1
typedef long long LL;int num[15];int main()
{//FINint T;scanf("%d",&T);for(int z=1;z<=T;z++){int sum=0;for(int i=1;i<=10;i++){scanf("%d",&num[i]);sum+=num[i];}sort(num+1,num+1+10);int a,b,c,d,e;c=(sum/4)-num[1]-num[10];a=num[2]-c;b=num[1]-a;e=num[9]-c;d=num[10]-e;printf("Case %d: %d %d %d %d %d\n",z,a,b,c,d,e);}
}

转载于:https://www.cnblogs.com/Hyouka/p/5754844.html

CodeForces Gym 100935E Pairs相关推荐

E - Pairs Gym - 100935E
E - Pairs Gym - 100935E 题意:已知五个数的相互相加的和,这十个数均不同,求这五个数的值. In the secret book of ACM, it's said: " ...
Codeforces Gym 101173 CERC 16 D BZOJ 4790 Dancing Disks
Codeforces Gym 101173 CERC 16 D & BZOJ 4790 Dancing Disks 强烈安利这道构造题目,非常有意思. 这里用到的思想是归并排序! 多路归并排序 ...
Codeforces Gym 101086 M ACPC Headquarters : AASTMT (Stairway to Heaven)
Codeforces Gym 101086 M ACPC Headquarters : AASTMT (Stairway to Heaven) 题目来源: Codeforces 题意: 给出一些比赛, ...
[Codeforces Gym 101651/100725B] Banal Tickets
Codeforces Gym 100725 题解: 先分两种情况, 积为000与积非0" role="presentation" style="position ...
Codeforces Gym 100463A Crossings 逆序数
Crossings Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100463 Description ...
Codeforces gym 2013-2014 Samara SAU ACM ICPC Quarterfinal Qualification Contest
题目地址:http://codeforces.com/gym/100247 2014.10.27版 26号训练的题,今天发现A题有更高效的解法,用到了前缀最大值和后缀最大值 A. The Power ...
Codeforces Gym 100114 H. Milestones 离线树状数组
H. Milestones Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100114 Descripti ...
Codeforces Gym 100513G G. FacePalm Accounting 暴力
G. FacePalm Accounting Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100513 ...
Codeforces Gym 100269 Dwarf Tower （最短路）
题目连接: http://codeforces.com/gym/100269/attachments Description Little Vasya is playing a new game na ...
Codeforces Gym 100676G Training Camp 状压dp
http://codeforces.com/gym/100676 题目大意是告诉你要修n门课,每门课有一个权值w[i], 在第k天修该课程讲获得k*w[i]的学习点数,给出了课程与先修课程的关系,要修 ...

CodeForces Gym 100935E Pairs

CodeForces Gym 100935E Pairs相关推荐

最新文章

热门文章