Problem Solving1235 [백준] 20363 당근 키우기 - Greedy / Java • 문제 링크 20363번: 당근 키우기 첫째 줄에 X와 Y (0 ≤ X, Y ≤ 109)를 의미하는 정수가 공백으로 구분되어 주어진다. www.acmicpc.net • 풀이 과정 • 풀이 코드 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 b.. 2023. 7. 9. [백준] 6031 Feeding Time - Graph Theory / Java • 문제 링크 6031번: Feeding Time It's Bessie's feeding time, and Farmer John is trying to decide where to put her. FJ has a farm that comprises W x H (1 2023. 7. 8. [백준] 5958 Space Exploration - Graph Theory / Java • 문제 링크 5958번: Space Exploration Farmer John's cows have finally blasted off from earth and are now floating around space in their Moocraft. The cows want to reach their fiery kin on Jupiter's moon of Io, but to do this they must first navigate through the dangerous asteroid belt. Bessie www.acmicpc.net • 풀이 과정 • 풀이 코드 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io... 2023. 7. 7. [백준] 10678 Meeting Time - Graph Theory / Java • 문제 링크 10678번: Meeting Time A single integer, giving the minimum time required for Bessie and Elsie to travel to their favorite field and arrive at the same moment. If this is impossible, or if there is no way for Bessie or Elsie to reach the favorite field at all, output the word IM www.acmicpc.net • 풀이 과정 • 풀이 코드 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOE.. 2023. 7. 6. [백준] 5848 Message Relay - Graph Theory / Java • 문제 링크 5848번: Message Relay Farmer John's N cows (1 2023. 7. 5. [백준] 5938 Daisy Chains in the Field - Graph Theory / Java • 문제 링크 5938번: Daisy Chains in the Field Farmer John let his N (1 2023. 7. 4. 이전 1 ··· 131 132 133 134 135 136 137 ··· 206 다음
