메델_project

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); String a = kb.next(); String b = kb.next(); int count = 1; while(!a.equals(b)) { if(Integer.parseInt(a)>Integer.parseInt(b)) { break; } char last = b.charAt(b.length()-1); if(last == '1') { b = b.substring(0, b.length()-1); count++; }else if(Integer.parseInt(b)%2 ==0) { int..

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); String s = kb.next(); String check = ""; check += s.charAt(0); for(int i=1; i

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); String s = kb.next(); String[] nums = s.split("-"); int[] sum = new int[nums.length]; for(int i=0; i

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

import java.util.Scanner; public class Main { static int gcd(int a, int b) { if(b==0) { return a; } return gcd(b, a%b); } public static void main(String[] args){ Scanner kb = new Scanner(System.in); String s = kb.next(); String t = kb.next(); int gcd = gcd(s.length(), t.length()); String fs = s.repeat(t.length()/gcd); String ft = t.repeat(s.length()/gcd); if(fs.equals(ft)) { System.out.println(1..

import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args){ Scanner kb = new Scanner(System.in); String question = kb.next(); String[] nums = question.split(":"); BigInteger[] bigIntegerNums = new BigInteger[2]; for(int i=0; i

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

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.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..