杭电
MarioHo
有请各位多多教导
展开
-
杭电 1003 Max Sum (动态规划)
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 + 4 = 14. I...原创 2018-09-11 17:27:28 · 200 阅读 · 0 评论 -
hdu1018 Big Number(数学题)
题意:求n!的位数。思路:首先,一个数的位数 = (int)log10(n)+1。方法一:这个题变成求解 (int)log10(n!)+1。 因为loga(b*c)=loga(b)+loga(c),So...直接相加即可。代码:#include<iostream>#include<cmath>using names...原创 2018-09-12 11:57:56 · 216 阅读 · 0 评论 -
HDU1042 n!【大数+万进制】
N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 86835 Accepted Submission(s): 25542Problem DescriptionGiven an integer N(0 ≤ N ≤ 100...原创 2018-09-23 00:28:31 · 221 阅读 · 0 评论