![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
hdu Online Judge
文章平均质量分 61
成功捕捉楼上
这个作者很懒,什么都没留下…
展开
-
Problem - 1001 Sum Problem
不出意外应该是被这道题耍了!!!下意识的代码#include int main ( ){ int n, sum = 0; while ( (scanf("%d",&n) ) != EOF ) { sum = n /2 * ( n + 1 ) ; printf("%d\n\n",sum ) ; } return 0原创 2017-07-20 12:42:29 · 225 阅读 · 0 评论 -
1014.Uniform Generator
原题描述:Problem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere原创 2017-08-19 10:43:16 · 171 阅读 · 0 评论 -
1013.Digital Roots
原题描述:Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the原创 2017-08-18 10:03:47 · 792 阅读 · 0 评论 -
1012.u Calculate e
原题描述:Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small value原创 2017-08-18 09:05:39 · 163 阅读 · 0 评论 -
1005.Number Sequence
原题描述:Problem DescriptionA 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(原创 2017-08-17 12:11:48 · 190 阅读 · 0 评论 -
1004.Let the Balloon Rise
原题描述:Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When原创 2017-08-17 10:25:44 · 131 阅读 · 0 评论 -
Problem - 1034 Candy Sharing Game
原题描述如下Problem DescriptionA number of students sit in a circle facing their teacher in the center. Each student initially has an even number of pieces of candy. When the teacher blows a whist原创 2017-07-20 09:34:05 · 170 阅读 · 0 评论 -
Problem - 1021 Fibonacci Again
很典型的Fibonacci 数列的问题问题描述如下Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequen原创 2017-07-19 15:25:23 · 219 阅读 · 0 评论 -
Problem - 1028 Ignatius and the Princess III
题目描述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, w原创 2017-07-21 13:47:38 · 359 阅读 · 0 评论 -
Problem - 1018 Big Number
原题描述Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this prob原创 2017-07-19 14:34:03 · 311 阅读 · 0 评论 -
A + B Problem
Problem DescriptionCalculate A + B. InputEach line will contain two integers A and B. Process to end of file. OutputFor each case, output A + B in one line.原创 2017-07-17 12:27:12 · 109 阅读 · 0 评论 -
Problem - 1008 Elevator
可以说是非常愚蠢了,看错题之后又提交了n次才成功。原题说明链接 http://acm.hdu.edu.cn/showproblem.php?pid=1008一开始没看到第一个数字是表示数目,纠结了半天看不懂样例输出尴尬。看了网上的教程也直接注意到 原来继续停留在同一楼层要+5s。算是提前知道了吧。第一次提交的代码#include int main( ){ int a原创 2017-07-17 14:51:53 · 190 阅读 · 0 评论 -
Problem - 1002 A + B Problem II
很尴尬的一道题。。。原题描述如下Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of the i原创 2017-07-20 13:58:24 · 134 阅读 · 0 评论 -
1017.A Mathematical Curiosity
原题描述:Problem DescriptionGiven 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 i原创 2017-08-19 11:38:01 · 166 阅读 · 0 评论