poj 2602 Superlong sums
2011-07-22 16:37
483 查看
#include <iostream> //水题,数据量很大,要用G++的getchar(),putchar(),scanf,printf超时 using namespace std; char str1[1000005],str2[1000005]; int main() { int n,i; scanf("%d ",&n); for(i=0;i<n;++i) { str1[i]=getchar();getchar(); str2[i]=getchar();getchar(); } for(i=n-1;i>=0;--i) { str1[i]+=str2[i]-48; if(str1[i]>57) str1[i]-=10,str1[i-1]++; } puts(str1); return 0; }
相关文章推荐
- POJ 2602|URAL 1048|Superlong Sums|高精度加法
- Poj OpenJudge 百练 2602 Superlong sums
- POJ2602-Superlong sums
- POJ 2602 Superlong sums G++
- Poj 2602 Superlong sums(大数相加)
- POJ2602-Superlong sums
- POJ 2602 Superlong sums
- Poj 2602 Superlong sums(大数相加)
- POJ 2602 Superlong sums(模拟大数加法)
- poj-2602-Superlong sums
- POJ 2602 Superlong sums(高精度)
- POJ2602-Superlong sums
- Poj 2602 Superlong sums(大数相加)
- poj2602——Superlong sums
- poj 大数 - 2602 Superlong sums
- poj 2602 Superlong sums
- poj2602 Superlong sums(高精度)
- POJ 2602 Superlong sums
- Poj OpenJudge 百练 2602 Superlong sums
- ACM篇:POJ2602--Superlong Sums