hdu
竟然有人也叫Webwei
这个作者很懒,什么都没留下…
展开
-
hdu1016(dfs运用)素数环
Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12105 Accepted Submission(s): 5497 Problem Description A ring i原创 2016-11-02 22:28:13 · 406 阅读 · 0 评论 -
hdu1028
Problem Description "Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. "The second problem is, given an positive integer N, we define an原创 2016-11-16 14:26:22 · 201 阅读 · 0 评论 -
hdu1093 A+B for Input-Output Practice (V)
Problem Description Your task is to calculate the sum of some integers. Input Input contains an integer N in the first line, and then N lines follow. Each line starts with a integer M, and t原创 2016-11-16 23:28:43 · 314 阅读 · 0 评论 -
hdu1002
A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 322950 Accepted Submission(s): 62743原创 2016-10-19 21:37:12 · 305 阅读 · 0 评论 -
hdu6069 Counting Divisors && lightoj1028 - Trailing Zeroes (I)
由易到难:lightoj1028->hdu6069 lightoj1028 : http://www.lightoj.com/volume_showproblem.php?problem=1028 求一个数n,有多少种进制表示方法,使得末尾为0. 我们首先要想到这个n转化为其他进制如果末尾是0的话,只需要n可以整除这个数,换言之就是求n这个数在2-n范围内的约数。如果n很小的话(原创 2017-08-10 18:58:14 · 405 阅读 · 0 评论