摘要：
Problem Description：f(n)=(∏i=1nin−i+1)%1000000007You are expected to write a program to calculate f(n) when a certain n is given.Input：Multi test case... 阅读全文
摘要：
Problem Description：John has several lines. The lines are covered on the X axis. Let A is a point which is covered by the most lines. John wants to kn... 阅读全文
摘要：
Problem Description：Here has an function:f(x)=|a∗x3+b∗x2+c∗x+d|(L≤x≤R)Please figure out the maximum result of f(x).Input：Multiple test cases(less than... 阅读全文
摘要：
Problem Description：One day, Dudu, the most clever boy, heard of ACM/ICPC, which is a very interesting game. He wants to take part in the game. But as... 阅读全文
摘要：
Problem Description：Consider the problem of tiling an n×n chessboard by polyomino pieces that are k×1 in size; Every one of the k pieces of each polyo... 阅读全文
摘要：
Problem Description：In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subseque... 阅读全文
摘要：
Problem Description:As we all know, Harry Porter learns magic at Hogwarts School. However, learning magical knowledge alone is insufficient to become ... 阅读全文
摘要：
Problem Description：You have an array consisting of n integers:a1=1,a2=2,a3=3,…,an=n. Then give you m operators, you should process all the operators ... 阅读全文
摘要：
Problem Description：We are all familiar with sorting algorithms: quick sort, merge sort, heap sort, insertion sort, selection sort, bubble sort, etc. ... 阅读全文
摘要：
Problem Description：npagodas were standing erect in Hong Jue Si between the Niushou Mountain and the Yuntai Mountain, labelled from1ton. However, only... 阅读全文