某次不知名的转场训练（20190419）

A - Cooking Competition

 

"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.

Type	Feedback	Score Change (Kobayashi)	Score Change (Tohru)
1	Kobayashi cooks better	+1	0
2	Tohru cooks better	0	+1
3	Both of them are good at cooking	+1	+1
4	Both of them are bad at cooking	-1	-1

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.

代码：

#include<iostream>
#include<cstdio>
using namespace std;
int To,Ko;
int main()
{
    int t,n,s;
    cin>>t;
    while(t--)
    {
        cin>>n;
        Ko=0,To=0;
        for(int i=0; i<n; i++)
        {
            cin>>s;
            if(s==1)
            {
                Ko+=1;
                To+=0;
            }
            else if(s==2)
            {
                Ko+=0;
                To+=1;
            }
            else if(s==3)
            {
                Ko+=1;
                To+=1;
            }
            else if(s==4)
            {
                Ko-=1;
                To-=1;
            }
        }
        if(Ko<To)
        {
            cout<<"Tohru"<<endl;
        }
        else if(Ko==To)
        {
            cout<<"Draw"<<endl;
        }
        else if(Ko>To)
        {
            cout<<"Kobayashi"<<endl;
        }
    }
    return 0;
}

N - Sum Problem

Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge). 

In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n. 

Input

The input will consist of a series of integers n, one integer per line. 

Output

For each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer. 

Sample Input

1
100

Sample Output

1

5050

代码：

#include<iostream>
#include<cstdio>
using namespace std;
int main(){
    int n,sum=0;
    cin.tie(0);
    cout.tie(0);
    while(cin>>n){
        sum=0;
        for(int i=1;i<=n;i++){
            sum+=i;
        }
        cout<<sum<<endl;
        cout<<endl;
    }
    return 0;
}

B - Problem Preparation

It's time to prepare the problems for the 14th Zhejiang Provincial Collegiate Programming Contest! Almost all members of Zhejiang University programming contest problem setter team brainstorm and code day and night to catch the deadline, and empty bottles of Marjar Cola litter the floor almost everywhere!

To make matters worse, one of the team member fell ill just before the deadline. So you, a brilliant student, are found by the team leader Dai to help the team check the problems' arrangement.

Now you are given the difficulty score of all problems. Dai introduces you the rules of the arrangement:

1. The number of problems should lie between 10 and 13 (both inclusive).
2. The difficulty scores of the easiest problems (that is to say, the problems with the smallest difficulty scores) should be equal to 1.
3. At least two problems should have their difficulty scores equal to 1.
4. After sorting the problems by their difficulty scores in ascending order, the absolute value of the difference of the difficulty scores between two neighboring problems should be no larger than 2. BUT, if one of the two neighboring problems is the hardest problem, there is no limitation about the difference of the difficulty scores between them. The hardest problem is the problem with the largest difficulty score. It's guaranteed that there is exactly one hardest problem.

The team members have given you lots of possible arrangements. Please check whether these arrangements obey the rules or not.

Input

There are multiple test cases. The first line of the input is an integer T (1 ≤ T≤ 104), indicating the number of test cases. Then T test cases follow.

The first line of each test case contains one integer n (1 ≤ n ≤ 100), indicating the number of problems.

The next line contains n integers s1, s2, ... , sn (-1000 ≤ si ≤ 1000), indicating the difficulty score of each problem.

We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.

Output

For each test case, output "Yes" (without the quotes) if the arrangement follows the rules, otherwise output "No" (without the quotes).

Sample Input

8
9
1 2 3 4 5 6 7 8 9
10
1 2 3 4 5 6 7 8 9 10
11
999 1 1 2 3 4 5 6 7 8 9
11
999 1 3 5 7 9 11 13 17 19 21
10
15 1 13 17 1 7 9 5 3 11
13
1 1 1 1 1 1 1 1 1 1 1 1 2
10
2 3 4 5 6 7 8 9 10 11
10
15 1 13 3 6 5 4 7 1 14

Sample Output

No
No
Yes
No
Yes
Yes
No
No

Hint

The first arrangement has 9 problems only, which violates the first rule.

Only one problem in the second and the fourth arrangement has a difficulty score of 1, which violates the third rule.

The easiest problem in the seventh arrangement is a problem with a difficulty score of 2, which violates the second rule.

After sorting the problems of the eighth arrangement by their difficulty scores in ascending order, we can get the sequence 1, 1, 3, 4, 5, 6, 7, 13, 14, 15. We can easily discover that |13 - 7| = 6 > 2. As the problem with a difficulty score of 13 is not the hardest problem (the hardest problem in this arrangement is the problem with a difficulty score of 15), it violates the fourth rule.

 

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int t,n;
int a[105],b[105];
bool judge()
{
    if(n>13||n<10||a[1]!=1||a[2]!=1)
    {

        return false;
    }
    else
    {
        for(int i=2; i<n; i++){
            if(abs(a[i]-a[i-1])>2)
                return false;
        }
    }

        return true;
}
int main()
{

    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1; i<=n; i++)

            scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        judge();
        //printf("%d %d\n",a[1],a[2]);
        if(judge()==true)
        {
            printf("Yes\n");
        }
        else
        {
            printf("No\n");
        }


    }
    return 0;
}