区域赛系列一多边形划分
时间限制:
1000 ms | 内存限制:
65535 KB
难度:
2
描述
-
Give you a convex(凸边形), diagonal n-3 disjoint divided into n-2 triangles(直线), for different number of methods, such as n=5, there are 5 kinds of partition method, as shown in Figure
输入
-
The first line of the input is a n (1<=n<=1000), expressed n data set.
The next n lines each behavior an integer m (3<=m<=18), namely the convex edges.
输出
-
For each give m,, output how many classification methods.
example output: Case #a : b
样例输入
-
3345
样例输出
-
Case #1 : 1Case #2 : 2Case #3 : 5
思路:卡特兰数,可以打表还可以递归。
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define maxn 1000005
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int h[1001];
int catalan(int n)
{
if(n<=1)
{
return 1;
}
else
{
h[0]=h[1]=1;
for(int i=2; i<=n; i++)//递归求卡特兰数
{
h[i]=0;
for(int j=0; j<i; j++)
{
h[i]+=(h[j]*h[i-1-j]);
}
}
return h[n];
}
}
int main()
{
int n;
scanf("%d",&n);
for(int p=1; p<=n; p++)
{
int m;
scanf("%d",&m);
printf("Case #%d : %d\n",p,catalan(m-2));
}
}
区域赛系列一多边形划分
时间限制:
1000 ms | 内存限制:
65535 KB
难度:
2
Give you a convex(凸边形), diagonal n-3 disjoint divided into n-2 triangles(直线), for different number of methods, such as n=5, there are 5 kinds of partition method, as shown in Figure
-
输入
-
The first line of the input is a n (1<=n<=1000), expressed n data set.
The next n lines each behavior an integer m (3<=m<=18), namely the convex edges.
输出
-
For each give m,, output how many classification methods.
example output: Case #a : b
样例输入
-
3345
样例输出
-
Case #1 : 1Case #2 : 2Case #3 : 5
思路:卡特兰数,可以打表还可以递归。
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define maxn 1000005
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int h[1001];
int catalan(int n)
{
if(n<=1)
{
return 1;
}
else
{
h[0]=h[1]=1;
for(int i=2; i<=n; i++)//递归求卡特兰数
{
h[i]=0;
for(int j=0; j<i; j++)
{
h[i]+=(h[j]*h[i-1-j]);
}
}
return h[n];
}
}
int main()
{
int n;
scanf("%d",&n);
for(int p=1; p<=n; p++)
{
int m;
scanf("%d",&m);
printf("Case #%d : %d\n",p,catalan(m-2));
}
}