标签：hdu1250

Hat‘s Fibonacci

100

4203968145672990846840663646


Note:
No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.

#include <stdio.h>
#include <string.h>

#define mod 1000000000

int arr[10001][230];

void Add(int i, int j) {
	for(int k = 0; k < 230; ++k) {
		arr[i][k] += arr[j][k];
		if(arr[i][k] >= mod) {
			arr[i][k] -= mod;
			++arr[i][k+1];
		}
	}
}

int main() {
	int i, j, n;
	for(i = 1; i < 5; ++i)
		arr[i][0] = 1;
	for(i = 5; i < 10001; ++i) {
		for(j = i - 4; j < i; ++j)
			Add(i, j);
	}
	while(scanf("%d", &n) == 1) {
		for(j = 229; ; --j)
			if(arr[n][j]) {
				printf("%d", arr[n][j]);
				break;
			}
		for(--j; j >= 0; --j)
			printf("%09d", arr[n][j]);
		printf("\n");
	}
	return 0;
}

HDU1250 Hat's Fibonacci 【亿进制】

标签：hdu1250

原文地址：http://blog.csdn.net/chang_mu/article/details/40304835