問題
Roman numerals use I = 1, V = 5, X = 10, L = 50, C = 100, D = 500 and M = 1000. Symbols are written from largest to smallest and added up, except for six subtractive pairs: IV = 4, IX = 9, XL = 40, XC = 90, CD = 400 and CM = 900. Convert n to its standard form, which always uses a subtractive pair instead of four repeated symbols (4 is IV, never IIII).
Implement integer_to_roman(n).
Input
n: The number to convert.
Output
Return the Roman numeral as a string of uppercase letters.
制約
1 ≤ n ≤ 3999
例
入力:
n = 1994
期待される出力:
expected = "MCMXCIV"
入力:
long long n = 1994;
期待される出力:
std::string expected = "MCMXCIV";
入力:
long n = 1994;
期待される出力:
string expected = "MCMXCIV";
解説
1000 + 900 + 90 + 4 gives M, CM, XC, IV: "MCMXCIV".
入力:
n = 58
期待される出力:
expected = "LVIII"
入力:
long long n = 58;
期待される出力:
std::string expected = "LVIII";
入力:
long n = 58;
期待される出力:
string expected = "LVIII";
解説
50 + 5 + 3 gives L, V, III: "LVIII".
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
List the symbols and the six subtractive pairs together, sorted by value.
ヒント 2
Repeatedly take the largest value that still fits into what remains.
ヒント 3
Try 4, 9 and 3999 by hand to check your table.
目安の計算量
O(1) time, O(1) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。