《&找规律》
文章平均质量分 57
Always_OL
眉毛上的汗水和眉毛下的泪水你必须选择一样
展开
-
hdu-4607-Park Visit
Park Visit Problem Description Claire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, indeed. N feature spots in the park are connected by exactly (N-1) undirected paths, and Claire is too tired to visit原创 2013-07-26 12:07:02 · 847 阅读 · 0 评论 -
hdu-4602-Partition
Partition Define f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have 4=1+1+1+1 4=1+1+2 4=1+2+1 4=2+1+1 4=1+3 4=2+2 4=3+1 4=4 totally 8 ways. Actually, we will have f(n)=2(n原创 2013-07-26 10:37:23 · 574 阅读 · 0 评论 -
nyoj-636-世界末日
世界末日 世界末日马上就要来临了,当然,每个人都想买到船票,但是由于船票有限,因此需要回答对一个问题才能买票。问题是这样的:给你一个数n (1 <= n <= 10000),之后给n个正整数 (<= 10000),问在这n个数中是否存在一些数的和是n的倍数。 输入 多组测试数据(最多100组)。首先输入一个数n,然后输入n个数。 输出 如果能找到一些数的和是n的倍数,输出"YES",否则输出"NO"。原创 2013-07-17 18:36:06 · 643 阅读 · 0 评论 -
nyoj-699-Sawthooth II
Sawthooth II 题目连接:Click Here----- 描述 There is a romantic line called sawthooth II which consists of two parallel infinite half-lines joined by a straight segment. It looks like a character ‘Z’. You原创 2013-07-27 18:37:35 · 801 阅读 · 0 评论 -
nyoj-734-奇数阶魔方
奇数阶魔方 时间限制:1000 ms | 内存限制:65535 KB 难度:3 描述 一个 n 阶方阵的元素是1,2,...,n^2,它的每行,每列和2条对角线上元素的和相等,这样的方阵叫魔方。n为奇数时我们有1种构造方法,叫做“右上方” ,例如下面给出n=3,5,7时的魔方. 3 8 1 6 3 5 7 4 9 2 5 17 24 1 8 15原创 2013-07-09 11:13:17 · 645 阅读 · 0 评论 -
hdu-4611-Balls Rearrangement
Problem Description Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily, he puts the ball numbered x into the box numbered a if x = a mod A. Some day Bob buys B new boxes, and h原创 2013-07-27 16:58:47 · 525 阅读 · 0 评论 -
nyoj-84-阶乘的0
阶乘的0 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 计算n!的十进制表示最后有多少个0 输入 第一行输入一个整数N表示测试数据的组数(1 每组测试数据占一行,都只有一个整数M(0 输出 输出M的阶乘的十进制表示中最后0的个数 比如5!=12原创 2013-07-12 10:51:04 · 576 阅读 · 0 评论