알고리즘
[Java] SWEA - 숫자 배열 회전
J3SUNG
2023. 1. 12. 20:56
728x90
간단한 for문을 사용한 문제입니다.
import java.util.Scanner;
import java.io.FileInputStream;
class Solution
{
public static void main(String args[]) throws Exception
{
Scanner sc = new Scanner(System.in);
int T;
T=sc.nextInt();
for(int test_case = 1; test_case <= T; test_case++)
{
int n = sc.nextInt();
int[][] arr = new int[n][n];
for(int i=0; i<n; ++i){
for(int j=0; j<n; ++j){
arr[i][j]=sc.nextInt();
}
}
System.out.printf("#%d %n", test_case);
for(int i=0; i<n; ++i){
for(int j=0; j<n; ++j){
System.out.printf("%d", arr[n-j-1][i]);
}
System.out.printf(" ");
for(int j=0; j<n; ++j){
System.out.printf("%d", arr[n-i-1][n-j-1]);
}
System.out.printf(" ");
for(int j=0; j<n; ++j){
System.out.printf("%d", arr[j][n-i-1]);
}
System.out.printf("%n");
}
}
}
}