北航2008复试上机。

1.素数

输入一个整数，要求输出所有从1到这个整数之间个位为1的素数，如果没有则输出-1（30分）





2.旋转矩阵



任意输入两个9阶以下矩阵，要求判断第二个是否是第一个的旋转矩阵，如果是，输出旋转角度（0、90、180、270），如果不是，输出-1。

要求先输入矩阵阶数，然后输入两个矩阵，每行两个数之间可以用任意个空格分隔。行之间用回车分隔，两个矩阵间用任意的回车分隔。（60分）



3.字符串匹配



从string.in中读入数据，然后用户输入一个短字符串。要求查找string.in中和短字符串的所有匹配，输出行号、匹配字符串到string.out文件中。匹配时不区分大小写，并且可以有一个用中括号表示的模式匹配。如“aa[123]bb”，就是说aa1bb、aa2bb、aa3bb都算匹配。（60分）-Northern retest the 2008 machine. 1 Enter an integer prime numbers, the required output from all the prime numbers between 1 to the integer bit is 1 if there is no output-1 (30 points) 2. Rotation matrix arbitrary input two 9-order following matrix, requiring judgment first two if the first rotation matrix, if it is, the output rotation angle (0,90,180,270), if not, outputs-1. Asked to enter the matrix of the order, and then enter the two matrices can be separated by a space between any two numbers in each row. Separated by a carriage return between the lines, separated by a carriage return between two arbitrary matrix. (60 points) 3. String.in string matching reads from the data, and then the user enters a short string. Find string.in requirements and all matches in the output line number of short strings match string to string.out file. When the match is not case sensitive, and can have a matching pattern indicated in parentheses. Such as " aa [123] bb" , that is to say aa1bb