Game with Pearls
来源:互联网 发布:农村淘宝加盟申请 编辑:程序博客网 时间:2024/06/07 08:09
Tom and Jerry are playing a game with tubes and pearls. 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 number of 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 into each tube has to be either 0 or a positive multiple of K. After that Jerry organizes these tubes in the order that the first tube has exact one pearl, the 2nd tube has exact 2 pearls, …, the Nth tube 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 and initial 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 2 integers, N and K (1 <= N <= 100, 1 <= K <= N), and the second line contains N integers presenting the number of pearls in each tube. Output For each game, output a line containing either “Tom” or “Jerry”. Sample Input Sample Output
1) Tom and Jerry come up together with a number K.
2) Tom provides N tubes. Within each tube, there are several pearls. The number of 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 into each tube has to be either 0 or a positive multiple of K. After that Jerry organizes these tubes in the order that the first tube has exact one pearl, the 2nd tube has exact 2 pearls, …, the Nth tube 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 and initial number of pearls in each tube. If Tom wins the game, output “Tom”, otherwise, output “Jerry”.
2 5 1 1 2 3 4 5 6 2 1 2 3 4 5 5
Jerry Tom
题意:Jerry 和 Tom 玩一个游戏 , 给你 n 个盒子 , a[ i ] 表示开始时 ,第 i 个盒子中的小球的个数 。 然后 Jerry 可以在每个
盒子里加入 0 或 k的倍数的小球 , 操作完后,Jerry 可以重新排列 盒子的顺序,最终使 第 i 个盒子中有 i 个小球。 若Jerry能
使最终的盒子变成那样,就输出 “Jerry” ,否则 输出 “Tom” 。
#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int a[1000],b[1000];int main(){ int t; scanf("%d",&t); while(t--) { int n,m; memset(b,0,sizeof(b)); scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } int sum; int sum1; int p=0; for(int i=1;i<=n;i++) { sum1=0; sum=0; for(int j=1;j<=n;j++) { if((i-a[j])%m==0&&(i-a[j])>=0&&a[j]!=-1&&sum==0) { sum=1; a[j]=-1; } } if(sum==1) { continue; } else { p=1; } } if(p==0) { printf("Jerry\n"); } else { printf("Tom\n"); } }}
0 0
- D - Game with Pearls
- Game with Pearls
- D.Game with Pearls
- hdu 5090 Game with Pearls
- hdu 5090 Game with Pearls
- HDU 5090 Game with Pearls
- HDU 5090 Game with Pearls
- HDU 5090 - Game with Pearls
- HDU-5090--Game with Pearls
- HDU 5090 Game with Pearls
- HDU 5090 Game with Pearls
- 【二分匹配】 HDU 5090 Game with Pearls
- hdu 5090 Game with Pearls (二分匹配)
- HDU 5090 Game with Pearls(贪心)
- hdu 5090 Game with Pearls(水题)
- HDU5090 Game with Pearls(贪心)
- hdu 5090 Game with Pearls 贪心
- Hdu 5090 Game with Pearls(二分匹配)
- **MYSQL** 数据库注册表文件修改
- 【更新版】域名安全防护智能解析DNS+CDN免费产品
- iOS 10 的适配问题
- 类与类之间的关系
- mysql存储过程
- Game with Pearls
- UE4 解析json
- 【pylon笔记1】Qt+pylon的配置
- ssh-agent代理管理git私钥
- iOS 10.1.1开发IPv6 被拒
- 微信支付问题总结
- Vue中你不知道但却很实用的黑科技
- svn检出与运行
- 十四周OJ1数组逆序