题目描述
对于
a
a
a序列,有
- a [ 1 ] = 1 a[1]=1 a[1]=1
- a [ m ] = n a[m]=n a[m]=n
- a [ 1 ] < a [ 2 ] < ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ < a [ m − 1 ] < a [ m ] a[1]<a[2]<······<a[m-1]<a[m] a[1]<a[2]<⋅⋅⋅⋅⋅⋅<a[m−1]<a[m]
- 对于 ∀ k \forall k ∀k,都存在整数 i , j i,j i,j( 1 ≤ i , j ≤ k − 1 1≤i,j≤k-1 1≤i,j≤k−1, i i i和 j j j可以相等),使得 a [ k ] = a [ i ] + a [ j ] . a[k]=a[i]+a[j]. a[k]=a[i]+a[j].
求满足 n n n的最小整数 m m m的序列。
思路
迭代加深搜索,剪枝(1.排除等效冗杂,2.从大到小枚举
i
i
i,
j
j
j)
代码
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
int a[21],n;
int cnt;
bool check(int d)
{
if(d==cnt+1)
{
if(a[d-1]==n)
{
for(int i=1;i<=d-1;i++)printf("%d ",a[i]);
puts("");
return true;
}
return false;
}
bool v[110];memset(v,false,sizeof(v));
for(int i=d-1;i>=1;i--)
{
for(int j=i;j>=1;j--)
{
if(a[i]+a[j]<=a[d-1])break;
if(a[i]+a[j]>n)continue;
if(v[a[i]+a[j]])continue;
v[a[i]+a[j]]=true;a[d]=a[i]+a[j];
if(check(d+1))return true;
}
}
return false;
}
int main()
{
a[1]=1;
while(scanf("%d",&n)!=EOF)
{
if(!n)break;cnt=1;
while(!check(2))cnt++;
}
return 0;
}