![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HDU
文章平均质量分 61
ColorlessSilver
这个作者很懒,什么都没留下…
展开
-
HDU1001
#include using namespace std; int main() { int temp; while (cin >> temp) { int sum = 0; for (int j = 1; j { sum += j; } cout cout } return 0; }原创 2014-12-08 12:23:01 · 358 阅读 · 0 评论 -
HDU1000
#include using namespace std; int main1() { int a, b; while (cin >> a >> b) { cout << a + b << endl; } return 0; }原创 2014-12-08 12:21:57 · 483 阅读 · 0 评论 -
HDU1004
Problem Description Contest 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 the contest i原创 2014-12-08 12:27:43 · 503 阅读 · 0 评论 -
HDU1005
Problem Description 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). Inpu原创 2014-12-14 19:18:51 · 430 阅读 · 0 评论 -
HDU1008
Elevator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 46455 Accepted Submission(s): 25601 Problem Description The highest building in原创 2014-12-14 19:20:21 · 283 阅读 · 0 评论 -
HDU1012
u Calculate e Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 32294 Accepted Submission(s): 14471 Problem Description A simple mathemati原创 2014-12-14 19:21:55 · 1084 阅读 · 0 评论 -
HDU1013
Digital Roots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 51621 Accepted Submission(s): 16091 Problem Description The digital root o原创 2014-12-14 19:23:17 · 543 阅读 · 0 评论