Challenge: Obfuscated Number to Roman Numerics Converter

by bitm0de - 04-01-2016, 06:20 AM
Junior Member
Posts:
57
Joined:
Jan 2016
Likes:
5
Credits:
32
Reputation:
-4
1 Year of Service
#1
OP
Posted: 04-01-2016, 06:20 AM (This post was last modified: 04-01-2016, 06:51 AM by bitm0de.)
The proposed challenge is to make the most sophisticated and relatively compact conversion tool for integers to roman numeric characters (in C/C++).

Examples:
4 == "IV"
19 == "XIX"
10 == "X"
Crimson
Prime
Posts:
124
Joined:
Dec 2015
Likes:
10
Credits:
245
Reputation:
17
1 Year of Service
#2
Posted: 04-01-2016, 06:33 AM
(04-01-2016, 06:20 AM)bitm0de Wrote: The proposed challenge is to make the most sophisticated and relatively compact conversion tool for integers to roman numeric characters (in C/C++).

Examples:
4 == "IV"
19 == "IX"
10 == "X"

uhh. 19 is XIX not IX. That is 9
“As for the end of the universe…I say let it come as it will, in ice, fire, or darkness. What did the universe ever do for me that I should mind its welfare?”  -Stephen King, The Dark Tower
Junior Member
Posts:
57
Joined:
Jan 2016
Likes:
5
Credits:
32
Reputation:
-4
1 Year of Service
#3
OP
Posted: 04-01-2016, 06:51 AM
(04-01-2016, 06:33 AM)KOOPAOU812 Wrote:
(04-01-2016, 06:20 AM)bitm0de Wrote: The proposed challenge is to make the most sophisticated and relatively compact conversion tool for integers to roman numeric characters (in C/C++).

Examples:
4 == "IV"
19 == "IX"
10 == "X"

uhh. 19 is XIX not IX. That is 9

Edited the post, small mistake.
Newbie
Posts:
16
Joined:
Mar 2017
Likes:
0
Credits:
2
Reputation:
0
#4
Posted: 04-03-2017, 08:41 AM
thats a nice challenge, not accepted.
Newbie
Posts:
17
Joined:
Jun 2017
Likes:
0
Credits:
9
Reputation:
0
#5
Posted: 21-06-2017, 03:02 PM
It is very hard. There are anyway must be a lot of "if". Yeh, there are a possibility to size code but no more than 15%.
The last reply on this thread is older than a month. Please do not unnecessarily bump it.
Register an account or login to reply
Create an account
Create a free account today and start posting right away. It only takes a few seconds.
Login
Log into an existing account.
1 Guest(s)