摘要： Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13765 Accepted: 7232 Description Farmer John has purchased a lush new rectangul 阅读全文

摘要： Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of 阅读全文

摘要： Best Cow Line Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20226 Accepted: 5563 Description FJ is about to take his N (1 ≤ N ≤ 2,000) co 阅读全文

摘要： Ants Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 15617 Accepted: 6753 Description An army of ants walk on a horizontal pole of length l 阅读全文

摘要： Given integers, count the number of pairs of integers whose difference is . Given integers, count the number of pairs of integers whose difference is  阅读全文

摘要： For a given array A of N integers and a sequence S of N integers from the set {−1, 1}, we define val(A, S) as follows: val(A, S) = |sum{ A[i]*S[i] for 阅读全文

摘要： C. Modified GCD time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Well, here is another ma 阅读全文

摘要： 1018. Binary Apple Tree Time limit: 1.0 secondMemory limit: 64 MB Let's imagine how apple tree looks in binary computer world. You're right, it looks 阅读全文

摘要： Time limit : 2sec / Memory limit : 256MB Score : 500 points Problem Statement On an xy plane, in an area satisfying 0≤x≤W,0≤y≤H, there is one house at 阅读全文

摘要： Diophantus of Alexandria Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3210 Accepted Submission 阅读全文