메델_project

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

import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int T = kb.nextInt(); for(int i=0; iR) { BCharge = Q+ S*(W-R); }else { BCharge = Q; } sb.append("#").append(i+1).append(" "); if(ACharge>BCharge) { sb.append(BCharge); }else { sb.append(ACharge); } sb.append('\n'); } System.out.pr..

public class Solution { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); StringBuilder sb = new StringBuilder(); int num=1; sb.append(num).append(" "); for(int i=0; i

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

import java.util.Arrays; import java.util.Collections; import java.util.Scanner; class Solution { public static void main(String args[]) throws Exception { Scanner kb = new Scanner(System.in); int num = kb.nextInt(); Integer[] arr = new Integer[num+1]; for(int i=0; i< arr.length; i++) { arr[i] = i; } Arrays.sort(arr, Collections.reverseOrder()); for(int x: arr) { System.out.print(x+ " "); } } }

import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); for(int i=0; i=60) { resultM = (m1+m2)%60; resultH++; } if(resultH>12) { resultH = resultH%12; if(resultH == 0) { resultH = 12; } } System.out.println("#"+(i+1)+" "+resultH+" "+ resultM); } } }

import java.util.*; class Solution { public int[] solution(int[] array, int[][] commands) { int[] answer = new int[commands.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); String[] find = {"c=", "c-", "dz=", "d-", "lj", "nj", "s=", "z="}; String str = kb.next(); for (int i = 0; i < find.length; i++) { if (str.contains(find[i])) str = str.replace(find[i], "*"); } System.out.println(str.length()); } }

import java.util.*; class Solution { public String solution(String[] cards1, String[] cards2, String[] goal) { Queue queue1 = new LinkedList(); Queue queue2 = new LinkedList(); for(String x: cards1){ queue1.add(x); } for(String x: cards2){ queue2.add(x); } for(int i=0; i

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Stack; public class Main { static String pro(String s) { Stack stack = new Stack(); for (char c : s.toCharArray()) { if (c == '(') { stack.push(c); } else if (c == ')') { if (!stack.isEmpty() && stack.pop() == '(') { continue; } else { return "NO"; } } } if (!stack.isEmpty()) { return "N..