NYOJ103A+B Problem II

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=103

纯模拟，没啥好说的 - -

#include <cstdio>
#include <cstring>
#include <algorithm>using namespace std;char s[1010];
char s1[1005];
int s2[1005];
int len_s;
int len_s1;void Reverse(char s[],int len){for(int i = 0,j = len - 1;i < j && i < len / 2;++i,--j){char t = s[i];s[i] = s[j];s[j] = t;}}
int main(){int cnt = 1;int _;scanf("%d",&_);while(_--){memset(s2,0,sizeof(s2));scanf("%s%s",s,s1);len_s = strlen(s);len_s1 = strlen(s1);printf("Case %d:\n",cnt++);printf("%s + %s = ",s,s1);Reverse(s,len_s);Reverse(s1,len_s1);//printf("%s %s\n",s,s1);int c = 0;int i;for(i = 0;i < min(len_s,len_s1);++i){s2[i] = (s[i] - '0' + s1[i] - '0' + c) % 10;//printf("%d %d %d %d\n",s[i] - '0',s1[i] - '0',s2[i],s[i] - '0' + s1[i] - '0' + c);c = (s[i] - '0'+ s1[i] - '0' + c) / 10;}while(i < len_s){s2[i] = (s[i]  - '0' + c) % 10;c = (s[i] - '0' + c) / 10;i++;}while(i < len_s1){s2[i] = (s1[i] - '0' + c) % 10;c = (s1[i] - '0' + c) / 10;i++;}while(c){s2[i++] = c % 10;c /= 10;}for(int j = i - 1;j >= 0;--j)printf("%d",s2[j]);printf("\n");}return 0;
}

NYOJ103A+B Problem II相关推荐

hdu A + B Problem II(大数相加，数组实现)
hdu A + B Problem II(大数相加,数组实现) 题目走起注意最后一个case 不需要换行下面代码 #include<stdio.h> #include<strin ...
HDU1002 Problem II(大数相加)（C++题解）
A题 HDOJ1002(大数加法) A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/327 ...
hdu1032 Train Problem II (卡特兰数)
题意: 给你一个数n,表示有n辆火车,编号从1到n,入站,问你有多少种出站的可能. (题于文末) 知识点: ps:百度百科的卡特兰数讲的不错,注意看其参考的博客. 卡特兰数(Catalan):前 ...
java棋盘问题_0x03大数问题（JAVA解决棋盘覆盖，A+B Problem II）
常见的有棋盘覆盖和A+B问题,这类问题牵扯到的数值都比较大,如果用一般的数值类型,肯定输出不了,所以就要想一个办法,怎么把大数转换一下输出. A+B Problem II 时间限制:3000 ms | ...
NYOJ 103 A+B Problem II
A+B Problem II 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 I have a very simple problem for you. Given tw ...
专题突破一之分块——Untitled Problem II，Balanced Lineup，[ioi2009]Regions
文章目录 SP2940 UNTITLE1 - Untitled Problem II source solution code Balanced Lineup source code Count on ...
hdu 1023 Train Problem II
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=1212 Train Problem II Description As we all know the ...
Train Problem II 卡特兰裸题（入门题）
Train Problem II 题目大意:给你一个数n,表示有n辆火车,编号从1到n,从远方驶过来,问你有多少种出站的可能. 解题思路:模拟栈的问题而已. 卡特兰问题. 1 import jav ...
HPU 1002 A + B Problem II【大数】
HPU 1002 A + B Problem II[大数] A + B Problem II Time Limit: 2000/1000 MS (Java/Others) Memory Limi ...

NYOJ103A+B Problem II

NYOJ103A+B Problem II相关推荐

最新文章

热门文章