ural 2065. Different Sums

2065. Different Sums

Time limit: 1.0 second
Memory limit: 64 MB

Alex is a very serious mathematician and he likes to solve serious problems. For example, this problem.

You are to construct an array of n integers in which the amount of different integers is not less than k. Among all such arrays you have to construct the one with the minimal amount of different sums on non-empty subarrays. In other words, lets compute the sums of every non-empty subarray and remove repeating sums. You have to minimize the number of remaining sums.

Input

In the only line of input there are two integers n, k (1 ≤ k ≤ n ≤ 500), separated by a space.

Output

Print n integers separated by spaces — the answer for the problem. All the numbers must not be greater than 106 by absolute value. It is guaranteed that there exists an optimal solution with numbers up to 105 by absolute value. If there are multiple possible answers, you may print any of them.

Samples

input	output
1 1	-987654
3 2	0 7 0

Notes

Let’s take a closer look on the second sample. We will denote the sum on the segment [l,r] bysum(l,r) (elements are numbered starting with 1). sum(1, 1) = sum(3, 3) = 0, sum(1, 2) = sum(1, 3) =sum(2, 2) = sum(2, 3) = 7, so there are only two different sums.

Problem Author: Nikita Sivukhin (prepared by Alexey Danilyuk, Nikita Sivukhin)
Problem Source: Ural Regional School Programming Contest 2015

Tags: none  (

hide tags for unsolved problems

)

Difficulty: 195

 

题意：构造一个数列，使得它们的区间和的种类最少，其中数列中不同的数的数目不少于k

分析：

首先0对于答案无影响。

那么最少的就是类似这样的数列

...........3 -2 1 -1 2 -3......

 

/**
Create By yzx - stupidboy
*/
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <ctime>
#include <iomanip>
using namespace std;
typedef long long LL;
typedef double DB;
#define MIT (2147483647)
#define INF (1000000001)
#define MLL (1000000000000000001LL)
#define sz(x) ((int) (x).size())
#define clr(x, y) memset(x, y, sizeof(x))
#define puf push_front
#define pub push_back
#define pof pop_front
#define pob pop_back
#define mk make_pair

inline int getInt()
{
    int ret = 0;
    char ch = ' ';
    bool flag = 0;
    while(!(ch >= '0' && ch <= '9'))
    {
        if(ch == '-') flag ^= 1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9')
    {
        ret = ret * 10 + ch - '0';
        ch = getchar();
    }
    return flag ? -ret : ret;
}

int n, k;
deque<int> ans;

inline void input()
{
    cin >> n >> k;
    k--;
}

inline void solve()
{
    for(int i = 1; 2 * i <= k; i++)
        if(i & 1) ans.puf(-i), ans.pub(i);
        else ans.puf(i), ans.pub(-i);
    if(k & 1) ans.pub((((k / 2) & 1) ? -1 : 1) * (k / 2 + 1));
    for(int i = k / 2 + 1; i <= n; i++)
        ans.pub(0);
    for(int i = 0; i < n - 1; i++) cout << ans[i] << ' ';
    cout << ans[n - 1] << "\n";
}

int main()
{
    ios::sync_with_stdio(0);
    input();
    solve();
    return 0;
}