ZOJ 3958 Cooking Competition 【水】
2018-03-14 21:52
267 查看
题目链接
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3958
AC代码
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3958
AC代码
#include <cstdio> #include <cstring> #include <ctype.h> #include <cstdlib> #include <iostream> #include <algorithm> #include <cmath> #include <deque> #include <vector> #include <queue> #include <string> #include <map> #include <stack> #include <set> #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 t; cin >> t; while (t--) { int n; int a = 0, b = 0; cin >> n; int num; for (int i = 0; i < n; i++) { scanf("%d", &num); if (num == 1) a++; else if (num == 2) b++; else if (num == 3) a++, b++; else if (num == 4) a--, b--; } if (a > b) cout << "Kobayashi\n"; else if (a == b) cout << "Draw\n"; else if (a < b) cout << "Tohru\n"; } }
相关文章推荐
- ZOJ 3958 Cooking Competition 题解
- zoj 3958 Cooking Competition
- ZOJ 3958 Cooking Competition
- ZOJ Problem Set - 3958―Cooking Competition
- ZOJ - 3958 Cooking Competition
- ZOJ 3958 Cooking Competition【】
- zoj 2504 Help John!(Dijkstra~~)
- ZOJ3430----AC自动机加模拟(巨坑,心里素质不好的人别做)
- zoj 3882 Help Bob(zoj 2015年7月月赛)
- zoj 3732 Graph Reconstruction 构造
- 【三分查找求单峰函数的最值】 ZOJ 3386 Trick or Treat
- zoj_1203 Swordfish
- ZOJ 1004 Anagrams by Stack
- Hanoi Tower Troubles Again! ZOJ - 1239
- zoj 2760 How Many Shortest Path //MAXFLOW
- zoj 3195 Design the city
- 【主席树】 ZOJ 2112 Dynamic Rankings 区间第k小值
- HDU 1010/ZOJ 2110 Tempter of the Bone(奇偶剪枝)
- ZOJ 1203 Swordfish ( prim )
- zoj_3326_An Awful Problem(日期模拟)