hdu 1047 (big integer sum, fgets or scanf, make you func return useful infos)
2015-06-18 08:21
316 查看
errors made,
boundary conditions, <= vs < ,
decreasing vs increasing , ++, –,
‘0’/’1’ vs 0/1
prototype of sum, return the starting position of c-style string containing the sum, just like sprintf return number of characters successfully read.
and
have some similarities.
boundary conditions, <= vs < ,
decreasing vs increasing , ++, –,
‘0’/’1’ vs 0/1
prototype of sum, return the starting position of c-style string containing the sum, just like sprintf return number of characters successfully read.
[code]p1=sum(p1,p2);
and
[code]p=sprintf(p,"%09d",x);
have some similarities.
[code]#include <cstdio> #include <cstring> char* sum(char *to, char *from) { static const int charzero='0',oublecharzero='0'+'0'; int sz1=strlen(to), sz2=strlen(from), nszmax,nszmin, i,j, tmp,carry; if(sz1>=sz2) { nszmax=-sz2, nszmin=-sz1; } else { nszmax=-sz1, nszmin=-sz2; } to+=sz1, from+=sz2; for(carry=0,i=-1;i>=nszmax;--i) { tmp=carry+to[i]+from[i]-doublecharzero; to[i]=charzero+tmp%10; carry=tmp/10; } if(sz2>sz1) { for(j=i;j>=nszmin;--j) to[j]=from[j]; sz1=sz2; } if(carry) { for(j=i;j>=nszmin && to[j]=='9';--j) to[j]='0'; if(j<nszmin) { to[j]='1'; ++sz1; } else { ++to[j]; } } return to-sz1; } int main() { //freopen("input.txt","r",stdin); const int MAXSIZE=101; int ncase,i,j; char buf1[MAXSIZE+2]={0}, buf2[MAXSIZE+2]={0}, *p1,*p2; scanf("%d",&ncase); for(i=1;i<=ncase;++i) { p1=buf1+MAXSIZE, p2=buf2; p1[0]='0', p1[1]=0; while(scanf("%100s",p2)==1 && strcmp(p2,"0")!=0) { p1=sum(p1,p2); } puts(p1); if(i!=ncase) putchar('\n'); } return 0; }
相关文章推荐
- Android 进行单元测试难在哪-终
- jquery实战---标签页效果
- jquery实战---标签页效果
- C++实现快速排序
- QT编译遇到的初级问题整理 gnu-libstdc++\4.9\include\cstdlib:72: error: stdlib.h: No such file or directory
- mysql导入出现MySQL Error 1153 - Got a packet bigger than 'max_allowed_packet' bytes
- SQL SERVER 使用T-SQL还原Bak数据库到指定位置
- leetCode(9):Remove Nth Node From End of List
- leetCode(9):Remove Nth Node From End of List 分类: leetCode 2015-06-18 08:15 109人阅读 评论(0) 收藏
- 查询内存溢出
- Express 4 中如何使用connect-mongo
- 不可或缺 Windows Native (18) - C++: this 指针, 对象数组, 对象和指针, const 对象, const 指针和指向 const 对象的指针, const 对象的引用
- eclipse缓慢了么?
- 架构师速成3-开发者境界
- 架构师速成2.1-论成功
- leetCode(8):merge two sorted list
- IOS笔记051-手势使用
- 架构师速成2.1-论成功 分类: 架构师速成 2015-06-18 08:12 171人阅读 评论(0) 收藏
- 架构师速成3-开发者境界 分类: 架构师速成 2015-06-18 08:12 149人阅读 评论(0) 收藏
- leetCode(8):merge two sorted list 分类: leetCode 2015-06-18 08:12 136人阅读 评论(0) 收藏