HDU
Df_cjc
这个作者很懒,什么都没留下…
展开
-
HDU1014
Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the form seed(x+1) = [seed(x) + STEP] % MOD where '%' is the modulus operator.原创 2017-12-11 18:22:22 · 246 阅读 · 0 评论 -
HDU1017
Given two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases! The first line of a multiple input is an integer N, then a blank l原创 2017-12-11 18:47:37 · 284 阅读 · 0 评论 -
HDU1019
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105. Input Inp原创 2017-12-11 19:57:48 · 313 阅读 · 2 评论 -
HDU1028
"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 equation like this:原创 2017-12-13 10:36:40 · 269 阅读 · 0 评论 -
HDU__1002A + B Problem II(大数加法)
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. Input The first line of the input contains an integer原创 2017-12-04 20:31:53 · 202 阅读 · 0 评论 -
HDU__1003Max Sum(最大连续子序列和)
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. I原创 2017-12-04 21:12:31 · 288 阅读 · 0 评论 -
HDU1005Number Sequence
A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the value of f(n). Input The input consists原创 2017-12-05 19:17:11 · 152 阅读 · 0 评论 -
HDU1072BFS与双重优先判断
这个题其实可以不用优先队列,虽然是以用时最少为首,但是没有打怪啥的,所以最短路径即最短用时。 其次我一直在想只用一个vis来判断走没走过,对于普通的BFS来说还行,但是这个有一个重置时间的装置,一旦时间重置了,我再回到我原来不能准时到达的路线上时,说不定就能准时到达了,所以我再进行搜索时,把地图的每一个一开始搜过的点所剩时间记录了下来,我如果想要重复搜索,那么我所剩余的时间一定得比地图上记录的时原创 2018-01-20 17:16:42 · 221 阅读 · 0 评论