• 문제 링크
https://www.acmicpc.net/problem/33541
• 풀이 코드
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));
int n = read() + 1;
while (n < 10000 && !isSpecial(n, split(n))) n++;
bw.write(n != 10000 ? String.valueOf(n) : "-1");
bw.flush();
}
private static int[] split(int n) {
int m = 0, j = 1;
for (int i = 0; i < 2; i++, n /= 10, j *= 10) m += n % 10 * j;
return new int[]{n, m};
}
private static boolean isSpecial(int n, int[] arr) {
return (arr[0] + arr[1]) * (arr[0] + arr[1]) == n;
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 18041 Mountain Ranges - Brute Force / Java (0) | 2025.05.13 |
---|---|
[백준] 32585 Building Pyramids - Brute Force / Java (0) | 2025.05.12 |
[백준] 6811 Old Fishin’ Hole - Brute Force / Java (0) | 2025.05.10 |
[백준] 33049 마작에서 가장 어려운 것 - Brute Force / Java (0) | 2025.05.09 |
[백준] 17127 벚꽃이 정보섬에 피어난 이유 - Brute Force / Java (0) | 2025.05.08 |
댓글