-
-
Notifications
You must be signed in to change notification settings - Fork 25
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
11 changed files
with
481 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
# Instructions | ||
|
||
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 programs. | ||
|
||
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). | ||
|
||
```text | ||
1 => I | ||
10 => X | ||
7 => VII | ||
``` | ||
|
||
The maximum number supported by this notation is 3,999. | ||
(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 | ||
|
||
Learn more about [Roman numerals on Wikipedia][roman-numerals]. | ||
|
||
[roman-numerals]: https://wiki.imperivm-romanvm.com/wiki/Roman_Numerals |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
/** | ||
* Here is an example solution for the RomanNumerals exercise | ||
*/ | ||
component { | ||
|
||
var steps: { | ||
"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" | ||
} | ||
/** | ||
* @returns | ||
*/ | ||
function roman( number ) { | ||
var result = "" | ||
|
||
for (step in steps) { | ||
while(number >= step) { | ||
number -= step | ||
result += steps[step] | ||
} | ||
} | ||
|
||
return result | ||
} | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,7 @@ | ||
component extends="RomanNumeralsTest" { | ||
|
||
function beforeAll(){ | ||
SUT = createObject( 'Solution' ); | ||
} | ||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
{ | ||
"authors": [ | ||
"BNAndras" | ||
], | ||
"files": { | ||
"solution": [ | ||
"RomanNumerals.cfc" | ||
], | ||
"test": [ | ||
"RomanNumeralsTest.cfc" | ||
], | ||
"example": [ | ||
".meta/Example.cfc" | ||
] | ||
}, | ||
"blurb": "Write a function to convert from normal numbers to Roman Numerals.", | ||
"source": "The Roman Numeral Kata", | ||
"source_url": "https://codingdojo.org/kata/RomanNumerals/" | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,88 @@ | ||
# This is an auto-generated file. | ||
# | ||
# Regenerating this file via `configlet sync` will: | ||
# - Recreate every `description` key/value pair | ||
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications | ||
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion) | ||
# - Preserve any other key/value pair | ||
# | ||
# As user-added comments (using the # character) will be removed when this file | ||
# is regenerated, comments can be added via a `comment` key. | ||
|
||
[19828a3a-fbf7-4661-8ddd-cbaeee0e2178] | ||
description = "1 is I" | ||
|
||
[f088f064-2d35-4476-9a41-f576da3f7b03] | ||
description = "2 is II" | ||
|
||
[b374a79c-3bea-43e6-8db8-1286f79c7106] | ||
description = "3 is III" | ||
|
||
[05a0a1d4-a140-4db1-82e8-fcc21fdb49bb] | ||
description = "4 is IV" | ||
|
||
[57c0f9ad-5024-46ab-975d-de18c430b290] | ||
description = "5 is V" | ||
|
||
[20a2b47f-e57f-4797-a541-0b3825d7f249] | ||
description = "6 is VI" | ||
|
||
[ff3fb08c-4917-4aab-9f4e-d663491d083d] | ||
description = "9 is IX" | ||
|
||
[6d1d82d5-bf3e-48af-9139-87d7165ed509] | ||
description = "16 is XVI" | ||
|
||
[2bda64ca-7d28-4c56-b08d-16ce65716cf6] | ||
description = "27 is XXVII" | ||
|
||
[a1f812ef-84da-4e02-b4f0-89c907d0962c] | ||
description = "48 is XLVIII" | ||
|
||
[607ead62-23d6-4c11-a396-ef821e2e5f75] | ||
description = "49 is XLIX" | ||
|
||
[d5b283d4-455d-4e68-aacf-add6c4b51915] | ||
description = "59 is LIX" | ||
|
||
[4465ffd5-34dc-44f3-ada5-56f5007b6dad] | ||
description = "66 is LXVI" | ||
|
||
[46b46e5b-24da-4180-bfe2-2ef30b39d0d0] | ||
description = "93 is XCIII" | ||
|
||
[30494be1-9afb-4f84-9d71-db9df18b55e3] | ||
description = "141 is CXLI" | ||
|
||
[267f0207-3c55-459a-b81d-67cec7a46ed9] | ||
description = "163 is CLXIII" | ||
|
||
[902ad132-0b4d-40e3-8597-ba5ed611dd8d] | ||
description = "166 is CLXVI" | ||
|
||
[cdb06885-4485-4d71-8bfb-c9d0f496b404] | ||
description = "402 is CDII" | ||
|
||
[6b71841d-13b2-46b4-ba97-dec28133ea80] | ||
description = "575 is DLXXV" | ||
|
||
[dacb84b9-ea1c-4a61-acbb-ce6b36674906] | ||
description = "666 is DCLXVI" | ||
|
||
[432de891-7fd6-4748-a7f6-156082eeca2f] | ||
description = "911 is CMXI" | ||
|
||
[e6de6d24-f668-41c0-88d7-889c0254d173] | ||
description = "1024 is MXXIV" | ||
|
||
[efbe1d6a-9f98-4eb5-82bc-72753e3ac328] | ||
description = "1666 is MDCLXVI" | ||
|
||
[bb550038-d4eb-4be2-a9ce-f21961ac3bc6] | ||
description = "3000 is MMM" | ||
|
||
[3bc4b41c-c2e6-49d9-9142-420691504336] | ||
description = "3001 is MMMI" | ||
|
||
[4e18e96b-5fbb-43df-a91b-9cb511fe0856] | ||
description = "3999 is MMMCMXCIX" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,13 @@ | ||
/** | ||
* Your implementation of the RomanNumerals exercise | ||
*/ | ||
component { | ||
|
||
/** | ||
* @returns | ||
*/ | ||
function value( colors ) { | ||
// Implement me here | ||
} | ||
|
||
} |
119 changes: 119 additions & 0 deletions
119
exercises/practice/roman-numerals/RomanNumeralsTest.cfc
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,119 @@ | ||
component extends="testbox.system.BaseSpec" { | ||
|
||
function beforeAll(){ | ||
SUT = createObject( 'RomanNumerals' ); | ||
} | ||
|
||
function run(){ | ||
|
||
describe( "My RomanNumerals class", function(){ | ||
|
||
it( '1 is I', function(){ | ||
expect( SUT.roman( number='1' ) ).toBe( 'I' ); | ||
}); | ||
|
||
it( '2 is II', function(){ | ||
expect( SUT.roman( number='2' ) ).toBe( 'II' ); | ||
}); | ||
|
||
it( '3 is III', function(){ | ||
expect( SUT.roman( number='3' ) ).toBe( 'III' ); | ||
}); | ||
|
||
it( '4 is IV', function(){ | ||
expect( SUT.roman( number='4' ) ).toBe( 'IV' ); | ||
}); | ||
|
||
it( '5 is V', function(){ | ||
expect( SUT.roman( number='5' ) ).toBe( 'V' ); | ||
}); | ||
|
||
it( '6 is VI', function(){ | ||
expect( SUT.roman( number='6' ) ).toBe( 'VI' ); | ||
}); | ||
|
||
it( '9 is IX', function(){ | ||
expect( SUT.roman( number='9' ) ).toBe( 'IX' ); | ||
}); | ||
|
||
it( '16 is XVI', function(){ | ||
expect( SUT.roman( number='16' ) ).toBe( 'XVI' ); | ||
}); | ||
|
||
it( '27 is XXVII', function(){ | ||
expect( SUT.roman( number='27' ) ).toBe( 'XXVII' ); | ||
}); | ||
|
||
it( '48 is XLVIII', function(){ | ||
expect( SUT.roman( number='48' ) ).toBe( 'XLVIII' ); | ||
}); | ||
|
||
it( '49 is XLIX', function(){ | ||
expect( SUT.roman( number='49' ) ).toBe( 'XLIX' ); | ||
}); | ||
|
||
it( '59 is LIX', function(){ | ||
expect( SUT.roman( number='59' ) ).toBe( 'LIX' ); | ||
}); | ||
|
||
it( '66 is LXVI', function(){ | ||
expect( SUT.roman( number='66' ) ).toBe( 'LXVI' ); | ||
}); | ||
|
||
it( '93 is XCIII', function(){ | ||
expect( SUT.roman( number='93' ) ).toBe( 'XCIII' ); | ||
}); | ||
|
||
it( '141 is CXLI', function(){ | ||
expect( SUT.roman( number='141' ) ).toBe( 'CXLI' ); | ||
}); | ||
|
||
it( '163 is CLXIII', function(){ | ||
expect( SUT.roman( number='163' ) ).toBe( 'CLXIII' ); | ||
}); | ||
|
||
it( '166 is CLXVI', function(){ | ||
expect( SUT.roman( number='166' ) ).toBe( 'CLXVI' ); | ||
}); | ||
|
||
it( '402 is CDII', function(){ | ||
expect( SUT.roman( number='402' ) ).toBe( 'CDII' ); | ||
}); | ||
|
||
it( '575 is DLXXV', function(){ | ||
expect( SUT.roman( number='575' ) ).toBe( 'DLXXV' ); | ||
}); | ||
|
||
it( '666 is DCLXVI', function(){ | ||
expect( SUT.roman( number='666' ) ).toBe( 'DCLXVI' ); | ||
}); | ||
|
||
it( '911 is CMXI', function(){ | ||
expect( SUT.roman( number='911' ) ).toBe( 'CMXI' ); | ||
}); | ||
|
||
it( '1024 is MXXIV', function(){ | ||
expect( SUT.roman( number='1024' ) ).toBe( 'MXXIV' ); | ||
}); | ||
|
||
it( '1666 is MDCLXVI', function(){ | ||
expect( SUT.roman( number='1666' ) ).toBe( 'MDCLXVI' ); | ||
}); | ||
|
||
it( '3000 is MMM', function(){ | ||
expect( SUT.roman( number='3000' ) ).toBe( 'MMM' ); | ||
}); | ||
|
||
it( '3001 is MMMI', function(){ | ||
expect( SUT.roman( number='3001' ) ).toBe( 'MMMI' ); | ||
}); | ||
|
||
it( '3999 is MMMCMXCIX', function(){ | ||
expect( SUT.roman( number='3999' ) ).toBe( 'MMMCMXCIX' ); | ||
}); | ||
|
||
}); | ||
|
||
} | ||
|
||
} |
Oops, something went wrong.