登 录
STL的next_permutation()求全排列
/*<br /> coder: ACboy<br /> date: 2010-3-19<br /> result: 1A<br /> description: UVa 10098 Generating Fast<br /> */</p> <p>#include <iostream><br /> #include <algorithm><br /> using namespace std;</p> <p>int main()<br /> {<br /> int n;<br /> char input[15];<br /> #ifndef ONLINE_JUDGE<br /> freopen("10098.txt", "r", stdin);<br /> #endif<br /> scanf("%d/n", &n);<br /> while (n--)<br /> {<br /> gets(input);<br /> int len = strlen(input);<br /> sort(input, input + len);</p> <p> do {<br /> cout << input << endl;<br /> } while (next_permutation(input, input + len));</p> <p> cout << endl;<br /> }<br /> }<br />
抱歉!评论已关闭.