반응형

알고리즘/Java

    [백준] 4153.직각삼각형(Java8)

    [백준] 4153.직각삼각형(Java8)

    문제 풀이 package solved2; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ //직각삼각형 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; StringBuilder sb = new StringBuilder(); in..

    [백준] 15829.Hashing(Java8)

    [백준] 15829.Hashing(Java8)

    문제 풀이 package solved2; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { static final int m = 1234567891; public static void main(String[] args) throws IOException{ //Hashing BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int l = Integer.parseInt(br.readLine());//문자열의 길이 String str = br.readLine();//문자열 int..

    [백준] 5585.거스름돈(Java8)

    [백준] 5585.거스름돈(Java8)

    문제 풀이 package greedy; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException{ //거스름돈 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int money = 1000 - Integer.parseInt(br.readLine());//지불할 돈 int answer = 0;//잔돈의 매수 int[] arr = {500, 100, 50, 10, 5, 1}; fo..

    [백준] 10773.제로(Java8)

    [백준] 10773.제로(Java8)

    문제 풀이 package Implementation; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; public class Main { public static void main(String[] args) throws IOException{ //제로 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int k = Integer.parseInt(br.readLine());//정수의 개수 ArrayList arrLst = new ArrayList(); for(..

    [백준] 1476.날짜 계산(Java8)

    [백준] 1476.날짜 계산(Java8)

    문제 풀이 package Implementation; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ //날짜 계산 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()," "); int e = Integer.par..

    [백준] 7568.덩치(Java8)

    [백준] 7568.덩치(Java8)

    문제 풀이 package Implementation; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ //덩치 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine());//전체 사람의 수 int[][] arr = new int[n][2]; Str..

    [백준] 1009.분산처리(Java8)

    [백준] 1009.분산처리(Java8)

    문제 풀이 package Implementation; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException{ //분산처리 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int t = Integer.parseInt(br.readLine());//테스트 케이스의 개수 StringTokenizer st; StringB..

    [백준] 18406.럭키 스트레이트(Java8)

    [백준] 18406.럭키 스트레이트(Java8)

    문제 풀이 package Implementation; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class Main { public static void main(String[] args) throws IOException{ //럭키 스트레이트 BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); char[] n = br.readLine().toCharArray();//점수 int half = n.length / 2; int sum1 = 0, sum2 = 0; for(int i = 0; i <..

반응형