| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
我的代码 用STL 相当的好用阿,3546567_AC_47MS_320K#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
char str[201];
scanf("%s",str);
sort(str,str+(strlen(str)));
char *Beg = str;
char *End = str + strlen(str);
do{
printf("%s\n",str);
}while(next_permutation(Beg, End));
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator