谭飞云


私信TA

用户名:tfy2020

访问量:563

签 名:

等  级
排  名 2653
经  验 2142
参赛次数 8
文章发表 3
年  龄 0
在职情况 学生
学  校 鄂州职业大学
专  业

  自我简介:

TA的其他文章

DNA题解(java)
浏览:105

解题思路:

注意事项:

参考代码:

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 人评分

  评论区