• 문제 링크
https://www.acmicpc.net/problem/6889
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringBuilder sb = new StringBuilder();
String[] n = new String[Integer.parseInt(br.readLine())], m = new String[Integer.parseInt(br.readLine())];
for (int i = 0; i < n.length; i++) n[i] = br.readLine();
for (int i = 0; i < m.length; i++) m[i] = br.readLine();
for (String a : n) for (String b : m) sb.append(a).append(" as ").append(b).append("\n");
bw.write(sb.toString());
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 9085 더하기 - Implementation / Java (0) | 2024.10.14 |
---|---|
[백준] 2738 행렬 덧셈 - Implementation / Java (0) | 2024.10.13 |
[백준] 16861 Harshad Numbers - Brute Force / Java (0) | 2024.10.11 |
[백준] 3507 Automated Telephone Exchange - Brute Force / Java (0) | 2024.10.10 |
[백준] 11874 ZAMKA - Brute Force / Java (0) | 2024.10.09 |
댓글