aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Add tasks for all the new languages

Browse source
This commit is contained in:
Tina Müller 2016-12-05 23:44:36 +01:00
parent 9dc3c2bb62
commit bba7bfd280
13208 changed files with 134745 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

31
Task/Roman-numerals-Encode/Ceylon/roman-numerals-encode.ceylon Normal file
View file

@ -0,0 +1,31 @@
shared void run() {
class Numeral(shared Character char, shared Integer int) {}
value tiers = [
[Numeral('I', 1), Numeral('V', 5), Numeral('X', 10)],
[Numeral('X', 10), Numeral('L', 50), Numeral('C', 100)],
[Numeral('C', 100), Numeral('D', 500), Numeral('M', 1k)]
];
String toRoman(Integer hindu, Integer power = 2) {
assert(exists tier = tiers[power]);
if(hindu <= 0) {
return "";
} else if(exists num = tier.rest.find((Numeral elem) => elem.int - tier.first.int <= hindu < elem.int)) {
return "``tier.first.char````num.char````toRoman(hindu - (num.int - tier.first.int), power)``";
} else if(exists num = tier.reversed.find((Numeral elem) => hindu >= elem.int)) {
return "``num.char````toRoman(hindu - num.int, power)``";
} else {
return toRoman(hindu, power - 1);
}
}
assert(toRoman(1) == "I");
assert(toRoman(2) == "II");
assert(toRoman(4) == "IV");
assert(toRoman(1666) == "MDCLXVI");
assert(toRoman(1990) == "MCMXC");
assert(toRoman(2008) == "MMVIII");
}