poj2602——Superlong sums
2011-05-10 01:22
351 查看
果然恶心,用字符串输出才过得了...
#include<stdio.h> #define MAX 1000000 char a[2][MAX], sum[MAX]; int main() { int n, i; scanf("%d", &n); for(i=0; i<n; i++) { scanf("%d", &a[0][i]); scanf("%d", &a[1][i]); } bool flag=false; for(i=n-1; i>=0; i--) { sum[i]=a[0][i]+a[1][i]; if(flag) { sum[i]++; flag=false; } if(sum[i]>9) { sum[i]-=10; flag=true; } sum[i]+=48; } sum ='/0'; printf("%s/n",sum); return 0; }
相关文章推荐
- poj 2602 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
- POJ 2602 Superlong sums 大整数求和
- Poj2602 Superlong sums
- POJ 2602 Superlong sums (高精度,模拟,水题)
- POJ 2602|URAL 1048|Superlong Sums|高精度加法
- Poj OpenJudge 百练 2602 Superlong sums
- POJ2602-Superlong sums
- POJ 2602 Superlong sums G++
- Poj 2602 Superlong sums(大数相加)
- POJ 2602 Superlong sums(模拟大数加法)
- poj-2602-Superlong sums
- POJ2602-Superlong sums
- POJ 2602 Superlong sums
- Poj 2602 Superlong sums(大数相加)