POJ
文章平均质量分 87
jeffreylyg
这个作者很懒,什么都没留下…
展开
-
3070 Fibonacci(O(log n)求解 )
Fibonacci序列可由此公式求出: 3070 Fibonacci(O(log n)求解)"> 设a={1,1,1,0} 这样Fibonacci(n)可以由: a^n=a^(n/2)*a^(n/2) (n是偶数) a^n=a^((n-1)/2)*a^((n-1原创 2011-10-17 23:01:10 · 256 阅读 · 0 评论 -
1007 DNA Sorting
DNA Sorting Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 60694 Accepted: 23968 Description One measure of ``unsortedness'' in a sequence is the number原创 2011-12-18 16:27:42 · 414 阅读 · 0 评论 -
1113 Wall
Wall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20496 Accepted: 6725 Description Once upon a time there was a greedy King who ordered his chief Arch原创 2011-12-17 20:22:28 · 339 阅读 · 0 评论 -
1149 PIGS
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 10845 Accepted: 4751 Description Mirko works on a pig farm that consists of M locked pig-houses and原创 2011-12-14 00:31:09 · 426 阅读 · 0 评论 -
1135 Domino Effect
Domino Effect Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4646 Accepted: 1210 Description Did you know that you can use domino bones for other things原创 2011-12-06 12:54:38 · 283 阅读 · 0 评论 -
1300 Door Man
Door Man Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 1225 Accepted: 437 Description You are a butler in a large mansion. This mansion has so many roo原创 2011-10-18 17:23:40 · 283 阅读 · 0 评论 -
2299 Ultra-QuickSort
Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 24055 Accepted: 8603 Description In this problem, you have to analyze a particular sortin原创 2011-12-18 16:54:49 · 305 阅读 · 0 评论