메델_project

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int N = kb.nextInt(); int[] persons = new int[N]; for(int i=0; i

class Solution { public String solution(int[] food) { StringBuilder sb = new StringBuilder(); for(int i=1; i

import java.util.*; class Solution { public int solution(int a, int b, int n) { int answer = 0; while(true){ if(n

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int N = kb.nextInt(); String pattern = kb.next(); int findStar = pattern.indexOf("*"); String start = pattern.substring(0, findStar); String end = pattern.substring(findStar+1, pattern.length()); for(int i=0; i

import java.util.*; class Solution { public int solution(String skill, String[] skill_trees) { int answer = 0; for(int i=0; i

import java.util.ArrayList; import java.util.Scanner; public class Main { static ArrayList[] graph; static int N; static boolean[] visited; static int[] parents; static void DFS(int index) { for(int x: graph[index]) { if(!visited[x]) { visited[x] = true; parents[x] = index; DFS(x); } } } public static void main(String[] args) { Scanner kb = new Scanner(System.in); N = kb.nextInt(); graph = new A..

import java.math.BigInteger; import java.util.Scanner; public class Main { static int n, m; static BigInteger[][] arr = new BigInteger[105][105]; static BigInteger combination(int n, int m) { if (arr[n][m] != null) return arr[n][m]; if (m == 0 || m == n) return BigInteger.ONE; return arr[n][m] = combination(n - 1, m - 1).add(combination(n - 1, m)); } public static void main(String[] args) { Scan..

import java.util.*; import java.math.*; class Solution { public int[] solution(int n, int m) { BigInteger bigN = new BigInteger(Integer.toString(n)); BigInteger bigM = new BigInteger(Integer.toString(m)); BigInteger gcd = bigN.gcd(bigM); BigInteger lcm = bigN.multiply(bigM).divide(gcd); int[] answer = {gcd.intValue(), lcm.intValue()}; return answer; } } 이렇게 풀라고 낸 문제는 아닌 것 같은데 있는건 써야..

import java.util.*; class Solution { public List solution(String s) { HashMap map = new HashMap(); String[] numbers = s.replaceAll("\\{","").replaceAll("\\}", "").split(","); for(String x: numbers){ int num = Integer.parseInt(x.trim()); map.put(num, map.getOrDefault(num, 0)+1); } List keys = new ArrayList(map.keySet()); Collections.sort(keys, (v1, v2) -> (map.get(v2).compareTo(map.get(v1)))); Ar..

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[][] checked = new int[100][100]; for(int i=0; i