슈콩

[소스 코드]import java.util.ArrayList;import java.util.Iterator;class Main { class Shop{ protected ArrayList reserveList; public Shop() { this.reserveList = new ArrayList(); } public boolean reserve(Customer customer){ reserveList.add(customer); return true; } } class Customer{ public int id; public int time; public i..

[소스 코드]class Main { public int solution(int[] revenue, int k) { int answer = 0; int n = revenue.length; int sum = 0; for (int i = 0; i

[소스 코드]class Main { public int solution(int k, int[] student) { int answer = 0; for(int i = 0; i

[소스 코드]import java.util.*;class Main { public int[] solution(int k) { int[] kaprekarArr = new int[k]; int count = 0; for (int i = 1; i

[소스 코드]import java.util.ArrayList;class Main { public int solution(int n) { int answer = 0; ArrayList primes = new ArrayList(); primes.add(2); for (int i = 3; i

[소스 코드]import java.util.*;class Main { public String solution(String phrases, int second) { // 여기에 코드를 작성해주세요. int length = 14; String answer = ""; StringBuilder sb = new StringBuilder(); for(int i=0;i

[문제]https://www.acmicpc.net/problem/19236 [소스 코드]import java.io.*;import java.util.*;public class Main { static class Fish { int r,c,num,dir; boolean alive; Fish(int r,int c,int num,int dir,boolean alive){ this.r = r; this.c = c; this.num = num; this.dir = dir; this.alive = alive; } } static int result = 0; static int[] dr = {-1,-1,0,1,1,1,0,-1}; static int[] dc = {0,-1,-1,-1,0,1,..

[문제]https://www.acmicpc.net/problem/17825 [소스 코드]import java.io.*;import java.util.*;public class Main { static int[] board = { 0,2,4,6,8,10,12,14,16,18,20, 22,24,26,28,30,32,34,36,38,40, 13,16,19,22,24,28,27,26,25,30, 35,0 }; static int[] dices,locs,spacial,nxt; static int result = 0; public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new ..

[소스 코드]import java.util.*;class Main { public int solution(String s1, String s2) { // 여기에 코드를 작성해주세요. int answer = s1.length() + s2.length(); int a = 0; int b = 0; for(int i=1;i

[소스 코드]import java.util.*;class Main { int[] dx = {-1,1,-1,1}; int[] dy = {1,1,-1,-1}; public int solution(String[] bishops) { int answer = 0; boolean[][] visit = new boolean[8][8]; for(int i=0;i=0 && nx=0 && ny