- 博客(3)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 全排列
#include#include#include#includechar pt[1000] ;void swap(char* a, char* b){char tmp = *a ;*a = *b ;*b = tmp ;}int IsSame(char* str, int start, int end){int i ;for(i = s
2015-09-03 16:31:59
235
原创 文章标题
incudeincludeincludeincludedefien Max 10000char pt[Max] ;void swap(char* a, char* b){ char tmp = *a ; *a = *b ; *b = tmp ; }int IsSame(char str[], int start, int end){ int i ;
2015-09-03 16:30:34
251
原创 hdu 1381
Problem DescriptionMany people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the numbe
2015-05-27 14:09:35
364
1
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人