POJ 3187 Backward Digit Sums
Posted -citywall123
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了POJ 3187 Backward Digit Sums相关的知识,希望对你有一定的参考价值。
Backward Digit Sums
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10772 | Accepted: 6068 |
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:
Write a program to help FJ play the game and keep up with the cows.
3 1 2 4Behind 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.
4 3 6
7 9
16
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.
There are other possible sequences, such as 3 2 1 4, but 3 1 2 4 is the lexicographically smallest.
题意:输入n,m;用1~n个连续的整数,根据杨辉三角的性质,问最后的和为m的排列是什么,输出最小的排列
#include<iostream> #include<string.h> #include<string> #include<algorithm> #include<queue> using namespace std; int a[15],b[15]; int n,cnt,ans,sum; int main() while(cin>>n>>sum) for(int i=0;i<n;i++) a[i]=i+1; do for(int i=0;i<n;i++) b[i]=a[i]; for(int i=0;i<n-1;i++) for(int j=0;j+1<n;j++) b[j]=b[j+1]+b[j]; if(b[0]==sum) for(int i=0;i<n;i++) if(i==0) cout<<a[i]; else cout<<‘ ‘<<a[i]; cout<<endl; break; while(next_permutation(a,a+n));
以上是关于POJ 3187 Backward Digit Sums的主要内容,如果未能解决你的问题,请参考以下文章