L1-019 谁先倒 (15分)

L1-019 谁先倒 (15分)

输入案例

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 input = new Scanner(System.in);
       int n = input.nextInt();
       int jia = input.nextInt();
       int yi = input.nextInt();
       int i = 0, a = 0; b = 0;
       while(i < n) {
             int a1 = input.nextInt();
             int b1 = input.nextInt();
             int a2 = input.nextInt();  
             int b2 = input.nextInt();
             int s = a1 + a2;   
             if(a1 == a2 && b1 == s)  {
                continue;
             }   
             if(b1 == s)  {
                a++;
                if(a > jia){
                   System.out.println("A");
                   System.out.println(b);  
                }
             }
              if(b1 == s)  {
                b++;
                if(a > jia){
                   System.out.println("B");
                   System.out.println(a);  
                }
             }
       }
       i++;
}
}