코딩하는 등산가

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.StringTokenizer; public class Back_2212 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Back_12904 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringBuilder s = new StringBuilder(br.readLine()); StringBuilder t = new StringBuilder(br.readLine());..

문제 제한사항 입출력 문제풀이 import java.util.*; class Solution { class report{ int money; String ref; public report(int money,String ref){ this.money = money; this.ref = ref; } } public int[] solution(String[] enroll, String[] referral, String[] seller, int[] amount) { int[] answer = new int[enroll.length]; HashMap hm = new HashMap(); for(int i = 0 ; i < enroll.length;i++){ hm.put(enroll[i],new report(0,re..

문제 제한 사항 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(int rows, int columns, int[][] queries) { int[] answer = new int [queries.length]; int[][] arr = new int[rows][columns]; int tmp =1; for(int i = 0 ; i < rows;i++){ for(int j = 0 ; j < columns;j++){ arr[i][j]=tmp; tmp++; } } int x1=0,x2=0,y1=0,y2=0; for(int t = 0 ; t < queries.length;t++){ x1 = queries[t][0]-1; y1 = quer..

문제 제한사항 입출력 문제풀이 import java.util.*; class Solution { public int[] solution(int[] lottos, int[] win_nums) { int[] answer = new int[2]; int[] arr = new int[46]; for(int i: lottos){ arr[i]++; } int ans=0; for(int i: win_nums){ if(arr[i]!=0){ ans++; } } int ans2 = ans + arr[0]; if(ans

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Back_2579 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); int [] arr = new int[N+1]; int [] dp = n..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.HashMap; public class Back_11723 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); HashMap hm = ..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.StringTokenizer; public class Back_16198 { static int N,max; public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); ..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.HashMap; public class Back_4358 { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); HashMap hm = new HashMap(); String tmp; int sum=0; wh..

시간&메모리 제한 문제 입력&출력 문제풀이 package com.Back; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.StringTokenizer; public class Back_1713 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br = new BufferedRe..