解题报告（全排列与stringstream）

1，

Now our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. But now the BEelzebub has to beat our hero first. feng5166 says, "I have three question for you, if you can work them out, I will release the Princess, or you will be my dinner, too." Ignatius says confidently, "OK, at last, I will save the Princess."

"Now I will show you the first problem." feng5166 says, "Given a sequence of number 1 to N, we define that 1,2,3...N-1,N is the smallest sequence among all the sequence which can be composed with number 1 to N(each number can be and should be use only once in this problem). So it's easy to see the second smallest sequence is 1,2,3...N,N-1. Now I will give you two numbers, N and M. You should tell me the Mth smallest sequence which is composed with number 1 to N. It's easy, isn't is? Hahahahaha......"
Can you help Ignatius to solve this problem?

Input

The input contains several test cases. Each test case consists of two numbers, N and M(1<=N<=1000, 1<=M<=10000). You may assume that there is always a sequence satisfied the BEelzebub's demand. The input is terminated by the end of file.

Output

For each test case, you only have to output the sequence satisfied the BEelzebub's demand. When output a sequence, you should print a space between two numbers, but do not output any spaces after the last number.

Sample Input             对从1到n进行排列，输出m 次变换后的结果

 

6 4
11 8

Sample Output

1 2 3 5 6 4
1 2 3 4 5 6 7 9 8 11 10

 对于0 1 2全排列顺序：0 1 2， 0 2 1，1 0 2，1 2 0， 2 0 1，2 1 0

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    int *a;
    while(cin>>n>>m)
    {
        a=new int[n];//在堆上分配大小为n的int数组并返回首地址
        for(int i=0;i<n;i++)
        a[i]=i+1;
        while(--m)//--m自身先减一与m--的区别
        next_permutation(a,a+n);
        cout<<a[0];
        for(int i=1;i<n;i++)
        cout<<" "<<a[i];
        cout<<endl;
    }
}

 

 2，

Ray又对数字的列产生了兴趣：
现有四张卡片，用这四张卡片能排列出很多不同的4位数，要求按从小到大的顺序输出这些4位数。

Input

每组数据占一行，代表四张卡片上的数字（0<=数字<=9），如果四张卡片都是0，则输入结束。

Output

对每组卡片按从小到大的顺序输出所有能由这四张卡片组成的4位数，千位数字相同的在同一行，同一行中每个四位数间用空格分隔。
每组输出数据间空一行，最后一组数据后面没有空行。

Sample Input

1 2 3 4
1 1 2 3
0 1 2 3
0 0 0 0

Sample Output

1234 1243 1324 1342 1423 1432
2134 2143 2314 2341 2413 2431
3124 3142 3214 3241 3412 3421
4123 4132 4213 4231 4312 4321

1123 1132 1213 1231 1312 1321
2113 2131 2311
3112 3121 3211

1023 1032 1203 1230 1302 1320
2013 2031 2103 2130 2301 2310
3012 3021 3102 3120 3201 3210

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int a[5],t=0;
    while(cin>>a[0]>>a[1]>>a[2]>>a[3])
	{
		if(a[0]==0 && a[1]==0 && a[2]==0 && a[3]==0)//结束条件，不能写连等
		break;
		if(t)//第一次t=0，不回车
		cout<<endl;
		t=1;
		int flag=1,s=0;
		do
		{
			if(a[0]==0)
			continue;
			if(flag){
			cout<<a[0]<<a[1]<<a[2]<<a[3];
			flag=0;}
			else if(s==a[0])
			cout<<" "<<a[0]<<a[1]<<a[2]<<a[3];
			else
			cout<<endl<<a[0]<<a[1]<<a[2]<<a[3];
			s=a[0];
			}while(next_permutation(a,a+4));
			cout<<endl;
			}
		}

 3，stringstream 类型转换

给定一个字符串，请将其中的所有数字串提取，并将每个数字串作为整数看待（假设可以用int 表示），按从小到大顺序输出结果，输出的整数之间以逗号间隔。如果没有数字，则输出0；例如：*1234.345#6781ad9jk81-11101?aght88ir09kp，其中的整数包括：1234，345，6781，9，81，11101，88，9，从小到大排序后，应该输出：
9，9，81，88，345，1234，6781，11101

输入

在一行内输入一串符号，长度不大于300。输入数据保证提取的整数不超过109。

输出

从小到大排序的整数序列，如果没有数字，则输出0；

样例输入

*1234.345#6781ad9jk81-11101?aght88ir09kp

样例输出

9,9,81,88,345,1234,6781,11101

 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s,st;
    int a[999],m;
    vector<string>v;
    bool f=0;
    cin>>s;
    for(int i=0;i<s.length();i++)
        if(isdigit(s[i]))//判断是否是数字
        f=1;
    else
        s[i]=' ';
    stringstream ss(s);
    while(ss>>st)//将单个字符转化为字符串遇到不是数字终止
        v.push_back(st);//将字符串放入向量
    for(int j=0;j<v.size();j++)
    {
        stringstream sc;
        sc<<v[j];//字符串转数据流
        sc>>a[j];//数据流转整型
    }
    m=v.size();
    sort(a,a+m);
    if(f==0)
        cout<<"0";
    else
    {
        cout<<a[0];
        for(int i=1;i<m;i++)
            cout<<','<<a[i];
    }
}