Codeforces Round #139 (Div. 2) B. Well-known Numbers

B. Well-known Numbers

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Numbers k-bonacci (k is integer, k > 1) are a generalization of Fibonacci numbers and are determined as follows:

• F(k, n) = 0, for integer n, 1 ≤ n < k;
• F(k, k) = 1;
• F(k, n) = F(k, n - 1) + F(k, n - 2) + ... + F(k, n - k), for integer n, n > k.

Note that we determine the k-bonacci numbers, F(k, n), only for integer values of n and k.

You've got a number s, represent it as a sum of several (at least two) distinct k-bonacci numbers.

Input

The first line contains two integers s and k (1 ≤ s, k ≤ 109; k > 1).

Output

In the first line print an integer m (m ≥ 2) that shows how many numbers are in the found representation. In the second line print mdistinct integers a1, a2, ..., am. Each printed integer should be a k-bonacci number. The sum of printed integers must equal s.

It is guaranteed that the answer exists. If there are several possible answers, print any of them.

Sample test(s)

input

5 2

output

3
0 2 3

input

21 5

output

3
4 1 16

题意：给你一个特殊的二维变形斐波那契数组，输入s和k，求在第k行怎么才能用这个特殊的斐波那契数组组成s，求需要的数的个数，然后再把每个数单列出来。

 我的思路是先把第k行中小于s的枚举出来，然后由大到小依次遍历，有一点贪心的意思！

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int s,k,i,j;
int a[1000];
int main()
{

while(~scanf("%d%d",&s,&k))
  {
      memset(a,0,sizeof(a));
     a[0]=0;
     a[1]=1;
    for(i=2;;i++)
     {
         for(j=1;j<=k&&j<=i;j++)
           a[i]+=a[i-j];
           //cout<<a[i]<<"**"<<endl;
         if(a[i]>s) break;

     }

   int t=i,ans=0,n=s;
   for(i=t;i>0;i--)
     {
         if(n>=a[i])
        {
         //cout<<n<<"&&&";
            n-=a[i];
             ans++;
         }
     }
    printf("%d\n",ans+1);
     cout<<0;

   for(i=t;i>0;i--)
          if(s>=a[i])
           {
               s-=a[i];
         printf(" %d",a[i]);

      }
    cout<<endl;
  }
    return 0;
}