原创 CF 457C Elections 解題報告(線段樹)
C. Elections time limit per test 2 seconds memory limit per test 256 megabytes input standard input output s
原创 HDU 4919 Exclusive or 解題報告(規律+大數)
Exclusive or Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s)
原创 HDU 4893 Wow! Such Sequence! 解題報告(線段樹)
Wow! Such Sequence! Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submissi
原创 UVa 269 Counting Patterns 解題報告(暴力)
UVa上看不到題目了,可以在UVa Live上或者VJudge上看題目。這裏貼個: Counting Patterns Time Limit: 3000MS Memory Limit: Unknown 64bit
原创 HDU 4891 The Great Pan 解題報告(水題)
The Great Pan Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s):
原创 Uva 311 - Packets 解題報告(貪心)
Packets A factory produces products packed in square packets of the same height h and of the sizes , , , , ,
原创 UVa 225 - Golygons 解題報告(暴力)
Golygons Imagine a country whose cities have all their streets laid out in a regular grid. Now suppose that a touri
原创 UVa 669 - Defragment 解題報告(暴力)
Defragment You are taking part in the development of a ``New Generation'' operating system and the NG file system.
原创 HDU 4913 Least common multiple 解題報告(線段樹)
Least common multiple Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Subm
原创 UVa 165 - Stamps 解題報告(暴力)
Stamps The government of Nova Mareterrania requires that various legal documents have stamps attached to them so t
原创 CF 453B Little Pony and Harmony Chest 解題報告(狀態壓縮DP)
B. Little Pony and Harmony Chest time limit per test 4 seconds memory limit per test 256 megabytes input
原创 HDU 4944 FSF’s game 解題報告(遞推)
FSF’s game Time Limit: 9000/4500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 7
原创 HDU 4906 Our happy ending 解題報告(遞推)
Our happy ending Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submissi
原创 UVa 812 - Trade on Verweggistan 解題報告(枚舉)
Trade on Verweggistan Since the days of Peter Stuyvesant and Abel Tasman, Dutch merchants have been traveling a
原创 UVa 140 - BandWidth 解題報告(暴力)
Bandwidth Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the ele