http://acm.hit.edu.cn/hoj/problem/view?id=1496
计算不含有连续的1的二进制数个数
注意格式
#include <stdio.h>
#include <math.h>
int main()
{
int a[64];
int n,t,i;
for (i = 1; i <= 45; i++)
{
if (i <= 2)
{
a[i] = i+1;
continue;
}
a[i] = a[i-1] + a[i-2];
}
scanf("%d", &t);
for (i = 1; i <= t; i++)
{
scanf("%d", &n);
printf("Scenario #%d:\n%d\n\n", i, a[n]);
}
return 0;
}