問題一覧 > ⚠未証明/不備あり問題

No.1257 An Unusual Average

レベル : / 実行時間制限 : 1ケース 2.000秒 / メモリ制限 : 512 MB / 標準ジャッジ問題
タグ : (AC するまで非表示) / 解いたユーザー数 111
作問者 : PCTprobability / テスター : tko919
お気に入りにしたユーザー ProblemId : 5146 / 自分の提出
問題文最終更新日: 2020-10-17 17:18:43
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 270 (mathematics contest) (順位表) の他の問題:

We apologize!!!

We apologize!!! This problem turned out to be flawed!!! Since we believe it is quite difficult to solve, we are leaving the original text as is, as a flawed problem.

Problem Statement

You are given positive integers $A,B,C,D,E,F$.

PCT-kun has $3$ positive integers $A,B,C$. PCT-kun repeatedly chooses and performs one of the following operations until $A,B,C$ match $D,E,F$ in this order.

  • Operation $1$: Choose $2$ real numbers $X,Y$ out of the $3$ numbers $A,B,C$, and assign $X'=\frac{X+Y}{\sqrt2},Y'=\frac{X-Y}{\sqrt2}$ to the $2$ chosen real numbers, respectively.
  • Operation $2$: Freely rearrange the order of the $3$ real numbers. (22:03 Corrected "integers" to "real numbers".)
Determine whether PCT-kun can, by repeating the operations, make the positive integers $A,B,C$ match $D,E,F$ in this order. Note that at least $1$ operation must be performed, and subject to that, output the one with the minimum number of operations. (Added at 21:49.)

Input

$A\ B\ C$
$D\ E\ F$

  • All inputs are positive integers.
  • $1 \le A,B,C,D,E,F \le 100000$

Output

If PCT-kun can turn $A,B,C$ into $D,E,F$, output Yes, then, after a newline, output a sequence of operations that minimizes the number of operations. Specifically, if you choose Operation $1$, output 1 followed by, separated by a space, the variable name of the number that was not chosen; if you choose Operation $2$, output only 2. Output a newline after each operation. It can be proved that, under the constraints, the sequence of operations minimizing the number of operations is uniquely determined. If PCT-kun cannot turn $A,B,C$ into $D,E,F$, output No.

21:57 Corrected "number" to "variable name of the number".

Sample

Sample 1
Input
1 1 1
800 800 800
Output
No

It is impossible to obtain $(800,800,800)$ from $(1,1,1)$.

Sample

Sample 2
Input
1000 1000 1000
800 800 900
Output
No

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