Problem Solving1248 [백준] 2908 상수 - Implementation / Java • 문제 링크 2908번: 상수 상근이의 동생 상수는 수학을 정말 못한다. 상수는 숫자를 읽는데 문제가 있다. 이렇게 수학을 못하는 상수를 위해서 상근이는 수의 크기를 비교하는 문제를 내주었다. 상근이는 세 자리 수 두 www.acmicpc.net • 풀이 코드 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)); b.. 2024. 4. 17. [백준] 1157 단어 공부 - Implementation / Java • 문제 링크 1157번: 단어 공부 알파벳 대소문자로 된 단어가 주어지면, 이 단어에서 가장 많이 사용된 알파벳이 무엇인지 알아내는 프로그램을 작성하시오. 단, 대문자와 소문자를 구분하지 않는다. www.acmicpc.net • 풀이 코드 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new .. 2024. 4. 16. [백준] 11597 Excellence - Greedy / Java • 문제 링크 11597번: Excellence The World Coding Federation is setting up a huge online programming tournament of teams comprised of pairs of programmers. Judge David is in charge of putting teams together from the Southeastern delegation. Every student must be placed on exactly one team www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWrit.. 2024. 4. 15. [백준] 27851 Watching Mooloo - Greedy / Java • 문제 링크 27851번: Watching Mooloo Bessie first buys a one-day subscription on day 1, spending $d+K = 1+3 = 4$ moonies. Bessie also buys a one-day subscription on day 10, spending $d+K = 1+3 = 4$ moonies. In total, Bessie spends 8 moonies. www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWriter; public class Main { public static void main.. 2024. 4. 14. [백준] 21146 Rating Problems - Greedy / Java • 문제 링크 21146번: Rating Problems Output two space-separated floating point numbers on a single line, which are the minimum and maximum overall rating the problem could achieve after the remaining judges rate the problem, minimum first. These values must be accurate to an absolute or relat www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStrea.. 2024. 4. 13. [백준] 15001 Frog Leaps - Greedy / Java • 문제 링크 15001번: Frog Leaps It is a little known secret that frogs also like to participate in the BAPC. However, to reach Amsterdam they will need to cross lots of rivers. Fortunately, the frog is in good condition and can jump as far as he wants to go. However, jumping a distance o www.acmicpc.net • 풀이 코드 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWrit.. 2024. 4. 12. 이전 1 ··· 86 87 88 89 90 91 92 ··· 208 다음
