AtCoder Beginner Contest 208
翻译中…
Problem Statement
翻译中…
Is it possible to get a sum of $B$ when throwing a die with six faces $1,2,\ldots,6$ $A$ times?
翻译中…
Constraints
翻译中…
$1 \leq A \leq 100$$1 \leq B \leq 1000$$A$and$B$are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
A B翻译中…
Output
翻译中…
If it is possible to get a sum of $B$, print Yes; otherwise, print No.
翻译中…
样例
Input #1
2 11
Output #1
Yes
There are two ways to get a sum of $11$ when throwing a $6$-faced die twice:
- getting $6$ in the first throw and $5$ in the second throw;
- getting $5$ in the first throw and $6$ in the second throw.
Input #2
2 13
Output #2
No
There is no way to get a sum of $13$ when throwing a $6$-faced die twice.
Input #3
100 600
Output #3
Yes
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。