2015年8月29日
摘要: TransformationsA square pattern of size N x N (1 #include using namespace std;const int maxn=11;int N;char before1[maxn][maxn],after1[maxn][maxn];bool... 阅读全文
posted @ 2015-08-29 08:51 ArcherCheng 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Milking CowsThree farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (mea... 阅读全文
posted @ 2015-08-29 06:20 ArcherCheng 阅读(244) 评论(0) 推荐(0) 编辑
摘要: Broken NecklaceYou have a necklace of N red, white, or blue beads (3#include using namespace std;const int maxn=355;int N;char beads[maxn];int calcula... 阅读全文
posted @ 2015-08-29 01:40 ArcherCheng 阅读(205) 评论(0) 推荐(0) 编辑
  2015年8月28日
摘要: Friday the ThirteenthIs Friday the 13th really an unusual event?That is, does the 13th of the month land on a Friday less often than on any other day ... 阅读全文
posted @ 2015-08-28 18:44 ArcherCheng 阅读(188) 评论(0) 推荐(0) 编辑
摘要: Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34729Accepted Submission(s): 153... 阅读全文
posted @ 2015-08-28 17:51 ArcherCheng 阅读(112) 评论(0) 推荐(0) 编辑
摘要: Greedy Gift GiversA group of NP (2 ≤ NP ≤ 10) uniquely named friends has decided to exchange gifts of money. Each of these friends might or might not ... 阅读全文
posted @ 2015-08-28 17:46 ArcherCheng 阅读(188) 评论(0) 推荐(0) 编辑
摘要: Your Ride Is HereIt is a well-known fact that behind every good comet is a UFO. These UFOs often come to collect loyal supporters from here on Earth. ... 阅读全文
posted @ 2015-08-28 13:04 ArcherCheng 阅读(179) 评论(0) 推荐(0) 编辑