POJ 3187 Backward Digit Sums

最新推荐文章于 2020-01-25 19:50:32 发布

B12040331

最新推荐文章于 2020-01-25 19:50:32 发布

阅读量847

点赞数

分类专栏： ACM_搜索那些年我们一起做过的ACM 文章标签： POJ 暴力

本文链接：https://blog.csdn.net/u010084308/article/details/37333199

版权

那些年我们一起做过的ACM 同时被 2 个专栏收录

108 篇文章 3 订阅

订阅专栏

ACM_搜索

17 篇文章 0 订阅

订阅专栏

链接：http://poj.org/problem?id=3187

题目：

Backward Digit Sums

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4133		Accepted: 2365

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

解题思路：

水题，枚举（1,2,3,..,n）的全排列，直到找到满足条件的序列为止，用next_permutation（）即可。

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MAXN = 12;
int a[MAXN], n, sum;

int main()
{
    while(~scanf("%d%d", &n, &sum))
    {
        for(int i = 0; i < n; i++)
        {
            a[i] = i + 1;
        }
        do
        {
            int b[MAXN], t = n - 1;
            memcpy(b, a, sizeof(a));
            while(t--)
            {
                for(int i = 0; i < n - 1; i++)
                {
                    b[i] = b[i] + b[i+1];
                }
            }
            if(sum == b[0])
            {
                int first = 1;
                for(int i = 0; i < n; i++)
                {
                    if(!first) printf(" ");
                    first = 0;
                    printf("%d", a[i]);
                }
                puts("");
                break;
            }
        }while(next_permutation(a, a + n));

    }
    return 0;
}