ACM-水题
寻找星空的孩子
CSDN博客首页:http://blog.csdn.net/u010579068?viewmode=list
博客园地址:http://www.cnblogs.com/yuyixingkong/
展开
-
A. Kyoya and Photobooks(Codeforces Round #309 (Div. 2))
A. Kyoya and Photobooks Kyoya Ootori is selling photobooks of the Ouran High School Host Club. He has 26 photos, labeled "a" to "z", and he has compiled them into a photo booklet with some原创 2015-06-26 14:38:29 · 1241 阅读 · 1 评论 -
B. Ohana Cleans Up(Codeforces Round #309 (Div. 2))
B. Ohana Cleans Up Ohana Matsumae is trying to clean a room, which is divided up into an n by n grid of squares. Each square is initially either clean or dirty. Ohana can sweep her broom原创 2015-06-26 14:45:38 · 1013 阅读 · 1 评论 -
The shortest problem(hdu5373+11的倍数)
The shortest problem Problem Description In this problem, we should solve an interesting game. At first, we have an integer n, then we begin to make some funny change. We sum up every digit of the n, then insert it to the tail of the number n, then let the原创 2015-08-11 23:12:42 · 997 阅读 · 0 评论 -
不要62(hdu2089)
不要62 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15344 Accepted Submission(s): 4948 Problem Description 杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭原创 2013-12-09 21:55:49 · 931 阅读 · 0 评论 -
盐水的故事(hdu1408)
盐水的故事 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11672 Accepted Submission(s): 2809 Problem Description 挂盐水的时候,如果滴起来有规律,先是滴一滴,停一下;然原创 2015-03-23 11:27:16 · 645 阅读 · 0 评论 -
Destroy Tunnels(矩阵水题)
Destroy Tunnels Description Zuosige always has bad luck. Recently, he is in hospital because of pneu原创 2015-05-12 21:14:42 · 835 阅读 · 0 评论 -
A. Soldier and Bananas(CF546) Codeforces Round #304 (Div. 2)
A. Soldier and Bananas time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A soldier wants to buy w bananas in t原创 2015-06-18 16:59:07 · 912 阅读 · 0 评论 -
邂逅明下(巴什博弈+hdu2897)
H - 邂逅明下 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u 每行有三个数字n,p,q,表示一堆硬币一共有n枚,从这个硬币堆里取硬币,一次最少取p枚,最多q枚,如果剩下少于p枚就要一次取完。两人轮流取,直到堆里的硬币取完,最后一次取硬币的算输。对于每一行的三个数字,给出先取的人是否有必胜策略,如果有回答WIN,否则回答LOST。原创 2015-08-06 11:19:47 · 923 阅读 · 1 评论