01 2016 档案

poj 1787 Charlie's Change （多重背包可作完全背包）
摘要：Charlie's Change Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3792 Accepted: 1144 Description Charlie is a driver of Advanced Cargo Move 阅读全文
posted @ 2016-01-31 15:26 lucky_少哖 阅读(260) 评论(0) 推荐(0)
poj 3181 Dollar Dayz（完全背包）
摘要：Dollar Dayz Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5419 Accepted: 2054 Description Farmer John goes to Dollar Days at The Cow Stor 阅读全文
posted @ 2016-01-31 14:20 lucky_少哖 阅读(200) 评论(0) 推荐(0)
uva 147 Dollars
摘要：Dollars New Zealand currency consists of $100, $50, $20, $10, and $5 notes and $2, $1, 50c, 20c, 10c and 5c coins. Write a program that will determine 阅读全文
posted @ 2016-01-31 13:37 lucky_少哖 阅读(200) 评论(0) 推荐(0)
hdu 2069 Coin Change（完全背包）
摘要：Coin Change Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16592 Accepted Submission(s): 5656 Pr 阅读全文
posted @ 2016-01-30 16:13 lucky_少哖 阅读(339) 评论(0) 推荐(0)
hdu 1708 Fibonacci String
摘要：Fibonacci String Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5012 Accepted Submission(s): 169 阅读全文
posted @ 2016-01-28 13:49 lucky_少哖 阅读(266) 评论(0) 推荐(0)
hdu 1568 Fibonacci
摘要：Fibonacci Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4267 Accepted Submission(s): 1974 Probl 阅读全文
posted @ 2016-01-27 16:31 lucky_少哖 阅读(185) 评论(0) 推荐(0)
hdu 1316 How Many Fibs?
摘要：How Many Fibs? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5638 Accepted Submission(s): 2183 阅读全文
posted @ 2016-01-26 16:23 lucky_少哖 阅读(233) 评论(0) 推荐(0)
poj 1958 Strange Towers of Hanoi
摘要：Strange Towers of HanoiTime Limit:1000MSMemory Limit:30000KTotal Submissions:2678Accepted:1742DescriptionBackgroundCharlie Darkbrown sits in another o... 阅读全文
posted @ 2016-01-25 14:52 lucky_少哖 阅读(226) 评论(0) 推荐(0)
poj 3601Tower of Hanoi
摘要：Tower of HanoiTime Limit:1000MSMemory Limit:131072KTotal Submissions:1895Accepted:646DescriptionThe Tower of Hanoi is a puzzle consisting of three peg... 阅读全文
posted @ 2016-01-23 15:30 lucky_少哖 阅读(257) 评论(0) 推荐(0)
poj 3572 Hanoi Tower
摘要：Hanoi TowersTime Limit : 10000/5000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Special ... 阅读全文
posted @ 2016-01-22 15:53 lucky_少哖 阅读(356) 评论(0) 推荐(0)
poj 1920 Towers of Hanoi
摘要：Towers of HanoiTime Limit:3000MSMemory Limit:16000KTotal Submissions:2213Accepted:986Case Time Limit:1000MSDescriptionSurely you have already come acr... 阅读全文
posted @ 2016-01-22 15:18 lucky_少哖 阅读(463) 评论(0) 推荐(0)
hdu 1250 Hat's Fibonacci
摘要：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 阅读全文
posted @ 2016-01-21 16:39 lucky_少哖 阅读(179) 评论(0) 推荐(0)
zoj 2954 Hanoi Tower
摘要：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... 阅读全文
posted @ 2016-01-21 16:36 lucky_少哖 阅读(265) 评论(0) 推荐(0)
zoj 2338 The Towers of Hanoi Revisited
摘要：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... 阅读全文
posted @ 2016-01-20 16:46 lucky_少哖 阅读(284) 评论(0) 推荐(0)
zoj 1239 Hanoi Tower Troubles Again!
摘要：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... 阅读全文
posted @ 2016-01-19 14:28 lucky_少哖 阅读(414) 评论(0) 推荐(0)
zoj 1633 Big String
摘要：Big StringTime Limit: 2 Seconds Memory Limit: 65536 KBWe will construct an infinitely long string from two short strings: A = "^__^" (four characters)... 阅读全文
posted @ 2016-01-18 16:40 lucky_少哖 阅读(456) 评论(0) 推荐(0)
整数因子分解
摘要：大于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... 阅读全文
posted @ 2016-01-18 14:53 lucky_少哖 阅读(590) 评论(0) 推荐(0)
棋盘覆盖问题
摘要：在一个由2^k*2^k个方格组成的棋盘中，若恰有一个方格与其他方格不同，称该方格为特殊方格，且称该棋盘为特殊棋盘。输入输入有多组测试例。对每一个测试例有两行，第一行是k（1 2 #include 3 #include 4 using namespace std; 5 6 int board[1... 阅读全文
posted @ 2016-01-17 13:48 lucky_少哖 阅读(213) 评论(0) 推荐(0)
二分算法模板
摘要：//数组a[]中有n个元素，已经按升序排序，待查找的元素Xtemplate{ int BinarySearch(Type a[],const Type& x,int n) { int left = 0; ... 阅读全文
posted @ 2016-01-15 12:56 lucky_少哖 阅读(232) 评论(0) 推荐(0)