【Poj】-3128-Backward Digit Sums(组合数）

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

Bear1997

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

阅读量701

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/Bear1998/article/details/62429440

版权

数学专栏收录该内容

64 篇文章 0 订阅

订阅专栏

Backward Digit Sums

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7067		Accepted: 4102

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.

系数打表如图：

#include <cstdio>  
#include <algorithm>  
using namespace std;  
int c[44][44];  
void init() 
{  
    for(int i=0;i<=12;i++)
    	c[i][i]=1,c[i][0]=1;
    for(int i=1;i<=12;i++)
    {
    	for(int j=1;j<i;j++)
	    	c[i][j]=c[i-1][j-1]+c[i-1][j];		//表示a[i]前面的系数 
	}
}  
int main()  
{  
	init();
    int n,t; 
	int a[15];
	while(~scanf("%d%d",&n,&t))
	{
		for(int i=1;i<=n;i++)
			a[i]=i;
		do{
			int sum=0;
			for(int i=1;i<=n;i++) 
				sum+=a[i]*c[n-1][i-1];
			if(sum==t)
			{
				for(int i=1;i<n;i++)
					printf("%d ",a[i]);
				printf("%d\n",a[n]);
				break;
			}
		}while(next_permutation(a+1,a+1+n));	//全排列依次枚举 
	}
    return 0;  
}