[S3] 11478 서로 다른 부분 문자열의 개수

[wwan13]

Problem Info

• Number : 11478
• Name : 서로 다른 부분 문자열의 개수
• Level : S3
• tags : data_structures, hash_set, string, tree_set
• link : https://www.acmicpc.net/problem/11478

Code

package boj11478;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

public class Main {

    private static final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String[] args) {
        String input = readLine();
        Set<String> set = new HashSet<>();

        for (int i = 0; i < input.length(); i++) {
            for (int j = i + 1; j <= input.length(); j++) {
                set.add(input.substring(i, j));
            }
        }

        System.out.println(set.size());
    }

    private static String readLine() {
        try {
            return reader.readLine();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }
}

Note