骨牌铺方格
Total Submission(s): 47725 Accepted Submission(s): 23042
例如n=3时,为2× 3方格,骨牌的铺放方案有三种,如下图:
1 3 2
1 3 2
#include <stdio.h>
int main ()
{
long long int n,i,j,a[51];
a[1]=1;a[2]=2;
for(i=3;i<=51;i++)
{
a[i]=a[i-1]+a[i-2];
}
while(scanf("%lld",&n)!=EOF)
{
printf("%lld\n",a[n]);
}
return 0;
}
#include <stdio.h>
int main()
{
int x, i, j;
long long int sum, time;
while (scanf ("%d", &x) != EOF)
{
sum = 0;
for (i = 1; i <= x / 2; i++)
{
time = 1;
for (j = 1; j <= i; j++)
time = time * (x - i - j + 1) / j;
sum += time;
}
printf ("%lld\n", sum + 1);
}
return 0;
}
7905



被折叠的 条评论
为什么被折叠?



