next_permutation习题练习

习题1：Backward Digit Sums

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<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n,sum,i;
    bool flag;
    int a[11],b[11][11];
    while(cin>>n>>sum)
    {
        flag=true;
        for(i=0; i<n; i++)
            a[i]=i+1;
        do
        {
            for(i=0; i<n; i++)
                b[0][i]=a[i];
            for(int j=1; j<n; j++){
                for(int k=0; k<n-j; k++)
                    b[j][k]=b[j-1][k]+b[j-1][k+1];
            }

            if(b[n-1][0]==sum){
                flag=false;
                for(i=0; i<n-1; i++)
                    cout<<a[i]<<" ";
                cout<<a[n-1]<<endl;
            }
            if(!flag)
                break;
        }
        while(next_permutation(a, a + n));
    }
    return 0;
}

习题2：Orders

Description

The stores manager has sorted all kinds of goods in an alphabetical order of their labels. All the kinds having labels starting with the same letter are stored in the same warehouse (i.e. in the same building) labelled with this letter. During the day the stores manager receives and books the orders of goods which are to be delivered from the store. Each order requires only one kind of goods. The stores manager processes the requests in the order of their booking. 

You know in advance all the orders which will have to be processed by the stores manager today, but you do not know their booking order. Compute all possible ways of the visits of warehouses for the stores manager to settle all the demands piece after piece during the day. 

Input

Input contains a single line with all labels of the requested goods (in random order). Each kind of goods is represented by the starting letter of its label. Only small letters of the English alphabet are used. The number of orders doesn't exceed 200. 

Output

Output will contain all possible orderings in which the stores manager may visit his warehouses. Every warehouse is represented by a single small letter of the English alphabet -- the starting letter of the label of the goods. Each ordering of warehouses is written in the output file only once on a separate line and all the lines containing orderings have to be sorted in an alphabetical order (see the example). No output will exceed 2 megabytes. 

Sample Input

bbjd

Sample Output

bbdj
bbjd
bdbj
bdjb
bjbd
bjdb
dbbj
dbjb
djbb
jbbd
jbdb
jdbb

题目大意：输入字符，按字母升序的全排列

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
    string s;
    while(cin>>s)
    {
        sort(s.begin(),s.end());
        do
        {
            for(int i=0;i<s.size();i++)
                cout<<s[i];
            cout<<endl;
        }while(next_permutation(s.begin(),s.end()));
    }
    return 0;
}