Submission #3372795


Source Code Expand

import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int sqr=sc.nextInt();

		char[][] moto=new char[sqr][sqr];
		for(int i=0; i<sqr; i++) {
			String buri=sc.next();
			for(int j=0; j<sqr; j++) {
				moto[i][j]=buri.charAt(j);
			}
		}

		char[][] rotate=new char[sqr][sqr];

		//int[][] matrix= {{0,1},{-1,0}};

		for(int i=0; i<sqr; i++) {
			for(int j=0; j<sqr; j++) {
				rotate[i][j]=moto[sqr-1-j][i];
			}
		}
		for(int i=0; i<sqr; i++) {
			for(int j=0; j<sqr-1; j++) {
				System.out.print(rotate[i][j]);
			}
			System.out.println(rotate[i][sqr-1]);
		}

	}
}

Submission Info

Submission Time
Task B - 回転
User Digaus
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 668 Byte
Status AC
Exec Time 125 ms
Memory 23252 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 92 ms 21204 KB
001.txt AC 102 ms 18644 KB
002.txt AC 125 ms 21460 KB
003.txt AC 94 ms 21204 KB
004.txt AC 124 ms 21324 KB
005.txt AC 111 ms 19668 KB
006.txt AC 123 ms 21204 KB
007.txt AC 99 ms 23252 KB
008.txt AC 124 ms 22228 KB
009.txt AC 111 ms 19284 KB
010.txt AC 123 ms 22484 KB