lucky_少哖

摘要： Hat's Fibonacci Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9677 Accepted Submission(s): 3210 阅读全文

摘要： Hanoi TowerTime Limit: 2 Seconds Memory Limit: 65536 KBYou all must know the puzzle named "The Towers of Hanoi". The puzzle has three pegs (peg 1, peg... 阅读全文

摘要： The Towers of Hanoi RevisitedTime Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeYou all must know the puzzle named ��The Towers of Hanoi��. The... 阅读全文

摘要： Hanoi Tower Troubles Again!Time Limit: 2 Seconds Memory Limit: 65536 KBPeople stopped moving discs from peg to peg after they know the number of steps... 阅读全文

摘要： Big StringTime Limit: 2 Seconds Memory Limit: 65536 KBWe will construct an infinitely long string from two short strings: A = "^__^" (four characters)... 阅读全文

摘要： 大于1的正整数n可以分解为： n=x1*x2*···*xm.例如，当n=12时，共有8种不同的分解式：12=1212=6*212=4*312=3*412=3*2*212=2*612=2*3*212=2*2*3对于给定的正整数n，编程计算n共有多少种不同的分解式。输入数据有多行， 给出正整数n（1 2... 阅读全文

摘要： 在一个由2^k*2^k个方格组成的棋盘中，若恰有一个方格与其他方格不同，称该方格为特殊方格，且称该棋盘为特殊棋盘。输入输入有多组测试例。对每一个测试例有两行，第一行是k（1 2 #include 3 #include 4 using namespace std; 5 6 int board[1... 阅读全文

摘要： //数组a[]中有n个元素，已经按升序排序，待查找的元素Xtemplate{ int BinarySearch(Type a[],const Type& x,int n) { int left = 0; ... 阅读全文

摘要： Buy the souvenirsTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1662Accepted Submission(s): 611P... 阅读全文

摘要： Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 4039Accepted Submission(s): 1677Pr... 阅读全文