UVa 900 Brick Wall Patterns

無所不在的費波納西數列。

/**
* UVa 900 Brick Wall Patterns
* Last Modified: 2009.11.27
* Author: chchwy
*/
#include<cstdio>
int main()
{
long long int fib[51];
fib[0] = fib[1] = 1;
for (int i = 2; i <= 50; ++i)
fib[i] = fib[i - 1] + fib[i - 2];
int in;
while (scanf("%d", &in) == 1)
{
if (in == 0)
break;
printf("%lld\n", fib[in]);
}
return 0;
}
view raw 900.cpp hosted with ❤ by GitHub

留言

這個網誌中的熱門文章

UVa 10125 Sumsets

讀書心得: 撒哈拉的故事

讀書心得: 你以為你以為的就是你以為的嗎?