题目: Description In Fuzhou, there is a crazy super man. He can’t fly, but he could jump from housetop to housetop. Today he plans to use N houses to hone his house hopping skills. He will start at the shortest house and make N-1 jumps, with each jump…

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3044    Accepted Submission(s): 1275 Problem Description In Fuzhou, there is a crazy super man. He can’t fly, but he could jump from housetop to h…

House Man Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2889    Accepted Submission(s): 1212 Problem Description In Fuzhou, there is a crazy super man. He can’t fly, but he could jump from hou…

In Fuzhou, there is a crazy super man. He can’t fly, but he could jump from housetop to housetop. Today he plans to use N houses to hone his house hopping skills. He will start at the shortest house and make N-1 jumps, with each jump taking him to a…

House Man Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2056    Accepted Submission(s): 811 Problem Description In Fuzhou, there is a crazy super man. He can’t fly, but he could jump from hou…

第一题:太鼓达人:BZOJ3033 题意:给出k,求一个最长的M位01串,使其从每一个位置向后走k个得到 的M个k位01串互不相同(最后一个和第一个相邻,即是一个环).输出 字典序最小的答案. 2 ≤ k ≤ 11. 结论+爆搜: 第二问我们将每个k二进制数看成一个点,在它后面加上0/1就能得 到两个新数,我们从这个数向两个新数连边,于是这就变成了求一个欧 拉回路的问题.显然此题是存在欧拉回路的第一问答案为2的k次方 ,第二问暴力求欧拉回路即可. 发现sjh的注释很详细,所以贿赂搞来了一个满满注…