摘要:
Problem Description Aoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary ...
阅读全文
posted @ 2015-08-19 19:09
星斗万千
阅读(100)
推荐(0)
摘要:
Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。 Input 输入含有多组测试数据。 每组数据的第一行是两个正整数...
阅读全文
posted @ 2015-08-19 14:05
星斗万千
阅读(104)
推荐(0)
摘要:
Problem Description There are N robots standing on the ground (Don't know why. Don't know how). Suddenly the sky turns into gray, and lightning...
阅读全文
posted @ 2015-08-18 15:28
星斗万千
阅读(207)
推荐(0)
摘要:
Problem Description "Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship,...
阅读全文
posted @ 2015-08-17 15:47
星斗万千
阅读(224)
推荐(0)
摘要:
Problem Description 判断两序列是否为同一二叉搜索树序列 Input 开始一个数n,(1 #include #include #include #include #include using namespace std; int str1[1024],...
阅读全文
posted @ 2015-08-15 20:15
星斗万千
阅读(106)
推荐(0)
摘要:
Description Hardwoods are the botanical group of trees that have broad leaves, produce a fruit or nut, and generally go dormant in the winter. Ame...
阅读全文
posted @ 2015-08-15 19:39
星斗万千
阅读(160)
推荐(0)
摘要:
Problem Description 在图论中,树:任意两个顶点间有且只有一条路径的图。 生成树:包含了图中所有顶点的一种树。 最小生成树:对于连通的带权图(连通网)G,其生成树也是带权的。生成树T各边的权值总和称为该树的权,权最小的生成树称为G的最小生成树(Minimum Spanning...
阅读全文
posted @ 2015-08-15 16:55
星斗万千
阅读(129)
推荐(0)
摘要:
Description Windy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in such a way that: No two balls ...
阅读全文
posted @ 2015-08-15 15:45
星斗万千
阅读(120)
推荐(0)
摘要:
Description An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from sm...
阅读全文
posted @ 2015-08-14 11:25
星斗万千
阅读(145)
推荐(0)
摘要:
Problem Description Long long ago, there is a sequence A with length n. All numbers in this sequence is no smaller than 1 and no bigger than n, an...
阅读全文
posted @ 2015-08-13 10:52
星斗万千
阅读(143)
推荐(0)