Three Dice

[SDCPC2023] Three Dice

题面翻译

【题目描述】

骰子，是一种各面带有标记，以生成随机数的小型可投掷道具，通常用于桌上游戏。

最常见的骰子是一种小正方体，每个面上被标记了从 $1$ 到 $6$ 的数字。数字 $n$（$1\le n\le 6$）通常由 $n$ 个小圆点组成的图案来表示，其中 $1$ 号与 $4$ 号面的小圆点是红色的，而 $2$, $3$, $5$ 与 $6$ 号面的小圆点是黑色的。

小青鱼手中有三只骰子。有一天，他将这三只骰子投掷在桌子上，并观察了朝上的那一个面。他发现所有朝上的面中，红色的点数之和恰好为 $A$，而黑色的点数之和恰好为 $B$。

然而，您对小青鱼的发现感到怀疑。您想要确认是否有可能投掷出三只骰子，使得所有朝上的面中，红色的点数之和恰好为 $A$，而黑色的点数之和恰好为 $B$。

【输入格式】

每个测试文件仅有一组测试数据。

第一行输入两个整数 $A$ 和 $B$（$0\le A,B\le 100$），表示朝上的红色点数之和与黑色点数之和。

【输出格式】

输出一行。如果小青鱼有可能投掷出三只骰子使得所有朝上的面中，红色的点数之和恰好为 $A$，而黑色的点数之和恰好为 $B$，则输出 Yes。否则输出 No。

【样例解释】

在第一组样例中，其中一种合法的方案为 $4,2,3$。

在第二组样例中，其中一种合法的方案为 $1,1,1$。

题目描述

Dice are small, throwable objects with marked sides capable of landing in multiple positions. They are typically used to generate random values, especially in the context of tabletop games.

The most common dice are small cubes, with faces numbered from $1$ to $6$. Number $n$ ($1\le n\le 6$) is usually represented by a pattern of $n$ round dots, known as pips. Moreover, the pips on the $1$ and $4$ faces are colored red, while those on the $2$, $3$, $5$ and $6$ faces are black.

Little Cyan Fish has three dice. One day, he threw them onto a table, and then observed the uppermost faces. He claimed that the total number of the red pips facing up was exactly $A$, and the total number of the black pips facing up was exactly $B$.

However, you find his claim doubtful. You want to verify whether it is possible to throw three dice such that the total number of red pips facing up is $A$, and the total number of black pips facing up is $B$.

输入格式

There is only one test case in each test file.

The first line of the input contains two integers $A$ and $B$ ($0\le A,B\le 100$), indicating the total number of red pips facing up and the number of black pips facing up.

输出格式

Output one line. If it is possible for Little Cyan Fish to throw three dice such that the total number of red pips facing up is $A$, and the total number of black pips facing up is $B$ output Yes. Otherwise output No.

样例 #1

样例输入 #1

4 5

样例输出 #1

Yes

样例 #2

样例输入 #2

3 0

样例输出 #2

Yes

样例 #3

样例输入 #3

1 2

样例输出 #3

No

提示说明

In the first example, one possible solution is $4,2,3$.

In the second example, one possible solution is $1,1,1$.

代码内容

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <stack>//栈
// #include <deque>//队列
// #include <queue>//堆/优先队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
ll col[7]={0,0,1,1,0,1,1};

int main()
{
    ll a,b;
    cin>>a>>b;
    
    for(ll i=1;i<=6;i++)
        for(ll j=1;j<=6;j++)
            for(ll k=1;k<=6;k++)
            {
                ll res[2]={0,0};
                res[col[i]]+=i;
                res[col[j]]+=j;
                res[col[k]]+=k;//三个骰子加对应颜色
                if(a==res[0]&&b==res[1])
                {
                    cout<<"Yes"<<endl;
                    return 0;
                }
            }

    cout<<"No"<<endl;
    return 0;
}