Input: A binary number. Output: Convert input to Roman numerals if it is less than 4000. Otherwise return error. Constraint: 1 <= Input number <= 10000 You may not use keywords in this level. <日本語訳> k-12 ローマ数字 2 入力: 2進数 出力: 入力値が4000より小さければローマ数字に変換する。そうでなけれ
125 Steam results · Checked
Input: Two strings of "a", "b", "c" and "x", separated by a ",". Output: The string that comes before the other in the lexicographic order. Constraint: 1 <= String length <= 4 First string ≠ Second string Out of the 115260 possible test cases, only 10000 a
Input: Two binary numbers, separated by "/". Output: The result of division. If the result is not an integer, use "." to separate the integer and fractional parts. If the fractional part is repeating, enclose the repeating part in "". Constraint: 1 <= Inpu
Input: Two binary numbers, separated by "^". Output: The result of exponentiation. Constraint: 1 <= First number <= 31 1 <= Second number <= 15
Input: Two binary numbers, separated by a comparison symbol (<, >, =). Output: true if the comparison is valid, false otherwise. Constraint: 0 <= Input number <= 31
Input: A decimal number. Output: Convert input to Roman numerals if it is less than 4000. Otherwise return error. Constraint: 1 <= Input number <= 10000 You may not use keywords in this level. <日本語訳> k-11 ローマ数字 1 入力: 10進数 出力: 入力値が4000より小さければローマ数字に変換する。そうでな
Input: Two binary numbers, separated by a comparison symbol (<, >, =). Output: true if the comparison is valid, false otherwise. Constraint: -31 <= Input number <= 31
Input: Two strings of "a", "b" and "c", separated by a ",". Output: The result of this game given the "first string" as input and "second string =" as the instruction. Constraint: 1 <= First string length <= 8 1 <= Second string length <= 4 Out of the 1180
Input: A binary number. Output: Its prime factors in ascending order, separated by "*"s. Constraint: 2 <= Input number <= 256 <日本語訳> k-8 素因数分解 入力: 2進数 出力: 入力値の素因数を昇順に並べ、それを"*"で区切ったもの。 制約: 2 <= 入力値 <= 256 鷹
Input: Two binary numbers, separated by a ",". Output: The LCM of them. Constraint: 1 <= Input number <= 31 <日本語訳> k-7 最小公倍数 入力: ","で区切られた、2つの2進数 出力: 2つの入力値の最小公倍数。 制約: 1 <= 入力値 <= 31 鼠
Input: Two binary numbers, separated by a ",". Output: The GCD of them. Constraint: 1 <= Input number <= 31 <日本語訳> k-6 最大公約数 入力: ","で区切られた、2つの2進数 出力: 2つの入力値の最大公約数。 制約: 1 <= 入力値 <= 31 隼
Input: A binary number. Output: The Fibonacci number at the given position. Constraint: 1 <= Input number <= 75 <日本語訳> k-5 フィボナッチ数列 入力: 2進数 出力: フィボナッチ数列の入力値番目の項。 制約: 1 <= 入力値 <= 75 鮭