SXISZERO

摘要： 2007/2008 ACM International Collegiate Programming ContestUniversity of Ulm Local ContestProblem F: Frequent valuesYou are given a sequence ofninteger... 阅读全文

摘要： A very big corporation is developing its corporative network. In the beginning each of the N enterprises of the corporation, numerated from 1 to N, or... 阅读全文

摘要： Balanced LineupTime Limit:5000MSMemory Limit:65536KTotal Submissions:34306Accepted:16137Case Time Limit:2000MSDescriptionFor the daily milking, Farmer... 阅读全文

摘要： A secret service developed a new kind of explosive that attain its volatile property only when a specicassociation of products occurs. Each product i... 阅读全文

摘要： B. Kuriyama Mirai's Stonestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKuriyama Mirai has kil... 阅读全文

摘要： A. Kitahara Haruki's Gifttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKitahara Haruki has boug... 阅读全文

摘要： B. Shower Linetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMany students live in a dormitory. ... 阅读全文

摘要： A. Black Squaretime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputQuite recently, a very smart stude... 阅读全文

摘要： Maze ExplorationA maze of rectangular rooms is represented on a two dimensional grid as illustrated in figure 1a. Each point of the grid is represente... 阅读全文

摘要： 八皇后Description会下国际象棋的人都很清楚：皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将8个皇后放在棋盘上（有8 * 8个方格），使它们谁也不能被吃掉！这就是著名的八皇后问题。对于某个满足要求的8皇后的摆放方法，定义一个皇后串a与之对应，即a=b1b2...b8，其中bi为相应摆... 阅读全文