정올문제소스코드 썸네일형 리스트형 1169 : 주사위 던지기1 import java.util.Scanner; public class Main { static int n, m; static int arr[] = new int [101]; public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); n = scan.nextInt(); m = scan.nextInt(); if (m == 1) { dice1(1); } else if (m == 2) { dice2(1, 1); } else if (m == 3) { dice3(1); } } private static void dice1(int level) { int i; if (lev.. 더보기 1161 : 하노이1 import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int n; n = scan.nextInt(); f(n,1,2,3); } private static void f(int n, int s, int t, int e) { if (n 더보기 1309 : 팩토리얼 import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int n; int i, j; n = scan.nextInt(); long res = f(n); System.out.println(res); } private static long f(int a) { if (a 더보기 2858 : 쇠막대기 import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); String arr; int i, j; int wire = 0; int cut = 0; arr = scan.next(); int len = arr.length(); for (i = 0; i < len; i++) { if (arr.charAt(i) == '(') { wire++; } else if (arr.charAt(i) == ')' && arr.charAt(i - 1) == '(') { wire--; cut += wir.. 더보기 1221 : 후위표기법1 import java.util.Scanner; public class Main { static int stack[] = new int[100]; static int pos = 0; public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int m; char arr[] = new char[101]; int i, j; m = scan.nextInt(); for (i = 0; i < m; i++) { arr[i] = scan.next().charAt(0); if (Character.isDigit(arr[i])) { push(arr[i]-'0'); } else {.. 더보기 1814 : 삽입정렬 횟수 세기 import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int n, i, j; int arr[] = new int [101]; int tmp = 0, cnt = 0; n = scan.nextInt(); for (i = 0; i 0; j--) { if (arr[j] < arr[j - 1]) { tmp = arr[j]; arr[j] = .. 더보기 1157 : 버블정렬 import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int n, i, j; int arr[] = new int [101]; int tmp; n = scan.nextInt(); for (i = 0; i arr[j + 1]) { tmp = arr[j + 1]; arr[j + 1] .. 더보기 1158 : 삽입정렬 import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scan = new Scanner(System.in); int n, i, j; int arr[] = new int[101]; n = scan.nextInt(); for (i = 0; i 0; j--) { if (arr[j] < arr[j - 1]) { int c = arr[j]; arr[j]=arr[j-1]; arr[j-1]=c; }.. 더보기 이전 1 2 3 4 5 다음