• 문제 링크
https://www.acmicpc.net/problem/27590
• 풀이 코드
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 ds = read(), ys = read(), dm = read(), ym = read(), s = ys - ds, m = ym - dm;
while (s != m) {
if (s < m) s += ys;
else m += ym;
}
bw.write(String.valueOf(s));
bw.flush();
}
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' 카테고리의 다른 글
[백준] 6975 Deficient, Perfect, and Abundant - Brute Force / Java (0) | 2024.10.27 |
---|---|
[백준] 4619 루트 - Brute Force / Java (0) | 2024.10.26 |
[백준] 24817 Competitive Arcade Basketball - Data Structure / Java (0) | 2024.10.24 |
[백준] 8669 Las - Data Structure / Java (0) | 2024.10.23 |
[백준] 27160 할리갈리 - Data Structure / Java (0) | 2024.10.22 |
댓글