8단계 : 11650번 / 좌표 정렬하기 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.Arrays; import java.util.StringTokenizer; public class Main{ public static void main(String args[]) throws IOException{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Buffe..
분류 전체보기
1단계 : 2750번 / 수 정렬하기 import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int least; int[] arr = new int[N]; for(int i=0; i
2920번 음계 (JAVA) import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); int[] a = new int[8]; for (int i=0; i
1단계 : 2738번 / 행렬 덧셈 import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); // 행렬 크기 N * M int N = sc.nextInt(); int M = sc.nextInt(); // 행렬 A int[][] A = new int[N][M]; for (int i=0; i
1단계 : 1978번 / 소수 찾기 import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int count = 0; for(int i=0; i
1단계 : 1712번 / 손익분기점 import java.util.Scanner; public class Main{ public static void main(String args[]){ Scanner sc = new Scanner(System.in); int A = sc.nextInt(); int B = sc.nextInt(); int C = sc.nextInt(); long count = 0; if(B>=C) {count = -1;} else { while( (A+B*count) >= C*count ){ count ++; } } System.out.println(count); } } 2단계 : 2292번 / 벌집 import java.util.Scanner; public class Main{ publ..