全排列（STL）

来源：互联网发布：fgo下载全部数据取消编辑：程序博客网时间：2024/06/03 15:59

#include <iostream>#include <algorithm>#include<stdio.h>#include<string.h>#include<stdlib.h>using namespace std;int n,m;void per(char* list, int length){    sort(list, list + length);    do    {        for(int i = 0; i < length; i++)        {            if(i == length-1)            {                cout << list[i];            }            else            {                cout << list[i] << " ";            }        }        cout << endl;    }while(next_permutation(list, list + length));}int main(){    char a[2100];    while(scanf("%d%d",&n,&m)!=EOF)    {        for(int i=0;i<n;i++)        {            a[i] = (i+1)+'0';        }        a[n] = '\0';        per(a,(int)strlen(a));    }    return 0;}

#include <iostream>#include <algorithm>#include <iterator>#include<stdio.h>#include<string.h>using namespace std;int a[1001];int n,m;int main(){    while(scanf("%d%d",&n,&m)!=EOF)    {        for(int i=0;i<n;i++)        {            a[i] = i+1;        }        do        {            for(int i=0;i<n;i++)            {                if(i == n-1)                {                    printf("%d\n",a[i]);                }                else                {                    printf("%d ",a[i]);                }            }        }        while( next_permutation(a,a+n));    }    return 0;}

0 0