# brunnock's solution

## to Roman Numerals in the JavaScript Track

Published at Jul 13 2018 · 0 comments
Instructions
Test suite
Solution

#### Note:

This solution was written on an old version of Exercism. The tests below might not correspond to the solution code, and the exercise may have changed since this code was written.

Write a function to convert from normal numbers to Roman Numerals.

The Romans were a clever bunch. They conquered most of Europe and ruled it for hundreds of years. They invented concrete and straight roads and even bikinis. One thing they never discovered though was the number zero. This made writing and dating extensive histories of their exploits slightly more challenging, but the system of numbers they came up with is still in use today. For example the BBC uses Roman numerals to date their programmes.

The Romans wrote numbers using letters - I, V, X, L, C, D, M. (notice these letters have lots of straight lines and are hence easy to hack into stone tablets).

`````` 1  => I
10  => X
7  => VII
``````

There is no need to be able to convert numbers larger than about 3000. (The Romans themselves didn't tend to go any higher)

Wikipedia says: Modern Roman numerals ... are written by expressing each digit separately starting with the left most digit and skipping any digit with a value of zero.

To see this in practice, consider the example of 1990.

In Roman numerals 1990 is MCMXC:

1000=M 900=CM 90=XC

2008 is written as MMVIII:

2000=MM 8=VIII

## Setup

Go through the setup instructions for JavaScript to install the necessary dependencies:

http://exercism.io/languages/javascript/installation

## Running the test suite

The provided test suite uses Jasmine. You can install it by opening a terminal window and running the following command:

``````npm install -g jasmine
``````

Run the test suite from the exercise directory with:

``````jasmine roman-numerals.spec.js
``````

In many test suites all but the first test have been marked "pending". Once you get a test passing, activate the next one by changing `xit` to `it`.

## Source

The Roman Numeral Kata http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals

## Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

### roman-numerals.spec.js

``````var toRoman = require('./roman-numerals');

describe('toRoman()', function () {
it('converts 1', function () {
expect(toRoman(1)).toEqual('I');
});

xit('converts 2', function () {
expect(toRoman(2)).toEqual('II');
});

xit('converts 3', function () {
expect(toRoman(3)).toEqual('III');
});

xit('converts 4', function () {
expect(toRoman(4)).toEqual('IV');
});

xit('converts 5', function () {
expect(toRoman(5)).toEqual('V');
});

xit('converts 6', function () {
expect(toRoman(6)).toEqual('VI');
});

xit('converts 9', function () {
expect(toRoman(9)).toEqual('IX');
});

xit('converts 27', function () {
expect(toRoman(27)).toEqual('XXVII');
});

xit('converts 48', function () {
expect(toRoman(48)).toEqual('XLVIII');
});

xit('converts 59', function () {
expect(toRoman(59)).toEqual('LIX');
});

xit('converts 93', function () {
expect(toRoman(93)).toEqual('XCIII');
});

xit('converts 141', function () {
expect(toRoman(141)).toEqual('CXLI');
});

xit('converts 163', function () {
expect(toRoman(163)).toEqual('CLXIII');
});

xit('converts 402', function () {
expect(toRoman(402)).toEqual('CDII');
});

xit('converts 575', function () {
expect(toRoman(575)).toEqual('DLXXV');
});

xit('converts 911', function () {
expect(toRoman(911)).toEqual('CMXI');
});

xit('converts 1024', function () {
expect(toRoman(1024)).toEqual('MXXIV');
});

xit('converts 3000', function () {
expect(toRoman(3000)).toEqual('MMM');
});
});``````
``````var rom_numerals = ['M', 'CM', 'D', 'C', 'XC', 'L', 'X', 'IX', 'V', 'I'];
var rom_values = {M:1000, CM:900, D:500, C:100, XC:90, L:50, X:10, IX:9, V:5, I:1};

function toRoman(num) {
var string='';

for (var i=0; i<rom_numerals.length; ++i) {
var rom_num = rom_numerals[i];
var rom_val = rom_values[rom_num];
var substring='';
var digits  = (num / rom_val) | 0 ;
num = num % rom_val;
for (var x=0; x<digits; ++x) substring += rom_num;
if (substring.length==4) substring = rom_num + rom_numerals[i-1];
string += substring;
}
return string;
}

module.exports=toRoman;``````