摘要：
Graveyard DesignTime Limit:10000MSMemory Limit:64000KTotal Submissions:4443Accepted:946Case Time Limit:2000MSDescriptionKing George has recently decided that he would like to have a new design for the royal graveyard. The graveyard must consist of several sections, each of which must be a square of 阅读全文
摘要：
Sum of Consecutive Prime NumbersTime Limit:1000MSMemory Limit:65536KTotal Submissions:17965Accepted:9871DescriptionSome positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 5 阅读全文
摘要：
Jessica's Reading ProblemTime Limit:1000MSMemory Limit:65536KTotal Submissions:6496Accepted:1998DescriptionJessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master 阅读全文
摘要：
SubsequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:7854Accepted:3021DescriptionA sequence of N positive integers (10 2 #include 3 #include 4 #include 5 6 using namespace std; 7 8 #define maxn 100005 9 10 int n;11 int a[maxn],s,sum[maxn];12 13 bool check(int x) {14 for(int... 阅读全文
摘要：
D. Minesweeper 1Dtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputGame "Minesweeper 1D" is played on a line of squares, the line's height is 1 square, the line's width isnsquares. Some of the squares contain bombs. If a square do 阅读全文