![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
文章平均质量分 84
不爱算数的枕
这个作者很懒,什么都没留下…
展开
-
Multiple
Descriptiona program that, given a natural number N between 0 and 4999 (inclusively), and M distinct decimal digits X1, X2 ... XM (at least one), finds the smallest strictly positive multiple of原创 2015-05-13 14:54:49 · 880 阅读 · 0 评论 -
Maze, amazing
DescriptionLet's play maze game again! Maze problem is an old problem but here comes a challenge one. Max, an intelligent robot, is trapped in anN*M maze grid. He is located at a start position原创 2015-05-06 23:39:11 · 560 阅读 · 0 评论 -
Cleaning Robot
DescriptionHere, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.Consider the room floor paved with square tiles whose size fits the cleaning原创 2015-06-28 11:21:32 · 1822 阅读 · 0 评论 -
Beam me out!
DescriptionKing Remark, first of his name, is a benign ruler and every wrongdoer gets a second chance after repenting his crimes in the Great Maze!Today's delinquent is a renowned computer scien原创 2015-06-12 23:56:51 · 916 阅读 · 0 评论 -
算法设计例题:最大团(回溯、分枝限界)
Description给定无向图G=(V,E)。如果UV,且对任意u, v ∈ U 有 (u,v) ∈ E,则称U是G的完全子图。G的完全子图U是G的团,当且仅当U不包含在G的更大的完全子图中。G的最大团是指G中所含顶点数最多的团。Input输入的第一行为测试样例的个数T ,接下来有T个测试样例。每个测试样例的第一行是 顶点数n 和 边数m ( n ≤ 20,m ≤ 4原创 2016-11-15 16:59:23 · 4326 阅读 · 1 评论