上一页 1 ··· 4 5 6 7 8 9 10 11 12 下一页
  2012年8月7日
摘要: Language:DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There is exactly one node, called the root, to which no directed edges point.Every node 阅读全文
posted @ 2012-08-07 13:42 crying_Dream 阅读(184) 评论(0) 推荐(0) 编辑
  2012年8月6日
摘要: Description There is a new revolution in the parking lot business: the parking tower. The concept is simple: you drive your car into the elevator at the entrance of the tower, and the elevator and conveyor belts drag the car to an empty parking spot, where the car remains until you pick it up. When 阅读全文
posted @ 2012-08-06 00:24 crying_Dream 阅读(236) 评论(0) 推荐(0) 编辑
摘要: Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road,or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships tha 阅读全文
posted @ 2012-08-06 00:16 crying_Dream 阅读(248) 评论(0) 推荐(0) 编辑
  2012年8月5日
摘要: Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述: 第一种说法是"1 X Y",表示X和Y是同类。 第二种说法是"2 X Y",表示X吃Y。 此人对N个动物,用上述两种说法,一句接一句地说出K句话,这K句话有的是真的,有的是假的。当一句话满足下列三条之一时,这句话就是假话,否则就是真话。 1) 当前的话与前面的某些真的话冲突,就是假话; 2) 阅读全文
posted @ 2012-08-05 11:23 crying_Dream 阅读(217) 评论(0) 推荐(0) 编辑
  2012年8月4日
摘要: DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong t 阅读全文
posted @ 2012-08-04 21:51 crying_Dream 阅读(413) 评论(0) 推荐(0) 编辑
  2012年8月3日
摘要: DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms.If the word is absent in the dictionary then it can be replaced by correct words ( 阅读全文
posted @ 2012-08-03 23:44 crying_Dream 阅读(288) 评论(0) 推荐(0) 编辑
摘要: Description 水神在赚了一笔钱之后,购买了一座庄园,做起了农场主,水神的农场都是靠栅栏围墙来分成很多部分并且围成外面的围墙的,但是最近一段时间,水神的庄园遭到了神兽的袭击,神兽撞破了很多处栅栏,这让水神非常苦恼,为了弄清楚自己的栅栏还有哪些地方时连着的,水神画了一张平面图,每一段栅栏在图上表示成一个线段,这些线段有的会相交,有的不会。 水神需要知道两段栅栏是否可以连起来。Input有多组输入数据,每组数据:第一行一个整数n表示水神农场的栅栏的个数(n<13)接下来n行,每行四个整数x1,y1,x2,y2分别表示栅栏的两个端点坐标然后下面若干行是对栅栏连接情况的询问,每行两个整数 阅读全文
posted @ 2012-08-03 00:22 crying_Dream 阅读(221) 评论(0) 推荐(0) 编辑
摘要: DescriptionDOTA是一个大学生中非常受欢迎的一款游戏,游戏中天灾军团和近卫军团一直处于对抗状态,如果近卫军团的世界之树或者天灾军团的冰封王座被摧毁,那么游戏会立即结束。游戏中最有意思的是就两个军团的基地内都有一个可以补充各自英雄能量的泉水。当然泉水不仅仅是一个能量补给站,而且还会很快杀死想靠近的敌方英雄。但是无论如何泉水奈何不了近卫军团的矮人狙击手,因为矮人狙击手的攻击范围要比泉水远很多。因此矮人狙击手甚至有能力拆掉一个泉水。有一个生命值不多的矮人狙击手要攻击天灾军团的泉水,这个猥琐的行为是天灾军团不能容忍的,天灾军团的英雄屠夫是在看不下去了,屠夫准备出马收拾这个狙击手。屠夫有一把 阅读全文
posted @ 2012-08-03 00:12 crying_Dream 阅读(337) 评论(0) 推荐(0) 编辑
  2012年7月31日
摘要: DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid. Fortunately, Bessie has a powerful weapo 阅读全文
posted @ 2012-07-31 23:23 crying_Dream 阅读(148) 评论(0) 推荐(0) 编辑
摘要: DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies simultaneously the conditions: every student in the committee represents a differ 阅读全文
posted @ 2012-07-31 23:19 crying_Dream 阅读(160) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 下一页