摘要： Time Limit:7000MSMemory Limit:65536KTotal Submissions:34283Accepted:12295DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending orde 阅读全文

摘要： Time Limit:2000MSMemory Limit:32768KTotal Submissions:20754Accepted:10872DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 2 #include 3 #i 阅读全文

摘要： Time Limit:1000MSMemory Limit:10000KTotal Submissions:24354Accepted:8417DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D implies that A 2 #. 阅读全文

摘要： Time Limit:1000MSMemory Limit:65536KTotal Submissions:12323Accepted:6716DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 2 #include 3 int map[510][510]; 4 int link[510]; 5 int vis[510]; 6 int n; 7 bool dfs(int u) 8 { 9 int v;1... 阅读全文

摘要： Time Limit:1000MSMemory Limit:10000KTotal Submissions:32063Accepted:9080Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶球，那么只要5000金币就行了。"探险家就跑到大祭司那里，向他要求皮袄或水晶球，大祭司要他用金币来换，或者替他弄来其他的东西，他可以降低价格 阅读全文

摘要： Time Limit:1000MSMemory Limit:65536KTotal Submissions:6971Accepted:2345DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg individua 阅读全文

摘要： Time Limit:1000MSMemory Limit:30000KTotal Submissions:16456Accepted:5732DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can be several point 阅读全文

摘要： Time Limit:1000MSMemory Limit:65536KTotal Submissions:8120Accepted:3547DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their quest to find the exi 阅读全文

摘要： DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of these symbols obeying the following rules:p, q, r, s, and t are WFFsifwis a WFF, Nwis a WFF 阅读全文

摘要： Time Limit:1000MSMemory Limit:65536KTotal Submissions:25302Accepted:10918DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white 阅读全文