2014年12月18日
HDUOJ - 1316 How Many Fibs?
摘要： How Many Fibs? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4592 Accepted Submission(... 阅读全文
posted @ 2014-12-18 23:41 Popco 阅读(216) 评论(0) 推荐(0)
HDUOJ - 1063 / POJ - 1001 Exponentiation
摘要： Exponentiation Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7275 Accepted Submission(s... 阅读全文
posted @ 2014-12-18 22:58 Popco 阅读(125) 评论(0) 推荐(0)
HDUOJ - 1047 Integer Inquiry
摘要： Integer Inquiry Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13470 Accepted Submissio... 阅读全文
posted @ 2014-12-18 22:09 Popco 阅读(240) 评论(0) 推荐(0)
浅谈生成全排列的4种方法
摘要： 方法一：最简单的方法，直接使用STL中的next_permutation函数生成排列 #include using namespace std;int main(){ char res[] = "ABCD"; do{ puts(res); }while(next... 阅读全文
posted @ 2014-12-18 16:40 Popco 阅读(828) 评论(0) 推荐(0)