3657187_ac_1360ms_10480k.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;

public class Main {
	private Scanner in;

	public static void main(String[] args) {
		new Main().run();
	}

	private String toString(String[] array) {
		String str;

		str = "";
		for (int i = 0; i < 5; i++) {
			str += array[i];
		}
		return str;
	}

	private void run() {
		in = new Scanner(System.in);
		int n;
		String[] course = new String[5];
		String frosh;
		TreeMap <String, Integer> tm = new TreeMap <String, Integer> ();

		while (true) {
			n = in.nextInt();
			if (n == 0) {
				break;
			}
			int max = 0;
			tm.clear();
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < 5; j++) {
					course[j] = in.next();
				}
				Arrays.sort(course);
				frosh = toString(course);
				if (!tm.containsKey(frosh)) {
					tm.put(frosh, 1);
				} else {
					tm.put(frosh, tm.get(frosh) + 1);
				}
				int tmp = tm.get(frosh);
				if (tmp > max) {
					max = tmp;
				}
			}
			int ans = 0;
			for (String str : tm.keySet()) {
				if (tm.get(str) == max) {
					ans += max;
				}
			}
			System.out.println(ans);
		}
	}
}