project euler 89

Problem 89

---

Roman numerals

For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is always a “best” way of writing a particular number.

For example, it would appear that there are at least six ways of writing the number sixteen:

IIIIIIIIIIIIIIII
VIIIIIIIIIII
VVIIIIII
XIIIIII
VVVI
XVI

However, according to the rules only XIIIIII and XVI are valid, and the last example is considered to be 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; seeAbout… 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.

---

罗马数字

要正确地用罗马数字表达一个数，必须遵循一些基本规则。尽管符合规则的写法有时会多于一种，但对每个数来说总是存在一种“最好的”写法。

例如，数16就至少有六种写法：

IIIIIIIIIIIIIIII
VIIIIIIIIIII
VVIIIIII
XIIIIII
VVVI
XVI

然而，根据规则，只有XIIIIII和XVI是合理的写法，而后一种因为使用了最少的数字而被认为是最有效的写法。

在这个11K的文本文件roman.txt （右击并选择“目标另存为……”）中包含了一千个合理的罗马数字写法，但并不都是最有效的写法；有关罗马数字的明确规则，可以参考关于罗马数字。

求出将这些数都写成最有效的写法所节省的字符数。

注意：你可以假定文件中的所有罗马数字写法都不包含连续超过四个相同字符。

package projecteuler;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

import junit.framework.TestCase;

public class Prj89 extends TestCase {

	public static final String PATH = "E:\\whua\\mathWorkspace\\test_jgraph\\src\\projecteuler\\Prj89.txt";

	public void testRomanNumerals() {

		List<String> strs = readStrs();
		int sum = 0;
		for (int i = 0; i < strs.size(); i++) {
			String srcStr = strs.get(i);
			String romanStr = int2RomanStr(calculateSum(srcStr));
			sum += (srcStr.length() - romanStr.length());

			if (!srcStr.equals(romanStr)) {
				System.out.println(srcStr + "=" + romanStr);
			}

		}

		System.out.println("sum=" + sum);
	}

	public static enum RomanUnit {
		I(1), V(5), X(10), L(50), C(100), D(500), M(1000);

		private int val;

		RomanUnit(int val) {
			this.val = val;
		}

		public int getValue() {
			return val;
		}

		public static RomanUnit toRomanUnit(String str) {
			if (str.equals("I")) {
				return I;
			} else if (str.equals("V")) {
				return V;
			} else if (str.equals("X")) {
				return X;
			} else if (str.equals("L")) {
				return L;
			} else if (str.equals("L")) {
				return L;
			} else if (str.equals("C")) {
				return C;
			} else if (str.equals("D")) {
				return D;
			} else if (str.equals("M")) {
				return M;
			}

			return null;

		}
	}

	public int calculateSum(String srcRomanStr) {

		int sum = 0;
		for (int i = 0; i < srcRomanStr.length(); i++) {
			sum += RomanUnit.toRomanUnit(String.valueOf(srcRomanStr.charAt(i)))
					.getValue();
		}

		if (srcRomanStr.indexOf("IV") != -1) {
			sum -= RomanUnit.I.getValue() * 2;
		}
		if (srcRomanStr.indexOf("IX") != -1) {
			sum -= RomanUnit.I.getValue() * 2;
		}
		if (srcRomanStr.indexOf("XL") != -1) {
			sum -= RomanUnit.X.getValue() * 2;
		}
		if (srcRomanStr.indexOf("XC") != -1) {
			sum -= RomanUnit.X.getValue() * 2;
		}
		if (srcRomanStr.indexOf("CD") != -1) {
			sum -= RomanUnit.C.getValue() * 2;
		}
		if (srcRomanStr.indexOf("CM") != -1) {
			sum -= RomanUnit.C.getValue() * 2;
		}

		return sum;

	}

	public String int2RomanStr(int val) {
		StringBuilder sb = new StringBuilder();

		int tp = val;
		while (tp >= RomanUnit.M.getValue()) {
			sb.append(RomanUnit.M.toString());
			tp -= RomanUnit.M.getValue();
		}

		assert (tp < RomanUnit.M.getValue());
		// 900
		if (tp >= RomanUnit.M.getValue() - RomanUnit.C.getValue()) {
			sb.append("CM");
			tp -= (RomanUnit.M.getValue() - RomanUnit.C.getValue());
		}

		// 400
		if ((tp >= RomanUnit.D.getValue() - RomanUnit.C.getValue())
				&& (tp < RomanUnit.D.getValue())) {
			sb.append("CD");
			tp -= (RomanUnit.D.getValue() - RomanUnit.C.getValue());
		}

		if (tp >= RomanUnit.D.getValue()) {

			sb.append("D");
			tp -= RomanUnit.D.getValue();

			while (tp >= RomanUnit.C.getValue()) {
				tp -= RomanUnit.C.getValue();
				sb.append("C");
			}
		}

		while (tp >= RomanUnit.C.getValue()) {
			sb.append(RomanUnit.C.toString());
			tp -= RomanUnit.C.getValue();
		}

		assert (tp < RomanUnit.C.getValue());

		// 90
		if (tp >= RomanUnit.C.getValue() - RomanUnit.X.getValue()) {
			sb.append("XC");
			tp -= (RomanUnit.C.getValue() - RomanUnit.X.getValue());
		}

		// 40
		if ((tp >= RomanUnit.L.getValue() - RomanUnit.X.getValue())
				&& (tp < RomanUnit.L.getValue())) {
			sb.append("XL");
			tp -= (RomanUnit.L.getValue() - RomanUnit.X.getValue());
		}

		if (tp >= RomanUnit.L.getValue()) {

			sb.append("L");
			tp -= RomanUnit.L.getValue();

			while (tp >= RomanUnit.X.getValue()) {
				tp -= RomanUnit.X.getValue();
				sb.append("X");
			}
		}

		while (tp >= RomanUnit.X.getValue()) {
			sb.append(RomanUnit.X.toString());
			tp -= RomanUnit.X.getValue();
		}
		assert (tp < RomanUnit.X.getValue());
		// 9
		if (tp >= RomanUnit.X.getValue() - RomanUnit.I.getValue()) {
			sb.append("IX");
			tp -= (RomanUnit.X.getValue() - RomanUnit.I.getValue());
		}

		// 4
		if ((tp >= RomanUnit.V.getValue() - RomanUnit.I.getValue())
				&& (tp < RomanUnit.V.getValue())) {
			sb.append("IV");
			tp -= (RomanUnit.V.getValue() - RomanUnit.I.getValue());
		}

		if (tp >= RomanUnit.V.getValue()) {

			sb.append("V");
			tp -= RomanUnit.V.getValue();

			while (tp >= RomanUnit.I.getValue()) {
				tp -= RomanUnit.I.getValue();
				sb.append("I");
			}
		}
		while (tp >= RomanUnit.I.getValue()) {
			sb.append(RomanUnit.I.toString());
			tp -= RomanUnit.I.getValue();
		}
		return sb.toString();
	}

	List<String> readStrs() {

		List<String> ret = new ArrayList<String>();

		try {
			BufferedReader reader = new BufferedReader(new InputStreamReader(
					new FileInputStream(PATH)));
			String str = "";
			while ((str = reader.readLine()) != null) {
				ret.add(str.trim());
			}
			reader.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
		return ret;

	}

}