Data Makes Our Future

1234567891011121314151617181920212223import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int T = scan.nextInt(); int lim[] = {31,28,31,30,31,30,31,31,30,31,30,31}; for(int i=0; i

123456789101112131415import java.util.Scanner; // 2058. 자릿수 더하기public class Solution2058 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String N = sc.nextLine(); //(1

1234567891011121314151617import java.util.Arrays;import java.util.Scanner; // 2063. 중간값 찾기public class Solution2063 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); // 항상 홀수 (9

1234567891011121314151617181920// 2068. 최대수 구하기import java.util.Scanner; public class Solution2068 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); for(int i=0; i BestSolution1234567891011121314import java.util.*;public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); for(int ..

1234567891011121314151617181920import java.util.Scanner;// 2070. 큰 놈, 작은 놈, 같은 놈public class Solution2070 { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int T = scan.nextInt(); for(int i=0; i n2) System.out.println(">"); else System.out.println("")); } }}Colored by Color Scriptercs

1234567891011121314151617import java.util.Scanner; //2071. 평균값 구하기public class Solution2073 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); // 반복 횟수 for(int i=0; i

12345678910111213141516171819import java.util.Scanner; //2072. 홀수만 더하기public class Solution2072 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); // 반복 횟수 for(int i=0; i