zoj 3958 Cooking Competition
2017-04-26 19:05
197 查看
题目链接:Cooking Competition
题目大意,给你四种操作,每种操作的双方会获得不同分数,问你最后谁获胜;
题目思路:水题,直接模拟就可以了
题目大意,给你四种操作,每种操作的双方会获得不同分数,问你最后谁获胜;
题目思路:水题,直接模拟就可以了
#include <bits/stdc++.h> using namespace std; typedef long long ll; int a[4] = {1,0,1,-1},b[4] = {0,1,1,-1}; int main(){ int t; scanf("%d",&t); while(t--){ int n,x[25]; scanf("%d",&n); ll sum1 = 0,sum2 = 0; for(int i = 0;i < n;i++){ scanf("%d",&x[i]); sum1 += a[x[i]-1]; sum2 += b[x[i]-1]; } if(sum1 > sum2) puts("Kobayashi"); else if(sum1 == sum2) puts("Draw"); else puts("Tohru"); } 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 3256 Tour in the Castle(插头DP一条回路+矩阵连乘)
- ZOJ - 1880 Tug of War
- zoj 2016 poj 1386 Play on Words 欧拉回路+DFS
- ZOJ-1037
- ZOJ 3652 MAZE(BFS)
- ZOJ 3714 Java Beans
- ZOJ - 3621——Factorial Problem in Base K
- ZOJ 3992 && 2017CCPC秦皇岛 L:One-Dimensional Maze
- zoj 3213 Beautiful Meadow 插头dp
- [dp] zoj 3682 E - Cup 3
- zoj 2100 Seeding
- ZOJ 3987 秦皇岛现场赛G题 java
- hdu3783 ZOJ (水)
- zoj 3533 Gao the String I(伸展树+字符串hash)