• 문제 링크
https://www.acmicpc.net/problem/13717
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
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));
String s = "";
int n = Integer.parseInt(br.readLine()), sum = 0, max = 0;
while (n-- > 0) {
String p = br.readLine();
StringTokenizer st = new StringTokenizer(br.readLine());
int k = Integer.parseInt(st.nextToken()), m = Integer.parseInt(st.nextToken());
if (m < k) continue;
int cnt = (m - k) / (k - 2) + 1;
sum += cnt;
if (max < cnt) {
max = cnt;
s = p;
}
}
bw.write(sum + "\n" + s);
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 4154 Buzzwords - Data Structure / Java (0) | 2025.07.13 |
---|---|
[백준] 17203 ∑|ΔEasyMAX| - Implementation / Java (0) | 2025.07.12 |
[백준] 2495 연속구간 - Implementation / Java (0) | 2025.07.10 |
[백준] 2997 네 번째 수 - Implementation / Java (0) | 2025.07.09 |
[백준] 1252 이진수 덧셈 - Implementation / Java (0) | 2025.07.08 |
댓글