백준15 [JAVA][백준] 11866_요세푸스 문제 0 (Queue) import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.LinkedList;import java.util.Queue;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine(.. 2024. 5. 1. [JAVA][백준] 1676_팩토리얼 0의 개수 import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.math.BigInteger;public class Zfactorial0_1676 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); /* factorial 구하기 */ int n = Integer.parseInt(br.readLine()); BigIntege.. 2024. 4. 23. [JAVA][백준] 7568_덩치 1. Scanner 사용 import java.util.Scanner; public class size_7568 { public static void main (String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[][] arr = new int[2][n]; int[] raking = new int[n]; for (int i = 0; i < n; i++) { int x = sc.nextInt(); int y = sc.nextInt(); arr[0][i] = x; arr[1][i] = y; } for(int j = 0; j < n; j++) { int k = 0; int maxX = arr[0][j]; int maxY.. 2024. 4. 22. [JAVA][백준] 2751_수 정렬하기 2 1. ArrayList 사용 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Collections; public class sorting2_2751 { public static void main (String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder sb = new StringBuilder(); int n = Integer.parseInt(br.. 2024. 4. 18. 이전 1 2 3 4 다음
