SWEA 1961 숫자 배열 회전

1 개요

SWEA 1961 숫자 배열 회전

• SW Expert Academy 1961번 문제
• SWEA D2
• 참고: 함수 rotatedMatrix270()

2 C++

#include <iostream>
using namespace std;
int main() {
    int T;
    scanf("%d", &T);
    int N;
    int a[7][7];
    for(int tc=1; tc<=T; tc++) {
        scanf("%d", &N);
        for(int i=0; i<N; i++) {
            for(int j=0; j<N; j++) scanf("%d", &a[i][j]);
        }
        printf("#%d\n", tc);
        for(int i=0; i<N; i++) {
            for(int j=0; j<N; j++) printf("%d",a[N-1-j][i]);
            printf(" ");
            for(int j=0; j<N; j++) printf("%d",a[N-1-i][N-1-j]);
            printf(" ");
            for(int j=0; j<N; j++) printf("%d",a[j][N-1-i]);
            printf("\n");
        }
    }
}

3 Java

import java.util.Scanner;
public class Solution {
    static int[][] rotate(int a[][]) {
        int i, j, n = a.length;
        int z[][] = new int[n][n];
        for(i=0; i<n; i++) {
            for(j=0; j<n; j++) {
                z[i][j] = a[n-1-j][i];
            }
        }
        return z;
    }
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for(int t=1; t<=T; t++) {
            int n = sc.nextInt();
            int a[][] = new int[n][n];
            int i, j;
            for(i=0; i<n; i++) {
                for(j=0; j<n; j++) {
                    a[i][j] = sc.nextInt();
                }
            }
            int b[][] = rotate(a);
            int c[][] = rotate(b);
            int d[][] = rotate(c);
            System.out.format("#%d\n", t);
            for(i=0; i<n; i++) {
                for(j=0; j<n; j++) System.out.print(b[i][j]);
                System.out.print(" ");
                for(j=0; j<n; j++) System.out.print(c[i][j]);
                System.out.print(" ");
                for(j=0; j<n; j++) System.out.print(d[i][j]);
                System.out.println();
            }
        }
    }
}