解题思路:
注意事项:
参考代码:
import java.util.Scanner;
public class A1115 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr1 = new int[n];
int[] arr2 = new int[n];
for (int i = 0; i < n; i++) {
arr1[i] = sc.nextInt();
arr2[i] = sc.nextInt();
}
for (int i = 0; i < n; i++) {
String[][] arrs = new String[arr1[i]][arr1[i] * arr2[i]];
for (int j = 0; j < arr2[i]; j++) {
if(j==0) {
for (int k = 0; k < arr1[i]; k++) {
for (int l = 0; l < arr1[i]; l++) {
if ((k == l || k == arr1[i] - l - 1) && k + 1 != arr1[i] / 2 + 1) {
arrs[k][l] = "X";
System.out.print(arrs[k][l]);
continue;
}
if (k + 1 == arr1[i] / 2 + 1) {
arrs[k][l] = " ";
arrs[k][k] = "X";
System.out.print(arrs[k][l]);
continue;
}
arrs[k][l] = " ";
System.out.print(arrs[k][l]);
}
System.out.println();
}
}else {
for (int k = 1; k < arr1[i]; k++) {
for (int l = 0; l < arr1[i]; l++) {
if ((k == l || k == arr1[i] - l - 1) && k + 1 != arr1[i] / 2 + 1) {
arrs[k][l] = "X";
System.out.print(arrs[k][l]);
continue;
}
if (k + 1 == arr1[i] / 2 + 1) {
arrs[k][l] = " ";
arrs[k][k] = "X";
System.out.print(arrs[k][l]);
continue;
}
arrs[k][l] = " ";
System.out.print(arrs[k][l]);
}
System.out.println();
}
}
}
System.out.println();
}
}
}
0.0分
0 人评分
2003年秋浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:780 |
C语言程序设计教程(第三版)课后习题7.1 (C语言代码)浏览:635 |
1124题解浏览:618 |
C语言程序设计教程(第三版)课后习题9.3 (C语言代码)浏览:647 |
排序算法(选择,插入,冒泡)浏览:870 |
C语言程序设计教程(第三版)课后习题5.4 (C语言代码)浏览:481 |
小O的数字 (C语言代码)浏览:1477 |
C语言程序设计教程(第三版)课后习题10.2 (C语言代码)浏览:556 |
简单的a+b (C语言代码)浏览:591 |
母牛的故事 (C语言代码)浏览:498 |