| 网站首页 | 业界新闻 | 小组 | 威客 | 人才 | 下载频道 | 博客 | 代码贴 | 在线编程 | 编程论坛
欢迎加入我们,一同切磋技术
用户名:   
 
密 码:  
共有 1289 人关注过本帖
标题:一道ACM的题,请教各位?
取消只看楼主 加入收藏
ConZhang
Rank: 1
来 自:北京
等 级:新手上路
帖 子:282
专家分:0
注 册:2007-8-7
收藏
 问题点数:0 回复次数:4 
一道ACM的题,请教各位?

Tom and Jack are on the train. The journey is too dull so much so that both of them are eager to find a way to fritter away the time. Tom is a student of mathematics department. He proposes a funny game to play with Jack. First pile up N chips where 1<N<100000, then Jack takes away at most P=N-1 chips from the pile. After that, Tom takes away at most(or equals) Q=2*P chips from the pile. Then it turns to Jack again, he takes away at most(or equals) P=2*Q. Each time both of them have to take away at least 1 chip. In the same way, the process continues and who takes away the last chip wins the game. Jack knows there must be something tricky in the game, so he's decided to write a program to check whether there exists a win-strategy(no matter how many chips Tom takes away each time, Jack will win) for himself for a specific N. You know Jack is very good at programming, so solving this problem doesn't take him too much time. Do you know how he does?

Input Specification

The input consists of several lines, each of which consists of an integer N. The last line of the input is 0, which you shouldn't process.

Output Specification

For each N, you should output either YES or NO. If there exists a win-strategy for Jack, output YES. Otherwise output NO.

Sample Input

2
3
4
5
1000
0

Sample Output

NO
NO
YES
NO
YES
搜索更多相关主题的帖子: ACM pile chips Jack away 
2007-08-14 10:28
ConZhang
Rank: 1
来 自:北京
等 级:新手上路
帖 子:282
专家分:0
注 册:2007-8-7
收藏
得分:0 
8是不能赢的吧?
是不是这样?
2 no
3 no
5 no
8 no
是no的序列满足这样的a[n]=a[n-1]+a[n-2];
可是我不知道怎么证明啊?
请教!
2007-08-15 08:12
ConZhang
Rank: 1
来 自:北京
等 级:新手上路
帖 子:282
专家分:0
注 册:2007-8-7
收藏
得分:0 
以下是引用ConZhang在2007-8-15 8:12:18的发言:
8是不能赢的吧?
是不是这样?
2 no
3 no
5 no
8 no
是no的序列满足这样的a[n]=a[n-1]+a[n-2];
可是我不知道怎么证明啊?
请教!

那我说的对吧?怎么证明呢?

2007-08-15 10:22
ConZhang
Rank: 1
来 自:北京
等 级:新手上路
帖 子:282
专家分:0
注 册:2007-8-7
收藏
得分:0 

想了好几天了,还没有解决!

2007-08-19 15:17
ConZhang
Rank: 1
来 自:北京
等 级:新手上路
帖 子:282
专家分:0
注 册:2007-8-7
收藏
得分:0 
不行吧?结果很多啊,我推出一个公式,不知道对不对?
2007-08-19 17:05
快速回复:一道ACM的题,请教各位?
数据加载中...
 
   



关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.012361 second(s), 8 queries.
Copyright©2004-2024, BCCN.NET, All Rights Reserved