codeforces 1294A Collecting Coins

2020-01-23 21:38:06 阅读：898 来源： 互联网

标签：Collecting Coins Polycarp 1294A coins number Alice Cerene Barbara

A. Collecting Coins

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Polycarp has three sisters: Alice, Barbara, and Cerene. They’re collecting coins. Currently, Alice has a coins, Barbara has b coins and Cerene has c coins. Recently Polycarp has returned from the trip around the world and brought n coins.

He wants to distribute all these n coins between his sisters in such a way that the number of coins Alice has is equal to the number of coins Barbara has and is equal to the number of coins Cerene has. In other words, if Polycarp gives A coins to Alice, B coins to Barbara and C coins to Cerene (A+B+C=n), then a+A=b+B=c+C.

Note that A, B or C (the number of coins Polycarp gives to Alice, Barbara and Cerene correspondingly) can be 0.

Your task is to find out if it is possible to distribute all n coins between sisters in a way described above.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1≤t≤104) — the number of test cases.

The next t lines describe test cases. Each test case is given on a new line and consists of four space-separated integers a,b,c and n (1≤a,b,c,n≤108) — the number of coins Alice has, the number of coins Barbara has, the number of coins Cerene has and the number of coins Polycarp has.

Output

For each test case, print “YES” if Polycarp can distribute all n coins between his sisters and “NO” otherwise.

Example

input

5
5 3 2 8
100 101 102 105
3 2 1 100000000
10 20 15 14
101 101 101 3

output

YES
YES
NO
NO
YES

题意：

有三个人分别有A，B，C个硬币，又有一个人有个硬币，问最后能不能将n个硬币分配到A，B，C中，使最后三个人的硬币一样。

思路：

只要将A,B,C,n相加最后看看能不能被三整除，如果可以的话，看看A，B C会不会大于均值，因为不可能把ABC中的值拿出来分配。

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int main() {
    int n;
    scanf("%d", &n);
    while (n--) {
        int a, b, c, d;
        scanf("%d %d %d %d", &a, &b, &c, &d);
        int sum = a + b + c + d;
        if (sum % 3 == 0) {
            int ave = sum / 3;
            if (a <= ave && b <= ave && c <= ave) printf("YES\n");
            else printf("NO\n");
        } else printf("NO\n");
    }
    return 0;
}

忘梦心发布了367 篇原创文章 · 获赞 15 · 访问量 2万+ 私信关注

标签：Collecting,Coins,Polycarp,1294A,coins,number,Alice,Cerene,Barbara
来源： https://blog.csdn.net/weixin_45031646/article/details/104077795

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9