ZOJ - 3958 Cooking Competition
2017-08-31 15:35
337 查看
//水题 #include <cstdio> #include <iostream> using namespace std; int a[25]; int main() { int t, n; cin >> t; while (t--) { cin >> n; int mark1 = 0, mark2 = 0; for (int i = 0; i < n; i++) { cin >> a[i]; switch(a[i]) { case 1: mark1++; break; case 2: mark2++; break; // case 3: mark1++; mark2++; break; // case 4: mark1--; mark2--; break; } } if (mark1 > mark2) cout << "Kobayashi" << endl; else if (mark1 < mark2) cout << "Tohru" << endl; else cout << "Draw" << endl; } return 0; }
相关文章推荐
- ZOJ 3958 Cooking Competition【】
- ZOJ 3958 Cooking Competition 题解
- zoj 3958 Cooking Competition
- ZOJ 3958 Cooking Competition
- ZOJ Problem Set - 3958―Cooking Competition
- ZOJ 3958 Cooking Competition 【水】
- ZOJ 3622 Magic Number(打表)
- ZOJ2110 HDU1010 搜索 Tempter of the Bone
- ZOJ 3646
- ZOJ 3518 Unsafe Factor
- ZOJ 1048 Financial Management
- POJ 1459 Power Network / HIT 1228 Power Network / UVAlive 2760 Power Network / ZOJ 1734 Power Network / FZU 1161 (网络流,最大流)
- zoj 3261 Connections in Galaxy War(逆向并查集)
- [迭代加深dfs] zoj 3768 Continuous Login
- ZOJ 1241 Geometry Made Simple
- ZOJ 3453 Doraemon's Sweet Bullet(线段树区间更新+单点更新+最值询问)
- ZOJ 3362 无向图费用流
- ZOJ 3256 Tour in the Castle
- ZOJ Problem Set - 3429 Cube Simulation
- ZOJ-3687 The Review Plan I(容斥原理,禁位排列,dfs)