POJ 3187 Backward Digit Sums

Backward Digit Sums

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6338		Accepted: 3667

Description

FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. They repeat this until only a single number is left. For example, one instance of the game (when N=4) might go like this:

    3   1   2   4

      4   3   6

        7   9

         16

Behind FJ's back, the cows have started playing a more difficult game, in which they try to determine the starting sequence from only the final total and the number N. Unfortunately, the game is a bit above FJ's mental arithmetic capabilities.

Write a program to help FJ play the game and keep up with the cows.

Input

Line 1: Two space-separated integers: N and the final sum.

Output

Line 1: An ordering of the integers 1..N that leads to the given sum. If there are multiple solutions, choose the one that is lexicographically least, i.e., that puts smaller numbers first.

Sample Input

4 16

Sample Output

3 1 2 4

Hint

Explanation of the sample:

There are other possible sequences, such as 3 2 1 4, but 3 1 2 4 is the lexicographically smallest.

Source

USACO 2006 February Gold & Silver

 

#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <functional>
#include <string>
#include <cstring>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define IOS ios_base::sync_with_stdio(false)
#define TIE std::cin.tie(0)
#define MIN2(a,b) (a<b?a:b)
#define MIN3(a,b) (a<b?(a<c?a:c):(b<c?b:c))
#define MAX2(a,b) (a>b?a:b)
#define MAX3(a,b,c)  (a>b?(a>c?a:c):(b>c?b:c))
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 0x3f3f3f3f;
const double PI = 4.0*atan(1.0);

int n, m, a[15],b[15];
void solve()
{
    for (int i = 1; i <= n; i++)
        a[i] = i;
    do{
        for (int i = 1; i <= n; i++)
            b[i] = a[i];
        for (int i = n-1; i > 0; i--)
            for (int j = 1; j <= i; j++)
                b[j] = b[j] + b[j + 1];
        if (b[1] == m){
            for (int i = 1; i < n; i++)
                printf("%d ", a[i]);
            printf("%d
", a[n]);
            return;
        }
    } while (next_permutation(a + 1, a + n + 1));
}
int main()
{
    while (scanf("%d%d", &n, &m) == 2){
        solve();
    }
}