即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

ZOJ Problem Set – 3958―Cooking Competition

编程语言 qq_37763006 33℃ 0评论
Time Limit: 1 Second      Memory Limit: 65536 KB
“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.


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
2
3
1 2 1
2
3 4
Sample Output
Kobayashi
Draw
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.
1、题意:n个人品尝两个人做的菜并打分,并按照上面的表格所规定的规则打分,最后得分高的赢,如果分数相等,则输出Draw。
2、思路:把两个人得分加起来比一比就行了。
3、代码:
#include
using namespace std;
int main()
{
int T,n,a,b,c;
cin>>T;
while(T--)
{
a=0;
b=0;
cin>>n;
while(n--)
    {
    cin>>c;
    if(c==1)
        a++;
    if(c==2)
        b++;
    }
if(a>b)
    cout<<"Kobayashi"<a)
    cout<<"Tohru"<

4、总结:这是签到题吧。





转载请注明:CodingBlog » ZOJ Problem Set – 3958―Cooking Competition

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情