POJ 2602 Superlong sums
2007-05-16 20:27
363 查看
大数加法
#include<stdio.h>
#define MAX 1000000
int a[2][MAX], sum[MAX];
int main()
{
int n, i, k=0, m;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &a[0][i]);
scanf("%d", &a[1][i]);
}
for(i=n-1; i>=0; i--)
{
m = a[0][i] + a[1][i] + k;
sum[i] = m % 10;
k = m / 10;
}
for(i=0; i<n; i++)
{
printf("%d", sum[i]);
}
printf("/n");
return 0;
}
#include<stdio.h>
#define MAX 1000000
int a[2][MAX], sum[MAX];
int main()
{
int n, i, k=0, m;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &a[0][i]);
scanf("%d", &a[1][i]);
}
for(i=n-1; i>=0; i--)
{
m = a[0][i] + a[1][i] + k;
sum[i] = m % 10;
k = m / 10;
}
for(i=0; i<n; i++)
{
printf("%d", sum[i]);
}
printf("/n");
return 0;
}
相关文章推荐
- Poj OpenJudge 百练 2602 Superlong sums
- POJ 2602 Superlong sums(高精度)
- POJ 2602 Superlong sums (高精度,模拟,水题)
- POJ 2602 Superlong sums G++
- POJ 2602 Superlong sums
- POJ 2602 Superlong sums 大整数求和
- poj 2602 Superlong sums
- Poj2602 Superlong sums
- POJ2602-Superlong sums
- Poj OpenJudge 百练 2602 Superlong sums
- POJ 2602|URAL 1048|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
- ACM篇:POJ2602--Superlong Sums
- Poj 2602 Superlong sums(大数相加)