Let us consider an undirected graph G = <V, E> which has N vertices and M edges. Incidence matrix of this graph is an N × M matrix A = {aij}, such that aij is 1 if i-th vert……继续阅读 »
第四度
10年前 (2010-09-01) 207浏览 0评论
0个赞
Heavy Transportation
Time Limit: 3000MS
Memory Limit: 30000K
Total Submissions: 5123
Accepted: 1393
Description
Background Hugo Heavy is happy. After the breakdown of ……继续阅读 »
第四度
10年前 (2010-09-01) 196浏览 0评论
0个赞
Blocks
Time Limit: 1000MS
–
Memory Limit: 65536K
Total Submissions: 720
Accepted: 201
Description
Panda has received an assignment of painting a line of blocks. Si……继续阅读 »
第四度
10年前 (2010-08-31) 212浏览 0评论
0个赞
Euclid\’s Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4525 Accepted: 1849 Description
Two players, Stan and Ollie, play, starting with two natural number……继续阅读 »
第四度
10年前 (2010-08-29) 218浏览 0评论
0个赞
Rank List
Time Limit: 10000MS
Memory Limit: 65536K
Total Submissions: 6561
Accepted: 2091
Description
Li Ming is a good student. He always asks the teacher about his r……继续阅读 »
第四度
10年前 (2010-08-28) 311浏览 0评论
0个赞
Binary Stirling Numbers
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 1040
Accepted: 346
Description
The Stirling number of the second kind S(n, m) stands ……继续阅读 »
第四度
10年前 (2010-08-28) 189浏览 0评论
0个赞
Matrix Multiplication
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 11924
Accepted: 2408
Description
You are given three n × n matrices A, B and C. Does t……继续阅读 »
第四度
10年前 (2010-08-27) 271浏览 0评论
0个赞
Mobile phones
Time Limit: 5000MS
Memory Limit: 65536K
Total Submissions: 7087
Accepted: 3030
Description
Suppose that the fourth generation mobile phone base stations ……继续阅读 »
第四度
10年前 (2010-08-27) 179浏览 0评论
0个赞
给定一棵二叉树的先序和中序遍历,求其后序遍历.
先序遍历是先访问根,再遍历左子树,最后遍历右子树,中序遍历是先遍历左子树,再访问根,最后遍历右子树.因而由先序遍历可以确定根,由中序遍历确定左右子树,再在先序遍历中找到对应子树,找到左右子树的根…递归下去,最终确定树的各个节点相对位置,也就找到了树的后序遍历.
D / / B E / / A C ……继续阅读 »
第四度
10年前 (2010-08-25) 188浏览 0评论
0个赞
Cipher Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12776 Accepted: 3194
Description Bob and Alice started to use a brand-new encoding scheme. Surprisingly it is not……继续阅读 »
第四度
10年前 (2010-08-25) 199浏览 0评论
0个赞
