next_permutation

1 2 3的全排列

#include <iostream>

#include <algorithm>
#include<cstdio>
using namespace std;

int main()
{
    int b[4]={0,1,2,3};
    for(int i=1;i<=6;i++)
    {
        for(int j=1;j<=3;j++)
            cout<<b[j]<<" ";
        cout<<endl;
        next_permutation(b+1,b+1+3);
    }

    cout<<endl;

    int c[3]={1,2,3};
    for(int i=1;i<=6;i++)
    {
        for(int j=0;j<3;j++)
        cout<<c[j]<<" ";
        cout<<endl;
        next_permutation(c,c+3);
    }
    return 0;
}