Hahapipi108的博客

实验四 数据库设计实验，包含一个模式7张基本表，详情参考博客。

数据库系统概论课程实验的代码，包括对于student-course-sc表的一系列查询操作，详情参加博客内容。

数据库系统概论课的实验代码，内有student-course-sc表建立的对应美容，更具体的内容参见博客。

每周一题之2 Mineweep（扫雷） 测试地址：https://vjudge.net/problem/UVA-10189 [问题描述] Have you ever played Minesweeper? It’s a cute little game which comes within a certain Operating System which name we can’t really remember. Well, the goal of the game is to find where are all the mines within a M × N field. To help you, the game shows a number in a square which tells you how many mines there are adjacent to that square. For instance, supose the following 4 × 4 field with 2 mines (which are represented by an ‘*’ character): *... .... .*.. .... If we would represent the same field placing the hint numbers described above, we would end up with: *100 2210 1*10 1110 As you may have already noticed, each square may have at most 8 adjacent squares. [输入] The input will consist of an arbitrary number of fields. The first line of each field contains two integers n and m (0 < n, m ≤ 100) which stands for the number of lines and columns of the field respectively. The next n lines contains exactly m characters and represent the field. Each safe square is represented by an ‘.’ character (without the quotes) and each mine square is represented by an ‘*’ character (also without the quotes). The first field line where n = m = 0 represents the end of input and should not be processed. [输出] 对于每对整数 i 和 j，按原来的顺序输出 i 和 j，然后输出二者之间的整数中的最大循环节长度。 这三个整数应该用单个空格隔开，且在同一行输出。对于读入的每一组数据，在输出中应位于单独的一行。 [样例输入] 4 4 *... .... .*.. .... 3 5 **... ..... .*... 0 0 [样例输出] Field #1: *100 2210 1*10 1110 Field #2: **100 33200 1*100 */

[问题描述] 考虑如下的序列生成算法：从整数 n 开始，如果 n 是偶数，把它除以 2；如果 n 是奇数，把它乘 3 加1。 用新得到的值重复上述步骤，直到 n = 1 时停止。例如，n = 22 时该算法生成的序列是： 22，11，34，17，52，26，13，40，20，10，5，16，8，4，2，1 人们猜想（没有得到证明）对于任意整数 n，该算法总能终止于 n = 1。这个猜想对于至少 1 000 000内的整数都是正确的。 对于给定的 n，该序列的元素（包括 1）个数被称为 n 的循环节长度。在上述例子中，22 的循环节长度为 16。 输入两个数 i 和 j，你的任务是计算 i 到 j（包含 i 和 j）之间的整数中，循环节长度的最大值。