• 문제 링크
https://www.acmicpc.net/problem/30580
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
long c = read();
long[] arr = new long[(int) read()];
for (int i = 0; i < arr.length; i++) arr[i] = read();
for (long i : arr) {
if (i * (c / i) != c) continue;
bw.write(concat(i, c / i));
break;
}
bw.flush();
}
private static String concat(long i, long j) {
return Math.min(i, j) + " " + Math.max(i, j);
}
private static long read() throws IOException {
long c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}'Problem Solving > Baekjoon' 카테고리의 다른 글
| [백준] 34723 피막치 - Brute Force / Java (0) | 2025.11.11 |
|---|---|
| [백준] 19532 수학은 비대면강의입니다 - Brute Force / Java (0) | 2025.11.10 |
| [백준] 11346 Cornell Party - Retry - Data Structure / Java (0) | 2025.11.08 |
| [백준] 11345 Cornell Party - Data Structure / Java (0) | 2025.11.07 |
| [백준] 34285 Golden Landmarks - Data Structure / Java (0) | 2025.11.06 |
댓글