题目描述
有1×n的一个长方形,用1×1、1×2和1×3的骨牌铺满方格,求共有多少种铺法。例如当n=3时为1×3的方格,此时用1×1、1×2和1×3的骨牌铺满方格,共有四种铺法。
输入格式
一行:n的值。(n<50)
输出格式
一行:共有多少种铺法。
输入输出样例
输入样例1:
3
输出样例1:
4
【耗时限制】1000ms 【内存限制】64MB
70分代码:
//
//Created by Carlgood.
//
//Note:This program is written in version DEV-C++ 5.11.
//Subject source:"hppt://oj.codingle.cn"
# include <iostream>
# include<cmath>
# include<string>
# include<cstring>
# include<cstdio>
# include<algorithm>
# include<sstream>
# define This_program_is_written_by_Carlgood_Programming_Studio 9876543210
using namespace std;
int a[60];
int main()
{
int n;
cin>>n;
a[1]=1;
a[2]=2;
a[3]=4;
for(int i=4;i<=50;i++)
{
a[i]=a[i-1]+a[i-2]+a[i-3];
}
cout<<a[n];
return 0;
}
看出来了吧,原因就是定义数组时定义的是int,这导致范围不够,超出范围的数会变成一个负数。
AC代码:
//
//Created by Carlgood.
//
//Note:This program is written in version DEV-C++ 5.11.
//Subject source:"hppt://oj.codingle.cn"
# include <iostream>
# include<cmath>
# include<string>
# include<cstring>
# include<cstdio>
# include<algorithm>
# include<sstream>
# define This_program_is_written_by_Carlgood_Programming_Studio 9876543210
using namespace std;
long long a[60];
int main()
{
int n;
cin>>n;
a[1]=1;
a[2]=2;
a[3]=4;
for(int i=4;i<=50;i++)
{
a[i]=a[i-1]+a[i-2]+a[i-3];
}
cout<<a[n];
return 0;
}