# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
213391 |
2020-03-25T16:59:34 Z |
berryzed |
뚊 (kriii3_EE) |
Java 11 |
|
120 ms |
12168 KB |
import java.util.Scanner;
public class ee {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt(); // Y
int m = scanner.nextInt(); // X
String[] images = new String[n];
String[] images2x = new String[n];
for (int i = 0; i < n; i++) images[i] = scanner.next(); // 원본
for (int i = 0; i < n; i++) images2x[i] = scanner.next(); // 2배
for (int i = 0; i < images.length; i++) {
String image = images[i];
StringBuilder text = new StringBuilder();
for (char c : image.toCharArray()) {
text.append(c);
text.append(c);
}
if (!images2x[i].equals(text.toString())) {
System.out.println("Not Eyfa");
return;
}
}
System.out.println("Eyfa");
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
107 ms |
12012 KB |
Output is correct |
2 |
Correct |
114 ms |
11508 KB |
Output is correct |
3 |
Correct |
101 ms |
11456 KB |
Output is correct |
4 |
Correct |
105 ms |
11892 KB |
Output is correct |
5 |
Correct |
110 ms |
11632 KB |
Output is correct |
6 |
Correct |
106 ms |
11544 KB |
Output is correct |
7 |
Correct |
114 ms |
11444 KB |
Output is correct |
8 |
Correct |
105 ms |
11620 KB |
Output is correct |
9 |
Correct |
105 ms |
11788 KB |
Output is correct |
10 |
Correct |
107 ms |
11648 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
105 ms |
11648 KB |
Output is correct |
2 |
Correct |
113 ms |
11828 KB |
Output is correct |
3 |
Correct |
120 ms |
11684 KB |
Output is correct |
4 |
Correct |
111 ms |
12168 KB |
Output is correct |
5 |
Correct |
109 ms |
11636 KB |
Output is correct |
6 |
Correct |
115 ms |
11872 KB |
Output is correct |
7 |
Correct |
109 ms |
11376 KB |
Output is correct |
8 |
Correct |
111 ms |
11824 KB |
Output is correct |
9 |
Correct |
115 ms |
11680 KB |
Output is correct |
10 |
Correct |
108 ms |
11552 KB |
Output is correct |