PTA L1-19.谁先倒

最新推荐文章于 2024-08-08 15:12:59 发布

立志成为master

最新推荐文章于 2024-08-08 15:12:59 发布

阅读量110

点赞数 2

分类专栏： PTA题解文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/xingheyan/article/details/138376514

版权

PTA题解专栏收录该内容

101 篇文章 0 订阅

订阅专栏

#include <iostream>
using namespace std;
int main() {
 int jia, yi, n;
 cin >> jia >> yi >> n;
 int cnta = jia, cntb = yi;
 int jiahan, jiahua, yihan, yihua;
 for (int i = 0; i < n; i++) {
 cin >> jiahan >> jiahua >> yihan >> yihua;
 if (jiahan + yihan == jiahua && yihan + jiahan != yihua)
 cnta--;
 if (jiahan + yihan != jiahua && yihan + jiahan == yihua)
 cntb--;
 if(cnta == -1) {
 cout << "A" << endl << yi - cntb;
 break;
 }
 if(cntb == -1) {
 cout << "B" << endl << jia - cnta;
 break;
 }
 }
 return 0; }