ZOJ 3958Cooking Competition
来源:互联网 发布:latex for mac下载 编辑:程序博客网 时间:2024/06/08 09:11
"Miss Kobayashi's Dragon Maid" is a Japanese manga series written and illustrated by Coolkyoushinja. An anime television series produced by Kyoto Animation aired in Japan between January and April 2017.
In episode 8, two main characters, Kobayashi and Tohru, challenged each other to a cook-off to decide who would make a lunchbox for Kanna's field trip. In order to decide who is the winner, they asked n people to taste their food, and changed their scores according to the feedback given by those people.
There are only four types of feedback. The types of feedback and the changes of score are given in the following table.
(Kobayashi)
(Tohru)
Given the types of the feedback of these n people, can you find out the winner of the cooking competition (given that the initial score of Kobayashi and Tohru are both 0)?
Input
There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 100), indicating the number of test cases. For each test case:
The first line contains an integer n (1 ≤ n ≤ 20), its meaning is shown above.
The next line contains n integers a1, a2, ... , an (1 ≤ ai ≤ 4), indicating the types of the feedback given by these n people.
Output
For each test case output one line. If Kobayashi gets a higher score, output "Kobayashi" (without the quotes). If Tohru gets a higher score, output "Tohru" (without the quotes). If Kobayashi's score is equal to that of Tohru's, output "Draw" (without the quotes).
Sample Input
231 2 123 4
Sample Output
KobayashiDraw
Hint
For the first test case, Kobayashi gets 1 + 0 + 1 = 2 points, while Tohru gets 0 + 1 + 0 = 1 point. So the winner is Kobayashi.
For the second test case, Kobayashi gets 1 - 1 = 0 point, while Tohru gets 1 - 1 = 0 point. So it's a draw.
想法:水题
代码:
#include<stdio.h>
#include<string.h>
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
int i,j,a;
int shi=0;
int tohru=0;
for(i=0;i<n;i++)
{
scanf("%d",&a);
if(a==1)
shi++;
if(a==2)
tohru++;
if(a==3)
{
shi++;
tohru++;
}
if(a==4)
{
shi--;
tohru--;
}
}
if(shi>tohru)
printf("Kobayashi\n");
if(shi==tohru)
printf("Draw\n");
if(shi<tohru)
printf("Tohru\n");
}
return 0;
}
- ZOJ 3958 Cooking Competition
- ZOJ 3958 Cooking Competition【】
- zoj 3958 Cooking Competition
- ZOJ 3958Cooking Competition
- ZOJ 3958 Cooking Competition 题解
- Cooking Competition
- Cooking Competition
- Cooking Competition
- ZOJ3958-Cooking Competition
- ZOJ3958 Cooking Competition
- Cooking
- cooking
- Competition
- cooking处理
- Cooking 笔记
- FOOD COOKING
- Cooking food
- 【题解】cooking
- 教你如何简单快速的清理你的mac苹果电脑垃圾
- H.264视频编解码技术解析
- CS229 Lecture Note 1(监督学习、线性回归)
- LightOJ 1141 Number Transformation
- 创建一个Node.js应用
- ZOJ 3958Cooking Competition
- phalcon框架中的聚合
- 剑指offer题63
- codevs 2833 奇怪的梦境 拓扑排序
- okhttp中的线程池及源码分析
- Spring Cloud微服务(6)之spring cloud config分布式配置中心
- Maven战笔记
- 七月英语总结——不离开便不会陌生
- 1165: 实数的小数部分(指针专题)