L1-019 谁先倒 (15分)

题目

#include<iostream>
#include<string.h>
using namespace std;
struct d {
    int set; //酒量
    int inset = 0; //已经喝了多少
};
int main()
{
    d a, b;
    int n, sum;
    int ah[101], ahua[101], bh[101], bhua[101];
    cin >> a.set >> b.set;
    cin >> n;
    for (int i = 0; i < n; i++)
    {

        cin >> ah[i] >> ahua[i] >> bh[i] >> bhua[i];
        sum = ah[i] + bh[i]; //喊话的和
        //if (ah[i] == bh[i] && ah[i] == sum) continue;
        if (ahua[i] == sum&& bhua[i] != sum) a.inset++;
        if (bhua[i] == sum&& ahua[i] != sum) b.inset++;
        
        if (a.inset == a.set + 1) {
            cout << "A" << endl << b.inset; break;
        }
        if (b.inset == b.set + 1) {
            cout << "B" << endl << a.inset; break;
        }
    }
    /* for (int i = 0; i < n; i++)
     {
         sum = ah[i] + bh[i]; //喊话的和
         if (ahua[i] == sum) a.inset++;
         if (bhua[i] == sum) b.inset++;
         if (a.inset == a.set) {
             cout << "A" << endl << b.inset; break;
         }
         if (b.inset == b.set) {
             cout << "B" << endl << a.inset; break;
         }
     }*/
    return 0;
}