PAT 天梯赛 L1-019. 谁先倒 【水】
2024-08-29 07:00:08
题目链接
https://www.patest.cn/contests/gplt/L1-019
AC代码
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;
typedef long long LL;
const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;
const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
int main()
{
int arr[2] = {0};
cin >> arr[0] >> arr[1];
int q = arr[0], w = arr[1];
int n;
cin >> n;
int a, b, c, d;
int flag = 1;
while (n--)
{
scanf("%d%d%d%d", &a, &b, &c, &d);
if (flag)
{
if (a + c == b && a + c != d)
{
arr[0]--;
if (arr[0] < 0)
flag = 0;
}
if (a + c == d && a + c != b)
{
arr[1]--;
if (arr[1] < 0)
flag = 0;
}
}
else
continue;
}
if (arr[0] < 0)
printf("A\n%d\n", w - arr[1]);
else
printf("B\n%d\n", q - arr[0]);
}
最新文章
- Traditional Language Model
- Spring 核心框架体系结构
- mybatis批量插入返回主键问题
- win7怎么显示隐藏文件夹
- POJ 2486 Apple Tree
- mac平台下面nodejs环境搭配
- excel 里面拼接 MySQL insert 语句
- 【转】ChainMapper 实例理解二
- Erlang运行时的错误
- AngularJS进入使用前的准备工作
- Dockerfile 最佳实践
- centos6.2安装桌面环境 与中文支持
- 49个Spring经典面试题总结,附带答案,赶紧收藏
- IntentService原理分析
- Mysql在sql中截取时间类型字段的年月日
- 【腾讯Bugly干货分享】Android 插件技术实战总结
- How to trigger an Animation when TextBlock’s Text is changed during a DataBinding
- IPOPT工具解决非线性规划最优化问题使用案例
- Google Maps瓦片(tile)地图文件下载(1-11层级)
- listener.ora 与 tnsnames.ora