HDOJ 2046:骨牌铺方格

#include <stdio.h> __int64 f[52]; void init(){ int i; f[1] = 1; f[2] = 2; f[3] = 3; for(i=4; i<=50; ++i) f[i] = f[i-1]+f[i-2]; } int main(){ int n; init(); while(scanf("%d", &n) != EOF) printf("%I64d/n", f[n]); return 0; }