湖心北斗

2013年7月11日

ZOJ Problem Set - 2110 Tempter of the Bone

摘要： ZOJ Problem Set - 2110Tempter of the BoneTime Limit: 2 Seconds Memory Limit:65536 KBThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and 阅读全文

posted @ 2013-07-11 21:11 湖心北斗阅读(162) 评论(0) 推荐(0)

ZOJ Problem Set - 1093 Monkey and Banana

摘要： ZOJ Problem Set - 1093Monkey and BananaTime Limit: 2 Seconds Memory Limit:65536 KBA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monkey is clever enoug 阅读全文

posted @ 2013-07-11 00:48 湖心北斗阅读(207) 评论(0) 推荐(0)

2013年7月9日

ZOJ Problem Set - 1076 Gene Assembly

摘要： ZOJ Problem Set - 1076Gene AssemblyTime Limit: 2 Seconds Memory Limit: 65536 KBStatement of the Problem With the large amount of genomic DNA sequence data being made available, it is becoming more important to find genes (parts of the genomic DNA which are responsible for the synthesis of proteins) 阅读全文

posted @ 2013-07-09 18:04 湖心北斗阅读(209) 评论(0) 推荐(0)

ZOJ Problem Set - 2109 FatMouse' Trade

摘要： ZOJ Problem Set - 2109FatMouse' TradeTime Limit: 2 Seconds Memory Limit: 65536 KBFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requ 阅读全文

posted @ 2013-07-09 16:59 湖心北斗阅读(125) 评论(0) 推荐(0)

ZOJ Problem Set - 1171 Sorting the Photos

摘要： ZOJ Problem Set - 1171Sorting the PhotosTime Limit: 2 Seconds Memory Limit: 65536 KBImagine you have a pile of 1 #include using namespace std; int main() { int cas; cin>>cas; while(cas--) { int n; cin>>n; char *pt=new char[n]; for(int i=0;i>pt[i]; char tag=pt[0]; int count=0; for(... 阅读全文

posted @ 2013-07-09 16:36 湖心北斗阅读(232) 评论(0) 推荐(0)

ZOJ Problem Set - 1029 Moving Tables

摘要： ZOJ Problem Set - 1029Moving TablesTime Limit: 2 Seconds Memory Limit: 65536 KBThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.The floor has 200 rooms each on the north side and south side along the corridor. Recently the Compa 阅读全文

posted @ 2013-07-09 16:00 湖心北斗阅读(174) 评论(0) 推荐(0)

ZOJ Problem Set - 1025 Wooden Sticks

摘要： ZOJ Problem Set - 1025Wooden SticksTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the m 阅读全文

posted @ 2013-07-09 15:16 湖心北斗阅读(135) 评论(0) 推荐(0)

ZOJ Problem Set - 1108 FatMouse's Speed

摘要： ZOJ Problem Set - 1108FatMouse's SpeedTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge FatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a collection of mice and put as large a subset of this data as possible into a sequenc 阅读全文

posted @ 2013-07-09 05:00 湖心北斗阅读(229) 评论(0) 推荐(0)

ZOJ Problem Set - 1016 parencodings

摘要： ZOJ Problem Set - 1016ParencodingsTime Limit: 2 Seconds Memory Limit: 65536 KBLet S = s1 s2 ... s2n be a well-formed string of parentheses. S can be encoded in two different ways:By an integer sequence P = p1 p2 ... pn where pi is the number of left parentheses before the ith right parenthesis in S 阅读全文

posted @ 2013-07-09 00:58 湖心北斗阅读(169) 评论(0) 推荐(0)

2013年7月8日

ZOJ Problem Set - 1009 Enigma

摘要： ZOJ Problem Set - 1009EnigmaTime Limit: 10 Seconds Memory Limit: 32768 KBIn World War II, Germany once used an electronic encryption machine called Enigma, which played a decisive role in the initial victories of Nazi Germany. It was proved to be one of the most reliable encryption systems in histor 阅读全文

posted @ 2013-07-08 21:53 湖心北斗阅读(198) 评论(0) 推荐(0)

公告