project-euler: Rewrap, update links, add copyrights, tests

[factor.git] / extra / project-euler / 089 / 089.factor

diff --git a/extra/project-euler/089/089.factor b/extra/project-euler/089/089.factor
index 49b7a96a298b6549e71d56f2759769d9f1f6ddf5..c908bc3d0d043a5a238957a908cb56e325a877e3 100644 (file)
--- a/extra/project-euler/089/089.factor
+++ b/extra/project-euler/089/089.factor
@@ -4,17 +4,17 @@ USING: io.encodings.ascii io.files kernel math
 project-euler.common roman sequences ;
 IN: project-euler.089
 
-! https://projecteuler.net/index.php?section=problems&id=089
+! https://projecteuler.net/problem=89
 
 ! DESCRIPTION
 ! -----------
 
-! The rules for writing Roman numerals allow for many ways of writing
-! each number (see FAQ: Roman Numerals). However, there is always a
-! "best" way of writing a particular number.
+! The rules for writing Roman numerals allow for many ways of
+! writing each number (see FAQ: Roman Numerals). However, there
+! is always a "best" way of writing a particular number.
 
-! For example, the following represent all of the legitimate ways of
-! writing the number sixteen:
+! For example, the following represent all of the legitimate
+! ways of writing the number sixteen:
 
 ! IIIIIIIIIIIIIIII
 ! VIIIIIIIIIII
@@ -23,16 +23,17 @@ IN: project-euler.089
 ! VVVI
 ! XVI
 
-! The last example being considered the most efficient, as it uses
-! the least number of numerals.
+! The last example being considered 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; that is, they are arranged in descending units
-! and obey the subtractive pair rule (see FAQ for the definitive rules
-! for this problem).
+! 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; that is,
+! they are arranged in descending units and obey the subtractive
+! pair rule (see FAQ for the definitive rules for this problem).
 
-! Find the number of characters saved by writing each of these in their minimal form.
+! Find the number of characters saved by writing each of these
+! in their minimal form.
 
 ! SOLUTION
 ! --------