매일 Algorithm

백준 19532번

import java.util.Scanner;

public class problem449 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int a = in.nextInt();
        int b = in.nextInt();
        int c = in.nextInt();
        int d = in.nextInt();
        int e = in.nextInt();
        int f = in.nextInt();

        // x, y 범위에 따른 완전 탐색
        for (int x = -999; x <= 999; x++) {
            for (int y = -999; y <= 999; y++) {
                if (a * x + b * y == c && d * x + e * y == f) {
                    System.out.println(x + " " + y);
                    break;
                }
            }
        }
    }
}

백준 (14425번)

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class problem450 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt(); // 문자열 갯수
        int m = in.nextInt(); // 집합의 갯수

        Map<String, Integer> map = new HashMap<>();

        for (int i = 0; i < n; i++) {
            String str = in.next();

            map.put(str, map.getOrDefault(str, 0) + 1);

        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            String str = in.next();
            // map 객체에 문자열 str이 있는지 확인
            if (map.containsKey(str)) {
                count++;
            }
        }
        System.out.println(count);
    }
}

백준 11478번

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class problem451 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        String str = in.next();

        Set<String> set = new HashSet<>();

        for (int i = 0; i < str.length(); i++) {
            for (int j = i + 1; j <= str.length(); j++) {
                // 서로다른 문자열 자르기
                String temp = str.substring(i, j);
                set.add(temp);
            }
        }

        int result = set.size();

        System.out.println(result);
    }
}

백준 2903번

import java.util.Scanner;

public class problem452 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();

        int loop = 2;

        for (int i = 0; i < n; i++) {
            loop += Math.pow(2, i);
        }

        // 2의 제곱, 3의 제곱, 5의제곱
        System.out.println((int) Math.pow(loop, 2));
    }
}