CF1593A.Elections

入门

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

The elections in which three candidates participated have recently ended. The first candidate received aa votes, the second one received bb votes, the third one received cc votes. For each candidate, solve the following problem: how many votes should be added to this candidate so that he wins the election (i.e. the number of votes for this candidate was strictly greater than the number of votes for any other candidate)?

Please note that for each candidate it is necessary to solve this problem independently, i.e. the added votes for any candidate do not affect the calculations when getting the answer for the other two candidates.

最近,有三位候选人参加的选举已经结束。第一位候选人获得了 aa 票,第二位候选人获得了 bb 票,第三位候选人获得了 cc 票。对每位候选人,请分别解决如下问题:需要为该候选人额外增加多少票,才能使其赢得选举(即该候选人的得票数严格大于其他任意一位候选人的得票数)?

请注意,对每位候选人,该问题需独立求解,即为某位候选人所增加的票数不会影响其余两位候选人对应问题的计算结果。

输入格式

The first line contains one integer tt (1≤t≤1041 \le t \le 10^4) — the number of test cases. Then tt test cases follow.

Each test case consists of one line containing three integers aa, bb, and cc (0≤a,b,c≤1090 \le a,b,c \le 10^9).

第一行包含一个整数 tt(1≤t≤1041 \le t \le 10^4)—— 测试用例的数量。接下来是 tt 个测试用例。

每个测试用例由一行组成,包含三个整数 aa、bb 和 cc(0≤a,b,c≤1090 \le a,b,c \le 10^9)。

输出格式

For each test case, output in a separate line three integers AA, BB, and CC (A,B,C≥0A, B, C \ge 0) separated by spaces — the answers to the problem for the first, second, and third candidate, respectively.

对于每个测试用例,在单独一行中输出三个整数 AA、BB 和 CC(A,B,C≥0A, B, C \ge 0),以空格分隔——分别表示问题对第一位、第二位和第三位候选人的答案。

输入输出样例

  • 输入#1

    5
    0 0 0
    10 75 15
    13 13 17
    1000 0 0
    0 1000000000 0

    输出#1

    1 1 1
    66 0 61
    5 5 0
    0 1001 1001
    1000000001 0 1000000001

输入解题思路,AI测评打分。不知道怎么写?

首页