HDU 5090 - Game with Pearls

Problem Description

Tom and Jerry are playing a game with tubes andpearls. The rule of the game is:

1) Tom and Jerry come up together with a number K. 

2) Tom provides N tubes. Within each tube, there are several pearls. The numberof pearls in each tube is at least 1 and at most N. 

3) Jerry puts some more pearls into each tube. The number of pearls put intoeach tube has to be either 0 or a positive multiple of K. After that Jerryorganizes these tubes in the order that the first tube has exact one pearl, the2nd tube has exact 2 pearls, …, the Nthtube has exact N pearls.

4) If Jerry succeeds, he wins the game, otherwise Tom wins. 

Write a program to determine who wins the game according to a given N, K andinitial number of pearls in each tube. If Tom wins the game, output “Tom”, otherwise, output “Jerry”.

 

 

Input

The first line contains an integer M(M<=500), then M games follow. For each game, the first line contains 2integers, N and K (1 <= N <= 100, 1 <= K <= N), and the second linecontains N integers presenting the number of pearls in each tube.

 

 

Output

For each game, output a line containing either “Tom” or “Jerry”.

 

 

Sample Input

2

5 1

1 2 3 4 5

6 2

1 2 3 4 5 5

 

 

Sample Output

Jerry

Tom

 

思路：

从小到大排，每次小的+k后重新排

代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;


int main()
{
	int n, k;
	int a[105];
	int m;
	scanf("%d", &m);
	while (m--)
	{
		memset(a, 0, sizeof(a));
		scanf("%d%d", &n, &k);
		int i;

		bool flag = true;
		for (i = 0; i<n; i++)
		{
			scanf("%d", &a[i]);
		}

		for (i = 0; i<n;)
		{
			sort(a, a + n);
			if (i + 1<a[i])
			{
				flag = false;
				break;
			}
			else
				if (a[i] == i + 1)
				{
					i++;
					continue;
				}
				else
					a[i] += k;
		}

		if (flag)
			printf("Jerry\n");
		else
			printf("Tom\n");
	}

	return 0;
}