Problème
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.
Contraintes
1 ≤ n ≤ 3999
Exemples
Entrée :
n = 1994
Sortie attendue :
expected = "MCMXCIV"
Entrée :
long long n = 1994;
Sortie attendue :
std::string expected = "MCMXCIV";
Entrée :
long n = 1994;
Sortie attendue :
string expected = "MCMXCIV";
Explication
1000 + 900 + 90 + 4 gives M, CM, XC, IV: "MCMXCIV".
Entrée :
n = 58
Sortie attendue :
expected = "LVIII"
Entrée :
long long n = 58;
Sortie attendue :
std::string expected = "LVIII";
Entrée :
long n = 58;
Sortie attendue :
string expected = "LVIII";
Explication
50 + 5 + 3 gives L, V, III: "LVIII".
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
List the symbols and the six subtractive pairs together, sorted by value.
Indice 2
Repeatedly take the largest value that still fits into what remains.
Indice 3
Try 4, 9 and 3999 by hand to check your table.
Complexité attendue
O(1) time, O(1) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.