Project Euler > Problem 89 > Roman numerals (Java Solution)

Problem:

The rules for writing Roman numerals allow for many ways of writing each number (see About 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:

IIIIIIIIIIIIIIII
VIIIIIIIIIII
VVIIIIII
XIIIIII
VVVI
XVI

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 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.

Solution:

840

Code:
The solution may include methods that will be found here: Library.java .

public interface EulerSolution{

public String run();

}

/* 
 * Solution to Project Euler problem 39
 * By Nayuki Minase
 * 
 * http://nayuki.eigenstate.org/page/project-euler-solutions
 * https://github.com/nayuki/Project-Euler-solutions
 */


public final class p039 implements EulerSolution {
	
	public static void main(String[] args) {
		System.out.println(new p039().run());
	}
	
	
	public String run() {
		int maxPerimeter = 0;
		int maxTriangles = 0;
		for (int p = 1; p <= 1000; p++) {
			int triangles = countSolutions(p);
			if (triangles > maxTriangles) {
				maxTriangles = triangles;
				maxPerimeter = p;
			}
		}
		return Integer.toString(maxPerimeter);
	}
	
	
	private static int countSolutions(int p) {
		int count = 0;
		for (int a = 1; a <= p; a++) {
			for (int b = a; b <= p; b++) {
				int c = p - a - b;
				if (b <= c && a * a + b * b == c * c)
					count++;
			}
		}
		return count;
	}
	
}