题目链接

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";
    }
}

相关文章:

  • 2021-09-10
  • 2021-06-17
  • 2022-12-23
  • 2022-01-15
  • 2022-12-23
  • 2021-09-30
  • 2021-12-19
  • 2021-07-09
猜你喜欢
  • 2021-11-21
  • 2022-12-23
  • 2021-11-02
  • 2022-03-01
  • 2021-09-07
  • 2021-11-16
  • 2022-03-06
相关资源
相似解决方案