No.2128 Round up!!
レベル :
/ AI推定難易度 : 2450
/ 実行時間制限 : 1ケース 2.000秒 / メモリ制限
: 512 MB / 標準ジャッジ問題
タグ : / 解いたユーザー数 46
作問者 : 👑
qand
/ テスター :
👑
AngrySadEight
👑
potato167
タグ : / 解いたユーザー数 46
作問者 : 👑
問題文最終更新日: 2022-11-16 12:24:35
English (AI translation)
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 368
(順位表)
の他の問題:
Problem Statement
You are given positive integers $X,A,B$.
There is a variable $x$, which initially satisfies $x=X$.
You can perform the following $2$ operations in any order, any number of times, $0$ or more:
You are given $T$ test cases; find the answer for each of them.
Constraints
Input
$T$
$\text{case}_1$
$\text{case}_2$
$\vdots$
$\text{case}_T$
Each test case is given in the following format:
$X$ $A$ $B$
Output
Print $T$ lines.
On the $i$-th line $(1\le i\le T)$, print the answer for $\text{case}_i$.
Sample
Sample 1
Input
3 1 2 3 4 1 5 90441586 5486714 5123786
Output
5 2 5123755
We call operation number $1$ operation $A$, and operation number $2$ operation $B$.
In test case number $1$, the $5$ integers $1,2,3,4,6$ can be obtained. The following are examples of operations that produce these integers:
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。