Wastematerial的博客

Description a 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

Description Let's play maze game again! Maze problem is an old problem but here comes a challenge one. Max, an intelligent robot, is trapped in an N*M maze grid. He is located at a start position

Description Here, 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

Description King 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

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