锤子剪刀布 (20)

算法Java（暴力破解）：

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		int jiac = 0, jiaj = 0, jiab = 0;
		int yic = 0, yij = 0, yib = 0;
		int helf = 0;
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int jiam = 0, yim = 0;

		for (int i = 0; i < n; i++) {
			String s2 = sc.next();
			String s3 = sc.next();
			String s = s2+" "+s3;
			if(s.equals("C J")) {
				jiac++;
				jiam = Math.max(jiac, jiam);
			}else if(s.equals("J B")) {
				jiaj++;
				jiam = Math.max(jiaj, jiam);
			}else if(s.equals("B C")) {
				jiab++;
				jiam = Math.max(jiab, jiam);
			}else if(s.equals("J C")) {
				yic++;
				yim = Math.max(yic, yim);
			}else if(s.equals("B J")) {
				yij++;
				yim = Math.max(yij, yim);
			}else if(s.equals("C B")) {
				yib++;
				yim = Math.max(yib, yim);
			}else {
				helf++;
			}
		}
		System.out.println((jiac+jiaj+jiab)+" "+helf+" "+(yic+yij+yib));
		System.out.println((yic+yij+yib)+" "+helf+" "+(jiac+jiaj+jiab));
		System.out.println(f(jiac,jiaj,jiab,jiam)+" "+f(yic,yij,yib,yim));
	}

	private static String f(int c, int j,int b, int m) {
		if(m==b) {
			return "B";
		}else if(m==c){
			return "C";
		}
		return "J";
	}
}