Submission #1180759


Source Code Expand

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int cnt = 0;
		String word = scan.next();
		String[][] a = new String[N][N];
		String[][] b = new String[N][N];
		
		for(int i = 0; i < N-1; i++){
			word = word + scan.next();
		}
		String splitWord[] = word.split("",0);
		
		for(int i = 0; i < N; i++){
			for(int j = 0; j < N; j++){
				a[i][j] = splitWord[cnt];
				cnt++;
			}
		}
		
		for(int i = 0; i < N; i++){
			for(int j = 0; j < N; j++){
				b[j][N - 1 - i] = a[i][j];
			}
		}
		
		for(int i = 0; i < N; i++){
			for(int j = 0; j < N; j++){
				System.out.print(b[i][j]);
			}
			System.out.println("");
		}

	}

}

Submission Info

Submission Time
Task B - 回転
User Qoo238
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 777 Byte
Status AC
Exec Time 134 ms
Memory 22356 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 11
Set Name Test Cases
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt
Case Name Status Exec Time Memory
000.txt AC 93 ms 19668 KB
001.txt AC 106 ms 19668 KB
002.txt AC 127 ms 19668 KB
003.txt AC 93 ms 18900 KB
004.txt AC 134 ms 22356 KB
005.txt AC 105 ms 17492 KB
006.txt AC 129 ms 20436 KB
007.txt AC 99 ms 19924 KB
008.txt AC 128 ms 20436 KB
009.txt AC 115 ms 20688 KB
010.txt AC 127 ms 20436 KB