본문 바로가기

Java446

[백준/Java] 14425번 문자열 집합 -Codeimport java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ14425 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer... 2025. 12. 24.
[백준/Java] 10815번 숫자 카드 -Codeimport java.util.HashMap;import java.util.Map;import java.util.Scanner;public class BOJ10815 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); Map numMap = new HashMap(); // map에 값이 주어지면 ture를 value로 저장 for (int i = 0; i 2025. 12. 24.
[백준/Java] 34945번 채플이 너무해 -Codeimport java.util.Scanner;public class BOJ34945 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int x = sc.nextInt(); System.out.println(x + 2 >= 8 ? "Success!" : "Oh My God!"); }} 2025. 12. 24.
[백준/Java] 1018번 체스판 다시 칠하기 -Codeimport java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class BOJ1018 { static String[] board; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()).. 2025. 12. 24.
[백준/Java] 34921번 덕후 -Codeimport java.util.Scanner;public class BOJ34921 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int t = sc.nextInt(); int answer = 10 + 2 * (25 - a + t); System.out.println(Math.max(answer, 0)); }} 2025. 12. 23.
[백준/Java] 18870번 좌표 압축 -Code ✅ 실패한 코드1import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); StringTokenizer st = new StringTokenizer(br.readLine()); int[] pointArr = new int[n]; List pointLis.. 2025. 12. 22.