समस्या
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
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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।