Java445 [백준/Java] 2587번 대표값2 -Codeimport java.util.*;public class BOJ2587 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int[] nums = new int[5]; int sum = 0; for (int i = 0; i 2025. 12. 22. [백준/Java] 34943번 신규 학과 -Codeimport java.util.Scanner;public class BOJ34934 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); int now = 0; String answer = ""; for (int i = 0; i 2025. 12. 22. [백준/Java] 2798번 블랙잭 -Codeimport java.util.Scanner;public class BOJ2798 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int[] cards = new int[n]; for (int i = 0; i 2025. 12. 21. [백준/Java] 24313번 알고리즘 수업 - 점근적 표기 1 -Codeimport java.util.Scanner;public class BOJ24313 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a1 = sc.nextInt(); int a0 = sc.nextInt(); int c = sc.nextInt(); int n0 = sc.nextInt(); sc.close(); if (fFunction(a1, a0, n0) 2025. 12. 21. [백준/Java] 11653번 소인수분해 -Codeimport java.util.Scanner;public class BOJ11653 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); while (true) { int p = getPrime(num); if (p == -1) { break; } System.out.println(p); num /= p; } } private static int getPrime(int n) {.. 2025. 12. 21. [백준/Java] 2581번 소수 -Codeimport java.util.Scanner;public class BOJ2581 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); int sum = 0; int minPrime = Integer.MAX_VALUE; for (int num = n; num num) { minPrime = num; } } } if (sum == 0) { .. 2025. 12. 21. 이전 1 ··· 39 40 41 42 43 44 45 ··· 75 다음