某种序列--大数加法

Problem 56: 某种序列

Time Limit:3 Ms|  Memory Limit:128 MB
Difficulty:2

Description

数列A满足An = An-1 + An-2 + An-3, n >= 3 
编写程序，给定A0, A1 和 A2, 计算A99

Input

输入包含多行数据 
每行数据包含3个整数A0, A1, A2 (0 <= A0, A1, A2 <= 100000000) 
数据以EOF结束

Output

对于输入的每一行输出A99的值

Sample Input

1 1 1

Sample Output

69087442470169316923566147

Source

water problem

某种序列：大数加法

#include<stdio.h>
#include<string.h>
#define Maxlen 1000


int result[110][1000];


int main(void)
{
int a, b, c, s, carry, i, j, k;
while(scanf("%d%d%d", &a, &b, &c) != EOF)
{
memset(result, 0, sizeof(result));
for(j = 0; a  != 0; j++)
{
result[1][j] = a % 10;
a /= 10;
}
for(j = 0; b ; j++)
{
result[2][j] = b % 10;
b /= 10;
}
for(j = 0; c ; j++)
{
result[3][j] = c % 10;
c /= 10;
}
i = 4;
while(i <= 100)
{
carry = 0;
for(j = 0; j < Maxlen; j++)
{
s = result[i - 1][j] + result[i - 2][j] + result[i - 3][j] + carry;
result[i][j] = s % 10;
printf("");
carry = s / 10;
}
i++;
}
for(j = Maxlen - 1; result[100][j] == 0; j--)
;
if(j < 0)
{
printf("0\n");
continue;
}
for(i = j; i >= 0; i--)
printf("%d", result[100][i]);
printf("\n");
}
return 0;
}