【題解】ZeroJudge d436: 10098 – Generating Fast, Sorted Permutation

【題目敘述】https://zerojudge.tw/ShowProblem?problemid=d436
【解題想法】利用next_permutation( )

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int T;
	string s;
	cin >> T;
	while (T--){
		cin >> s;
		sort(s.begin(), s.end());
		cout << s << "\n";
		while (next_permutation(s.begin(), s.end())){
			cout << s << "\n";
		}
		cout << "\n";
	} 
    return 0;
}
分享本文 Share with friends