![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM
zhu_wei_jian
这个作者很懒,什么都没留下…
展开
-
北大acm 1001 Exponentiation
#include #include #include using namespace std; void mul(int *c,int *a,int *b) //c=a*b { int i,j,k,carry,result; memset(c,0,sizeof(int)*126); for(j=0,carry=0;j {原创 2011-11-14 22:17:42 · 725 阅读 · 0 评论 -
子序列最大和(杭电acm1003)
Max Sum 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 + (原创 2012-03-25 21:50:14 · 4358 阅读 · 2 评论