摘要：
Problem Description 地理学家们经常要对一段河流进行测量分析。他们从上游开始向下游方向等距离地选择了n( 2 3 int ans,n,k,t; 4 int d[30005]; 5 int dp[30005][101]; 6 7 int main() { 8 scanf("%d",&t); 9 while(t--) { 10 sc... 阅读全文
摘要：
Problem Description In Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to the ... 阅读全文
摘要：
Problem Description Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she ty... 阅读全文
摘要：
Problem Description A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first ... 阅读全文
摘要：
Problem Description 搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度是和左... 阅读全文
摘要：
Problem Description Last year summer Max straveled to California for his vacation. He had a great time there: took many photos, visited famous universities, enjoyed beatiful beaches and tasted various... 阅读全文