L1-019 谁先倒-java

输入样例：

1 1
6
8 10 9 12
5 10 5 10
3 8 5 12
12 18 1 13
4 16 12 15
15 1 1 16

输出样例：

A
1

import java.util.Scanner;

public class Main {
public static void main(String[] args) {
	Scanner sc =new Scanner(System.in);
	int a=sc.nextInt();
	int b=sc.nextInt();
	int n=sc.nextInt();
	int counta=0;
	int countb=0;
	int[][] s = new int[n][4];
	for(int i=0;i<n;i++) {
		for(int j=0;j<4;j++) {
			s[i][j]=sc.nextInt();
		}
	}
	for(int i=0;i<n;i++) {
           //后边跟着是不等于，防止平局
		if(s[i][0]+s[i][2]==s[i][1]&&s[i][0]+s[i][2]!=s[i][3]) {
			counta++;
		}else if(s[i][0]+s[i][2]==s[i][3]&&s[i][0]+s[i][2]!=s[i][1]) {
			countb++;
		}
		if(counta==a+1) {
			System.out.println("A");
			System.out.println(countb);
			break;
		}
		if(countb==b+1) {
			System.out.println("B");
			System.out.println(counta);
			break;
		}
	}
}
}