問題一覧 > 通常問題

No.1799 Summer Day

レベル : / AI推定難易度 : 143 / 実行時間制限 : 1ケース 2.000秒 / メモリ制限 : 512 MB / 標準ジャッジ問題
タグ : （AC するまで非表示） / 解いたユーザー数 239
作問者 : NatsubiSogan / テスター : penguinman 8UqsVg4r
お気に入りにしたユーザー ProblemId : 7060 / 自分の提出
問題文最終更新日: 2022-01-07 23:45:38
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence. Back to the original
yukicoder contest 326 (順位表) の他の問題:

Problem Statement

A sequence $A$ is called a "summer day sequence" if the maximum value of $A$ is at least $25$. Similarly, $A$ is called a "midsummer day sequence" if the maximum value of $A$ is at least $30$.

Natsubi likes summer days but hates midsummer days (because they are too hot).

Given positive integers $N,S$, determine whether there exists a non-negative integer sequence $B=(B_1,B_2,\dots,B_N)$ of length $N$ with sum $S$ that is a "summer day sequence" but not a "midsummer day sequence".

Input

$N$ $S$
  • All inputs are integers.
  • $1 \leq N,S \leq 10^9$

Output

Print Yes if a sequence satisfying the conditions in the problem statement exists, and No otherwise, on $1$ line.

Print a newline at the end.

Sample

Sample 1
Input
2 54
Output
Yes

For example, $(27, 27)$ satisfies the conditions.

Sample 2
Input
1 10
Output
No

The only sequence of length $1$ with sum $10$ is $(10)$, but it does not satisfy the conditions in the problem statement.

Sample 3
Input
10 1000000000
Output
No

提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。