A1

package day0817; import java.util.Scanner; public class Algo1_대전_4반_민선규 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); // 문자열을 받을 스캐너 선언 String str = sc.nextLine(); // 문자열은 str에 저장 char[] arr = new char[str.length()]; // char형 배열을 선언 arr = str.toCharArray(); // char형 배열에 str넣기 for (int i = 0; i < arr.length; i++) { // char배열에서 p가 나왔으며, 앞뒤로 같은 모음이 있는 경우를 탐색 if (ar..

import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; public class Problem_2309 { static int N = 9, R = 7; static int[] mans = new int[N]; static boolean[] result = new boolean[N]; static ArrayList solve = new ArrayList(); public static void main(String[] args) { Scanner sc = new Scanner(System.in); for (int i = 0; i < N; i++) { mans[i] = sc.nextInt(); } comb(0, 0, ..

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int size = sc.nextInt(); int sum = 0; int[] arr = new int[size]; for (int i = 0; i < size; i++) { arr[i] = sc.nextInt(); } Arrays.sort(arr); for (int i = 0; i < size; i++) { for (int j = 0; j

import java.util.LinkedList; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); // 스캐너 입력 선언 int size = sc.nextInt(); // 롤 케이크 사이즈 int max1 = Integer.MIN_VALUE; // 맥스값을 두개를 구해야하기 때문에 2개 선언 int max2 = Integer.MIN_VALUE; int man1 = 0, man2 = 0; //몇번 째 사람인지 저장하는 변수 int N = sc.nextInt(); // 총 사람 수 int[] arr = new int[size]; Lin..

import java.util.Scanner; public class Main2 { static int N, M, R; static int[][] map; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); M = sc.nextInt(); R = sc.nextInt(); map = new int[N][M]; for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++) { map[i][j] = sc.nextInt(); } } rotation(); for (int i = 0; i < N; i++) { for (int j = 0; j < M; j++..

import java.util.Scanner; public class Main { static int N, dif = Integer.MAX_VALUE; static int[] S; static int[] B; static boolean[] result; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); S = new int[N]; B = new int[N]; result = new boolean[N]; for(int i = 0; i < N ; i++) { S[i] = sc.nextInt(); B[i] = sc.nextInt(); } subset(0,1,0); System.out.pri..

import java.util.Scanner; public class Main2 { static Scanner sc = new Scanner(System.in); static int N= sc.nextInt(), M; static int[] cards = new int[N]; static boolean[] result = new boolean[N]; static int maxSum; public static void main(String[] args) { M = sc.nextInt(); for(int i = 0; i < N ; i++) { cards[i] = sc.nextInt(); } comb(0,0,0); System.out.println(maxSum); } private static void com..

import java.util.ArrayList; import java.util.Collections; import java.util.Scanner; public class Main { static Scanner sc = new Scanner(System.in); static int N = sc.nextInt(); // 배열 크기 static int[][] map = new int[N][N]; // 전체 지도 static boolean[][] result = new boolean[N][N]; static int whole = 0; // 전체 치킨 집 static int M = sc.nextInt(); // 남아있는 치킨 집 static ArrayList a; static ArrayList b; stati..

import java.util.Scanner; public class Main { static int N = 9, R = 7; static int[] man = new int[N]; static boolean[] result = new boolean[man.length]; static int sum = 0; public static void main(String[] args) { Scanner sc = new Scanner(System.in); for (int i = 0; i < 9; i++) { man[i] = sc.nextInt(); } subset(0, 0, 0); } private static void subset(int target, int cnt, int sum) { if (cnt == R) ..

import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Main4 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); // 단순 숫자 입력이므로 Scanner을 통하여 입력 받기 Queue queue = new LinkedList(); // 큐 자료구조 생성 int n = sc.nextInt(); // 1~n까지의 숫자카드 범위 지정 for (int i = 1; i