![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
文章平均质量分 63
_H_X_
千里之行始于足下
展开
-
HDOJ1004(让气球升起)
Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 119675 Accepted Submission(s): 46901 Problem Description Contes原创 2017-05-03 19:57:59 · 1253 阅读 · 0 评论 -
HDOJ1002(大数相加)
A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 356833 Accepted Submission(s): 69210 Problem Description I have a v原创 2017-05-03 16:47:12 · 410 阅读 · 0 评论 -
HDOJ1003(最大连续子串)
Problem Description 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 +原创 2017-05-03 19:11:55 · 331 阅读 · 0 评论 -
HDOJ1005(周期计数)
Number Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 170883 Accepted Submission(s): 42157 Problem Description A number se原创 2017-05-03 21:52:09 · 315 阅读 · 0 评论 -
地大ACM
题目一: 输入一个n位的二进制串,将其转换为16进制(0….9 ABCDEF),计算转换后的二进制有多少个洞(0 一个洞,4,一个(陷阱呀,注意4有一个)…). AC代码:#include <iostream> #include <math.h> using namespace std; int fun(int i) { switch(i) { case 0: r原创 2017-05-05 20:22:20 · 1470 阅读 · 0 评论