[C++]순열

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() { 	
	string str = "123"; 
    sort(str.begin(), str.end());
    do {
        for (int i = 1; i <= str.size(); ++i) {
            int n = stoi(str.substr(0, i));
            cout << n << endl; 	
        } 
    }while (next_permutation(str.begin(), str.end())); 	

    return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

1
12
123
1
13
132
2
21
213
2
23
231
3
31
312
3
32
321