<< problem 88 - Product-sum numbers | Cube digit pairs - problem 90 >> |
Problem 89: Roman numerals
(see projecteuler.net/problem=89)
For a number written in Roman numerals to be considered valid there are basic rules which must be followed.
Even though the rules allow some numbers to be expressed in more than one way there is always a "best" way of writing a particular number.
For example, it would appear that there are at least six ways of writing the number sixteen:
IIIIIIIIIIIIIIII
VIIIIIIIIIII
VVIIIIII
XIIIIII
VVVI
XVI
However, according to the rules only XIIIIII
and XVI
are valid, and the last example is considered to be the most efficient, as it uses the least number of numerals.
The 11K text file, roman.txt (right click and 'Save Link/Target As...'), contains one thousand numbers written in valid, but not necessarily minimal, Roman numerals;
see About... Roman Numerals for the definitive rules for this problem.
Find the number of characters saved by writing each of these in their minimal form.
Note: You can assume that all the Roman numerals in the file contain no more than four consecutive identical units.
My Algorithm
There are two functions:
roman2number
takes a valid Roman number and converts it to an integernumber2roman
converts an integer to a minimal ("optimal") Roman number
The difference of the strings' lengths is what I'm looking for.
roman2number
reads the Roman numbers backwards:- if the current letter is smaller than the previous (its right neighbor) then the current letter must be subtracted else added
- my code can subtract multiple identical letters, too, e.g. 8 =
IIX
which is shorter thanVIII
number2roman
has a list of conversion rules to convert an integer to a Roman number.Each rule is identified by a number and that rule is applied as long as the integer is larger or equal.
Whenever
rules[i]
applies, one or two letters action[i]
are added to the result
:i
rules[i]
action[i]
01000
M
1900
CM
2500
D
3400
CD
4100
C
590
XC
650
L
740
XL
810
X
99
IX
105
V
114
IV
121
I
Modifications by HackerRank
I have to print the optimized Roman numbers instead of finding the sum of the length differences.
Note
The problem can be solved by simple search'n'replace, too.
However, I liked the challenge to write a basic parser for Roman numbers.
Interactive test
You can submit your own input to my program and it will be instantly processed at my server:
This live test is based on the Hackerrank problem.
This is equivalent toecho "1 " | ./89
Output:
Note: the original problem's input 50000000
cannot be entered
because just copying results is a soft skill reserved for idiots.
(this interactive test is still under development, computations will be aborted after one second)
My code
… was written in C++11 and can be compiled with G++, Clang++, Visual C++. You can download it, as well as the input data, too. Or just jump to my GitHub repository.
The code contains #ifdef
s to switch between the original problem and the Hackerrank version.
Enable #ifdef ORIGINAL
to produce the result for the original problem (default setting for most problems).
#include <iostream>
#include <string>
// convert valid roman numbers to binary numbers
unsigned int roman2number(const std::string& roman)
{
unsigned int result = 0;
// remember the value of the previous Roman letter
unsigned int last = 0;
// true, if the current letter is subtracted (and the next identical letters)
bool subtract = false;
// walk through the whole string from the end to the beginning ...
for (auto i = roman.rbegin(); i != roman.rend(); i++)
{
unsigned int current = 0;
switch (*i)
{
case 'M': current = 1000; break;
case 'D': current = 500; break;
case 'C': current = 100; break;
case 'L': current = 50; break;
case 'X': current = 10; break;
case 'V': current = 5; break;
case 'I': current = 1; break;
}
// smaller than its right neighbor ? => we must subtract
if (current < last)
{
subtract = true;
last = current;
}
// bigger than its right neighbor ? => we must add
else if (current > last)
{
subtract = false;
last = current;
}
// note: if current == last then we keep the variables "subtract" and "last" in their current state
// add/subtract accordingly
if (subtract)
result -= current;
else
result += current;
}
return result;
}
std::string number2roman(unsigned int number)
{
// apply these rules in the presented order:
// - as long as number >= steps[i] add roman[i] to result
const unsigned int NumRules = 13;
const unsigned int rules[NumRules] =
{ 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };
const char* action[NumRules] =
{ "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" };
// apply all rules ...
std::string result;
for (unsigned int i = 0; i < NumRules; i++)
// ... as often as needed
while (number >= rules[i])
{
// reduce integer
number -= rules[i];
// add letter(s)
result += action[i];
}
return result;
}
int main()
{
// letters saved by optimization
unsigned int saved = 0;
unsigned int tests = 1000;
//#define ORIGINAL
#ifndef ORIGINAL
std::cin >> tests;
#endif
while (tests--)
{
// read Roman number
std::string roman;
std::cin >> roman;
// convert it to an integer and back to an optimal Roman number
auto number = roman2number(roman);
auto optimized = number2roman(number);
// count how many character were saved
saved += roman.size() - optimized.size();
#ifndef ORIGINAL
// print Roman number
std::cout << optimized << std::endl;
#endif
}
#ifdef ORIGINAL
std::cout << saved << std::endl;
#endif
return 0;
}
This solution contains 17 empty lines, 20 comments and 8 preprocessor commands.
Benchmark
The correct solution to the original Project Euler problem was found in less than 0.01 seconds on an Intel® Core™ i7-2600K CPU @ 3.40GHz.
(compiled for x86_64 / Linux, GCC flags: -O3 -march=native -fno-exceptions -fno-rtti -std=gnu++11 -DORIGINAL
)
See here for a comparison of all solutions.
Note: interactive tests run on a weaker (=slower) computer. Some interactive tests are compiled without -DORIGINAL
.
Changelog
March 15, 2017 submitted solution
May 6, 2017 added comments
Hackerrank
see https://www.hackerrank.com/contests/projecteuler/challenges/euler089
My code solves 4 out of 4 test cases (score: 100%)
Difficulty
Project Euler ranks this problem at 20% (out of 100%).
Hackerrank describes this problem as easy.
Note:
Hackerrank has strict execution time limits (typically 2 seconds for C++ code) and often a much wider input range than the original problem.
In my opinion, Hackerrank's modified problems are usually a lot harder to solve. As a rule thumb: brute-force is rarely an option.
Similar problems at Project Euler
Problem 610: Roman Numerals II
Note: I'm not even close to solving all problems at Project Euler. Chances are that similar problems do exist and I just haven't looked at them.
Links
projecteuler.net/thread=89 - the best forum on the subject (note: you have to submit the correct solution first)
Code in various languages:
C# www.mathblog.dk/project-euler-89-develop-a-method-to-express-roman-numerals-in-minimal-form/ (written by Kristian Edlund)
C# github.com/HaochenLiu/My-Project-Euler/blob/master/089.cs (written by Haochen Liu)
Python github.com/hughdbrown/Project-Euler/blob/master/euler-089.py (written by Hugh Brown)
Python github.com/nayuki/Project-Euler-solutions/blob/master/python/p089.py (written by Nayuki)
Python github.com/smacke/project-euler/blob/master/python/89.py (written by Stephen Macke)
C++ github.com/Meng-Gen/ProjectEuler/blob/master/89.cc (written by Meng-Gen Tsai)
C++ github.com/roosephu/project-euler/blob/master/89.cpp (written by Yuping Luo)
C++ github.com/zmwangx/Project-Euler/blob/master/089/089.cpp (written by Zhiming Wang)
Java github.com/dcrousso/ProjectEuler/blob/master/PE089.java (written by Devin Rousso)
Java github.com/nayuki/Project-Euler-solutions/blob/master/java/p089.java (written by Nayuki)
Go github.com/frrad/project-euler/blob/master/golang/Problem089.go (written by Frederick Robinson)
Mathematica github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p089.mathematica (written by Nayuki)
Mathematica github.com/steve98654/ProjectEuler/blob/master/089.nb
Haskell github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p089.hs (written by Nayuki)
Clojure github.com/rm-hull/project-euler/blob/master/src/euler089.clj (written by Richard Hull)
Scala github.com/samskivert/euler-scala/blob/master/Euler089.scala (written by Michael Bayne)
Perl github.com/gustafe/projecteuler/blob/master/089-Roman-numerals.pl (written by Gustaf Erikson)
Rust github.com/gifnksm/ProjectEulerRust/blob/master/src/bin/p089.rs
Those links are just an unordered selection of source code I found with a semi-automatic search script on Google/Bing/GitHub/whatever.
You will probably stumble upon better solutions when searching on your own.
Maybe not all linked resources produce the correct result and/or exceed time/memory limits.
Heatmap
Please click on a problem's number to open my solution to that problem:
green | solutions solve the original Project Euler problem and have a perfect score of 100% at Hackerrank, too | |
yellow | solutions score less than 100% at Hackerrank (but still solve the original problem easily) | |
gray | problems are already solved but I haven't published my solution yet | |
blue | solutions are relevant for Project Euler only: there wasn't a Hackerrank version of it (at the time I solved it) or it differed too much | |
orange | problems are solved but exceed the time limit of one minute or the memory limit of 256 MByte | |
red | problems are not solved yet but I wrote a simulation to approximate the result or verified at least the given example - usually I sketched a few ideas, too | |
black | problems are solved but access to the solution is blocked for a few days until the next problem is published | |
[new] | the flashing problem is the one I solved most recently |
I stopped working on Project Euler problems around the time they released 617.
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 |
51 | 52 | 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 |
76 | 77 | 78 | 79 | 80 | 81 | 82 | 83 | 84 | 85 | 86 | 87 | 88 | 89 | 90 | 91 | 92 | 93 | 94 | 95 | 96 | 97 | 98 | 99 | 100 |
101 | 102 | 103 | 104 | 105 | 106 | 107 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 | 117 | 118 | 119 | 120 | 121 | 122 | 123 | 124 | 125 |
126 | 127 | 128 | 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 138 | 139 | 140 | 141 | 142 | 143 | 144 | 145 | 146 | 147 | 148 | 149 | 150 |
151 | 152 | 153 | 154 | 155 | 156 | 157 | 158 | 159 | 160 | 161 | 162 | 163 | 164 | 165 | 166 | 167 | 168 | 169 | 170 | 171 | 172 | 173 | 174 | 175 |
176 | 177 | 178 | 179 | 180 | 181 | 182 | 183 | 184 | 185 | 186 | 187 | 188 | 189 | 190 | 191 | 192 | 193 | 194 | 195 | 196 | 197 | 198 | 199 | 200 |
201 | 202 | 203 | 204 | 205 | 206 | 207 | 208 | 209 | 210 | 211 | 212 | 213 | 214 | 215 | 216 | 217 | 218 | 219 | 220 | 221 | 222 | 223 | 224 | 225 |
226 | 227 | 228 | 229 | 230 | 231 | 232 | 233 | 234 | 235 | 236 | 237 | 238 | 239 | 240 | 241 | 242 | 243 | 244 | 245 | 246 | 247 | 248 | 249 | 250 |
251 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 259 | 260 | 261 | 262 | 263 | 264 | 265 | 266 | 267 | 268 | 269 | 270 | 271 | 272 | 273 | 274 | 275 |
276 | 277 | 278 | 279 | 280 | 281 | 282 | 283 | 284 | 285 | 286 | 287 | 288 | 289 | 290 | 291 | 292 | 293 | 294 | 295 | 296 | 297 | 298 | 299 | 300 |
301 | 302 | 303 | 304 | 305 | 306 | 307 | 308 | 309 | 310 | 311 | 312 | 313 | 314 | 315 | 316 | 317 | 318 | 319 | 320 | 321 | 322 | 323 | 324 | 325 |
326 | 327 | 328 | 329 | 330 | 331 | 332 | 333 | 334 | 335 | 336 | 337 | 338 | 339 | 340 | 341 | 342 | 343 | 344 | 345 | 346 | 347 | 348 | 349 | 350 |
351 | 352 | 353 | 354 | 355 | 356 | 357 | 358 | 359 | 360 | 361 | 362 | 363 | 364 | 365 | 366 | 367 | 368 | 369 | 370 | 371 | 372 | 373 | 374 | 375 |
376 | 377 | 378 | 379 | 380 | 381 | 382 | 383 | 384 | 385 | 386 | 387 | 388 | 389 | 390 | 391 | 392 | 393 | 394 | 395 | 396 | 397 | 398 | 399 | 400 |
401 | 402 | 403 | 404 | 405 | 406 | 407 | 408 | 409 | 410 | 411 | 412 | 413 | 414 | 415 | 416 | 417 | 418 | 419 | 420 | 421 | 422 | 423 | 424 | 425 |
426 | 427 | 428 | 429 | 430 | 431 | 432 | 433 | 434 | 435 | 436 | 437 | 438 | 439 | 440 | 441 | 442 | 443 | 444 | 445 | 446 | 447 | 448 | 449 | 450 |
451 | 452 | 453 | 454 | 455 | 456 | 457 | 458 | 459 | 460 | 461 | 462 | 463 | 464 | 465 | 466 | 467 | 468 | 469 | 470 | 471 | 472 | 473 | 474 | 475 |
476 | 477 | 478 | 479 | 480 | 481 | 482 | 483 | 484 | 485 | 486 | 487 | 488 | 489 | 490 | 491 | 492 | 493 | 494 | 495 | 496 | 497 | 498 | 499 | 500 |
501 | 502 | 503 | 504 | 505 | 506 | 507 | 508 | 509 | 510 | 511 | 512 | 513 | 514 | 515 | 516 | 517 | 518 | 519 | 520 | 521 | 522 | 523 | 524 | 525 |
526 | 527 | 528 | 529 | 530 | 531 | 532 | 533 | 534 | 535 | 536 | 537 | 538 | 539 | 540 | 541 | 542 | 543 | 544 | 545 | 546 | 547 | 548 | 549 | 550 |
551 | 552 | 553 | 554 | 555 | 556 | 557 | 558 | 559 | 560 | 561 | 562 | 563 | 564 | 565 | 566 | 567 | 568 | 569 | 570 | 571 | 572 | 573 | 574 | 575 |
576 | 577 | 578 | 579 | 580 | 581 | 582 | 583 | 584 | 585 | 586 | 587 | 588 | 589 | 590 | 591 | 592 | 593 | 594 | 595 | 596 | 597 | 598 | 599 | 600 |
601 | 602 | 603 | 604 | 605 | 606 | 607 | 608 | 609 | 610 | 611 | 612 | 613 | 614 | 615 | 616 | 617 | 618 | 619 | 620 | 621 | 622 | 623 | 624 | 625 |
626 | 627 | 628 | 629 | 630 | 631 | 632 | 633 | 634 | 635 | 636 | 637 | 638 | 639 | 640 | 641 | 642 | 643 | 644 | 645 | 646 | 647 | 648 | 649 | 650 |
651 | 652 | 653 | 654 | 655 | 656 | 657 | 658 | 659 | 660 | 661 | 662 | 663 | 664 | 665 | 666 | 667 | 668 | 669 | 670 | 671 | 672 | 673 | 674 | 675 |
676 | 677 | 678 | 679 | 680 | 681 | 682 | 683 | 684 | 685 | 686 | 687 | 688 | 689 | 690 | 691 | 692 | 693 | 694 | 695 | 696 | 697 | 698 | 699 | 700 |
701 | 702 | 703 | 704 | 705 | 706 | 707 | 708 | 709 | 710 | 711 | 712 | 713 | 714 |
I scored 13526 points (out of 15700 possible points, top rank was 17 out of ≈60000 in August 2017) at Hackerrank's Project Euler+.
My username at Project Euler is stephanbrumme while it's stbrumme at Hackerrank.
Look at my progress and performance pages to get more details.
Copyright
I hope you enjoy my code and learn something - or give me feedback how I can improve my solutions.
All of my solutions can be used for any purpose and I am in no way liable for any damages caused.
You can even remove my name and claim it's yours. But then you shall burn in hell.
The problems and most of the problems' images were created by Project Euler.
Thanks for all their endless effort !!!
<< problem 88 - Product-sum numbers | Cube digit pairs - problem 90 >> |