Decimal to roman python Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Roman Numeral to Decimal ConversionConverting Roman numerals to decimalRoman numeral converter in RubyRoman numerals to decimalRoman numeral to decimal converterCurrency converter in Python 2.7“Merchants Guide to Galaxy” challengeGreed Dice Scoring Game expanded - Python KoansArea and volume calculatorNumber of possible numbers in roman number string
Why not use the yoke to control yaw, as well as pitch and roll?
Marquee sign letters
Can a Wizard take the Magic Initiate feat and select spells from the Wizard list?
Why do C and C++ allow the expression (int) + 4*5?
Protagonist's race is hidden - should I reveal it?
Compiling and throwing simple dynamic exceptions at runtime for JVM
Is it OK if I do not take the receipt in Germany?
Why does my GNOME settings mention "Moto C Plus"?
Why did Bronn offer to be Tyrion Lannister's champion in trial by combat?
Raising a bilingual kid. When should we introduce the majority language?
How can I introduce the names of fantasy creatures to the reader?
What is the difference between 准时 and 按时?
Why these surprising proportionalities of integrals involving odd zeta values?
Is "ein Herz wie das meine" an antiquated or colloquial use of the possesive pronoun?
Why aren't road bike wheels tiny?
Recursive calls to a function - why is the address of the parameter passed to it lowering with each call?
How to leave only the following strings?
Help Recreating a Table
Is my guitar’s action too high?
What's the difference between using dependency injection with a container and using a service locator?
Putting Ant-Man on house arrest
Can this water damage be explained by lack of gutters and grading issues?
Unix AIX passing variable and arguments to expect and spawn
What could prevent concentrated local exploration?
Decimal to roman python
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Roman Numeral to Decimal ConversionConverting Roman numerals to decimalRoman numeral converter in RubyRoman numerals to decimalRoman numeral to decimal converterCurrency converter in Python 2.7“Merchants Guide to Galaxy” challengeGreed Dice Scoring Game expanded - Python KoansArea and volume calculatorNumber of possible numbers in roman number string
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
I'm a beginner as you can see and I would like to know how I can improve my code. Studying for 6 months now. Thank you.
roman_dict = 1: 'I', 4: 'IV', 5: 'V', 9: 'IX', 10: 'X', 40: 'XL', 50: 'L', 90: 'XC', 100: 'C', 400: 'CD',
500: 'D', 900: 'CM', 1000: 'M'
divide_list = [1000, 100, 10, 1]
def not_in_dict(fixed_decimal, divide_num):
sub_count = 0
sub_roman_multi = roman_dict[divide_num]
temp_decimal = fixed_decimal
while temp_decimal not in roman_dict:
temp_decimal -= divide_num
sub_count += 1
return roman_dict[temp_decimal]+(sub_count*sub_roman_multi)
def decimal_to_roman(decimal):
original_decimal = decimal
roman = ""
for divide_num in divide_list:
if decimal >= divide_num:
reminder = decimal//divide_num
if(reminder >= 1) and ((reminder*divide_num) in roman_dict):
roman += roman_dict[(reminder*divide_num)]
decimal -= reminder*divide_num
else:
roman += not_in_dict(reminder*divide_num, divide_num)
decimal -= (reminder*divide_num)
return str(original_decimal)+' = '+roman
python roman-numerals
$endgroup$
add a comment |
$begingroup$
I'm a beginner as you can see and I would like to know how I can improve my code. Studying for 6 months now. Thank you.
roman_dict = 1: 'I', 4: 'IV', 5: 'V', 9: 'IX', 10: 'X', 40: 'XL', 50: 'L', 90: 'XC', 100: 'C', 400: 'CD',
500: 'D', 900: 'CM', 1000: 'M'
divide_list = [1000, 100, 10, 1]
def not_in_dict(fixed_decimal, divide_num):
sub_count = 0
sub_roman_multi = roman_dict[divide_num]
temp_decimal = fixed_decimal
while temp_decimal not in roman_dict:
temp_decimal -= divide_num
sub_count += 1
return roman_dict[temp_decimal]+(sub_count*sub_roman_multi)
def decimal_to_roman(decimal):
original_decimal = decimal
roman = ""
for divide_num in divide_list:
if decimal >= divide_num:
reminder = decimal//divide_num
if(reminder >= 1) and ((reminder*divide_num) in roman_dict):
roman += roman_dict[(reminder*divide_num)]
decimal -= reminder*divide_num
else:
roman += not_in_dict(reminder*divide_num, divide_num)
decimal -= (reminder*divide_num)
return str(original_decimal)+' = '+roman
python roman-numerals
$endgroup$
add a comment |
$begingroup$
I'm a beginner as you can see and I would like to know how I can improve my code. Studying for 6 months now. Thank you.
roman_dict = 1: 'I', 4: 'IV', 5: 'V', 9: 'IX', 10: 'X', 40: 'XL', 50: 'L', 90: 'XC', 100: 'C', 400: 'CD',
500: 'D', 900: 'CM', 1000: 'M'
divide_list = [1000, 100, 10, 1]
def not_in_dict(fixed_decimal, divide_num):
sub_count = 0
sub_roman_multi = roman_dict[divide_num]
temp_decimal = fixed_decimal
while temp_decimal not in roman_dict:
temp_decimal -= divide_num
sub_count += 1
return roman_dict[temp_decimal]+(sub_count*sub_roman_multi)
def decimal_to_roman(decimal):
original_decimal = decimal
roman = ""
for divide_num in divide_list:
if decimal >= divide_num:
reminder = decimal//divide_num
if(reminder >= 1) and ((reminder*divide_num) in roman_dict):
roman += roman_dict[(reminder*divide_num)]
decimal -= reminder*divide_num
else:
roman += not_in_dict(reminder*divide_num, divide_num)
decimal -= (reminder*divide_num)
return str(original_decimal)+' = '+roman
python roman-numerals
$endgroup$
I'm a beginner as you can see and I would like to know how I can improve my code. Studying for 6 months now. Thank you.
roman_dict = 1: 'I', 4: 'IV', 5: 'V', 9: 'IX', 10: 'X', 40: 'XL', 50: 'L', 90: 'XC', 100: 'C', 400: 'CD',
500: 'D', 900: 'CM', 1000: 'M'
divide_list = [1000, 100, 10, 1]
def not_in_dict(fixed_decimal, divide_num):
sub_count = 0
sub_roman_multi = roman_dict[divide_num]
temp_decimal = fixed_decimal
while temp_decimal not in roman_dict:
temp_decimal -= divide_num
sub_count += 1
return roman_dict[temp_decimal]+(sub_count*sub_roman_multi)
def decimal_to_roman(decimal):
original_decimal = decimal
roman = ""
for divide_num in divide_list:
if decimal >= divide_num:
reminder = decimal//divide_num
if(reminder >= 1) and ((reminder*divide_num) in roman_dict):
roman += roman_dict[(reminder*divide_num)]
decimal -= reminder*divide_num
else:
roman += not_in_dict(reminder*divide_num, divide_num)
decimal -= (reminder*divide_num)
return str(original_decimal)+' = '+roman
python roman-numerals
python roman-numerals
edited Apr 4 at 11:53
Graipher
27.7k54499
27.7k54499
asked Apr 4 at 10:23
OfeksOfeks
333
333
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If you use a list of tuples instead of a dictionary and reverse the order, you can simply iterate over it. Your while
loop also becomes a lot easier to understand and there is no longer any need to outsource it to another function that returns the literal and its count.
Instead of manually adding strings (something you should basically never do in in Python), use str.join
.
ROMAN_LITERALS = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'),
(90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'),
(5, 'V'), (4, 'IV'), (1, 'I')]
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
while x >= value:
x -= value
out.append(literal)
return "".join(out)
Instead of the while
loop you can also use integer division like you did:
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
n = x // value # will be 0 if value is too large
out.extend([literal] * n) # will not do anything if n == 0
x -= n * value # will also not do anything if n == 0
return "".join(out)
$endgroup$
$begingroup$
wow. looks so easy now, thank you. that's great.
$endgroup$
– Ofeks
Apr 4 at 13:36
1
$begingroup$
@Ofeks: If this helped you, consider accepting it as the correct answer (by clicking the checkmark to the left of the answer). It is customary to wait about 24 hours, though, to give everyon on the globe a chance to answer and not discourage other people from commenting.
$endgroup$
– Graipher
Apr 4 at 14:01
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216852%2fdecimal-to-roman-python%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If you use a list of tuples instead of a dictionary and reverse the order, you can simply iterate over it. Your while
loop also becomes a lot easier to understand and there is no longer any need to outsource it to another function that returns the literal and its count.
Instead of manually adding strings (something you should basically never do in in Python), use str.join
.
ROMAN_LITERALS = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'),
(90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'),
(5, 'V'), (4, 'IV'), (1, 'I')]
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
while x >= value:
x -= value
out.append(literal)
return "".join(out)
Instead of the while
loop you can also use integer division like you did:
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
n = x // value # will be 0 if value is too large
out.extend([literal] * n) # will not do anything if n == 0
x -= n * value # will also not do anything if n == 0
return "".join(out)
$endgroup$
$begingroup$
wow. looks so easy now, thank you. that's great.
$endgroup$
– Ofeks
Apr 4 at 13:36
1
$begingroup$
@Ofeks: If this helped you, consider accepting it as the correct answer (by clicking the checkmark to the left of the answer). It is customary to wait about 24 hours, though, to give everyon on the globe a chance to answer and not discourage other people from commenting.
$endgroup$
– Graipher
Apr 4 at 14:01
add a comment |
$begingroup$
If you use a list of tuples instead of a dictionary and reverse the order, you can simply iterate over it. Your while
loop also becomes a lot easier to understand and there is no longer any need to outsource it to another function that returns the literal and its count.
Instead of manually adding strings (something you should basically never do in in Python), use str.join
.
ROMAN_LITERALS = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'),
(90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'),
(5, 'V'), (4, 'IV'), (1, 'I')]
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
while x >= value:
x -= value
out.append(literal)
return "".join(out)
Instead of the while
loop you can also use integer division like you did:
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
n = x // value # will be 0 if value is too large
out.extend([literal] * n) # will not do anything if n == 0
x -= n * value # will also not do anything if n == 0
return "".join(out)
$endgroup$
$begingroup$
wow. looks so easy now, thank you. that's great.
$endgroup$
– Ofeks
Apr 4 at 13:36
1
$begingroup$
@Ofeks: If this helped you, consider accepting it as the correct answer (by clicking the checkmark to the left of the answer). It is customary to wait about 24 hours, though, to give everyon on the globe a chance to answer and not discourage other people from commenting.
$endgroup$
– Graipher
Apr 4 at 14:01
add a comment |
$begingroup$
If you use a list of tuples instead of a dictionary and reverse the order, you can simply iterate over it. Your while
loop also becomes a lot easier to understand and there is no longer any need to outsource it to another function that returns the literal and its count.
Instead of manually adding strings (something you should basically never do in in Python), use str.join
.
ROMAN_LITERALS = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'),
(90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'),
(5, 'V'), (4, 'IV'), (1, 'I')]
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
while x >= value:
x -= value
out.append(literal)
return "".join(out)
Instead of the while
loop you can also use integer division like you did:
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
n = x // value # will be 0 if value is too large
out.extend([literal] * n) # will not do anything if n == 0
x -= n * value # will also not do anything if n == 0
return "".join(out)
$endgroup$
If you use a list of tuples instead of a dictionary and reverse the order, you can simply iterate over it. Your while
loop also becomes a lot easier to understand and there is no longer any need to outsource it to another function that returns the literal and its count.
Instead of manually adding strings (something you should basically never do in in Python), use str.join
.
ROMAN_LITERALS = [(1000, 'M'), (900, 'CM'), (500, 'D'), (400, 'CD'), (100, 'C'),
(90, 'XC'), (50, 'L'), (40, 'XL'), (10, 'X'), (9, 'IX'),
(5, 'V'), (4, 'IV'), (1, 'I')]
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
while x >= value:
x -= value
out.append(literal)
return "".join(out)
Instead of the while
loop you can also use integer division like you did:
def decimal_to_roman(x):
out = []
for value, literal in ROMAN_LITERALS:
n = x // value # will be 0 if value is too large
out.extend([literal] * n) # will not do anything if n == 0
x -= n * value # will also not do anything if n == 0
return "".join(out)
edited Apr 4 at 14:44
answered Apr 4 at 12:01
GraipherGraipher
27.7k54499
27.7k54499
$begingroup$
wow. looks so easy now, thank you. that's great.
$endgroup$
– Ofeks
Apr 4 at 13:36
1
$begingroup$
@Ofeks: If this helped you, consider accepting it as the correct answer (by clicking the checkmark to the left of the answer). It is customary to wait about 24 hours, though, to give everyon on the globe a chance to answer and not discourage other people from commenting.
$endgroup$
– Graipher
Apr 4 at 14:01
add a comment |
$begingroup$
wow. looks so easy now, thank you. that's great.
$endgroup$
– Ofeks
Apr 4 at 13:36
1
$begingroup$
@Ofeks: If this helped you, consider accepting it as the correct answer (by clicking the checkmark to the left of the answer). It is customary to wait about 24 hours, though, to give everyon on the globe a chance to answer and not discourage other people from commenting.
$endgroup$
– Graipher
Apr 4 at 14:01
$begingroup$
wow. looks so easy now, thank you. that's great.
$endgroup$
– Ofeks
Apr 4 at 13:36
$begingroup$
wow. looks so easy now, thank you. that's great.
$endgroup$
– Ofeks
Apr 4 at 13:36
1
1
$begingroup$
@Ofeks: If this helped you, consider accepting it as the correct answer (by clicking the checkmark to the left of the answer). It is customary to wait about 24 hours, though, to give everyon on the globe a chance to answer and not discourage other people from commenting.
$endgroup$
– Graipher
Apr 4 at 14:01
$begingroup$
@Ofeks: If this helped you, consider accepting it as the correct answer (by clicking the checkmark to the left of the answer). It is customary to wait about 24 hours, though, to give everyon on the globe a chance to answer and not discourage other people from commenting.
$endgroup$
– Graipher
Apr 4 at 14:01
add a comment |
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216852%2fdecimal-to-roman-python%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown