-
-
7转投wapp.baidu.com界面果然简洁了许多
-
3果然猥琐的话题还是外文比较好
-
0贴吧十年，时光匆匆，再回首，白驹过隙一分钟。 那些褪色的青春梦，普通得不能再普通，玩贴吧的都懂。 贾君鹏，追贴，抢楼，往事如风，足迹不留空。 http://tieba.baidu.com/home/zuji
-
34
-
0
-
1转发贴子原贴已被删除
-
1
-
0
-
0
-
0
-
0转发贴子原贴已被删除
-
0看图就行。。。部分评论很无脑。。。原贴已被删除
-
0谈母子ML的可能性与必要性。。。原贴已被删除
-
0
-
0
-
0高级黑。。。原贴已被删除
-
0
-
0艾滋病连续11个月居广东传染病死因首位 广东省卫生厅昨天下午通报去年和今年1月份全省传染病疫情。去年全省共报告法定传染病669741例，死亡1137人，相比，发病率和死亡率分别上升了45.35%和1.80%。 值得注意的是，艾滋病从去年3月起，已连续11个月居全省传染病死因首位。 丙类传染病死亡率增一倍多 去年全省法定传染病报告发病率为694.90/10万，死亡率为1.18/10万，病死率为0.17%。其中，甲、乙类传染病共217002例，死亡1065人，发病率为225.15/10万，死亡
-
0
-
3总时间限制: 1000ms 内存限制: 65536kB 描述 Figure 1 Figure 1 shows a graphical representation of a binary tree of letters. People familiar with binary trees can skip over the definitions of a binary tree of letters, leaves of a binary tree, and a binary search tree of letters, and go right to The problem. A binary tree of letters may be one of two things: It may be empty. It may have a root node. A node has a letter as data and refers to a left and a right subtree. The left and right subtrees are also binary trees of letters. In the graphical representation of a binary tree of letter
-
0总时间限制: 1000ms 内存限制: 65536kB 描述 Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9 一个人可以从某个点滑向上下左右相邻四个点之一，当且仅当高度减小。在上面的例
-
2总时间限制: 1000ms 内存限制: 65536kB 描述 You are to write a program that has to generate all possible words from a given set of letters. Example: Given the word "abc", your program should - by exploring all different combination of the three letters - output the words "abc", "acb", "bac", "bca", "cab" and "cba". In the word taken from the input file, some letters may appear more than once. For a given word, your program should not produce the same word more than once, and the words should be output in alphabetically ascending order. 输入 The input consists of several words. The f
-
2总时间限制: 5000ms 内存限制: 65536kB 描述 You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment. That is, given an array a[1...n] of different integer numbers, your program must answer a series of questions Q(i, j, k) in the form: "What would be the k-th number in a[i...j] segment, if this segment was sorted?" For example, consider the array a = (1, 5, 2, 6, 3, 7, 4). Let the question be Q(2,
-
2总时间限制: 1000ms 内存限制: 65536kB 描述 热带岛屿Lagrishan的首领现在面临一个问题：几年前，一批外援资金被用于维护村落之间的道路，但日益繁茂的丛林无情的侵蚀着村民的道路，导致道路维修开销巨大，长老会不得不放弃部分道路的维护。上图左侧图显示的是正在使用道路的简图以及每条路每个月的维修费用（单位为aacms）。现在长老会需要提出一种方案，即需要保证村落之间都可以互相到达，又要将每个月的道路维修费用控制在最小。村子编号
-
1总时间限制: 1000ms 内存限制: 65536kB 描述 After going through the receipts from your car trip through Europe this summer, you realised that the gas prices varied between the cities you visited. Maybe you could have saved some money if you were a bit more clever about where you filled your fuel? To help other tourists (and save money yourself next time), you want to write a program for finding the cheapest way to travel between cities, filling your tank on the way. We assume that all cars use one unit of fuel per unit of distance, and start with an empty gas tank. 输入 The first li
-
4总时间限制: 1000ms 内存限制: 65536kB 描述 一个工厂制造的产品形状都是长方体，它们的高度都是h，长和宽都相等，一共有六个型号，他们的长宽分别为1*1, 2*2, 3*3, 4*4, 5*5, 6*6。这些产品通常使用一个 6*6*h 的长方体包裹包装然后邮寄给客户。因为邮费很贵，所以工厂要想方设法的减小每个订单运送时的包裹数量。他们很需要有一个好的程序帮他们解决这个问题从而节省费用。现在这个程序由你来设计。 输入 输入文件包括几行，每一行代表一个订单。每
-
3总时间限制: 4000ms 内存限制: 65536kB 描述 USTC campus network is a huge network. There is a bi-directional link between every pair of computers in the network. One of the computers is the BBS server, which is so popular that thousands of people log on it every day. Recently some links of the network are damaged by the rainstorm. The network administrator is going to check which computers are still connected with the BBS server directly or indirectly. You are to help the administrator to report the number of computers still connecting with the BBS server (not including itself). 输
-
1总时间限制: 3000ms 内存限制: 65536kB 描述 你旅游到了一个国外的城市。那里的人们说的外国语言你不能理解。不过幸运的是，你有一本词典可以帮助你。 输入 首先输入一个词典，词典中包含不超过100000个词条，每个词条占据一行。每一个词条包括一个英文单词和一个外语单词，两个单词之间用一个空格隔开。而且在词典中不会有某个外语单词出现超过两次。词典之后是一个空行，然后给出一个由外语单词组成的文档，文档不超过100000行，而且每行只
-
1总时间限制: 1000ms 内存限制: 65536kB 描述 Given a permutation of numbers from 1 to n, we can always get the sequence 1, 2, 3, ..., n by swap
-
2(1)已知第二维 Code-6 char (*a)[N];//指向数组的指针 a = new char[m][N]; printf("%d\n", sizeof(a));//4，指针 printf("%d\n", sizeof(a[0]));//N
-
2总时间限制: 1000ms 内存限制: 65536kB 描述 给定一棵二叉树的前序遍历和中序遍历的结果，求其后序遍历。 输入 输入可能有多组，以EOF结束。 每组输入
-
21慕尼黑爱乐。
-
2#include<stdio.h> struct Factstack{ int max; int t; int * a; }; Factstack * createEmptyStack_seq(int n){ Factstack * p=new Factstack;
-
6难道是失散多年的亲兄妹= =
-
6http://www.56.com/u11/v_MjU4ODk3MTc.html 是Lichtgestalt时期 情绪十分绝望 歌迷在莫斯科现场录制效果不算很好
-
52想念一个音乐学学位和哲学学位。
-
15考完就自杀吧…没有目标了…
-
4411月份 魔都 东艺 勃拉姆斯 50的票都没了…怎么办…TOT虽然看到曲目单有点不想去的说…
