[CodeJam] Qualification Round 2020

Vestigium

문제보기

문제에 주어진 k,r,c 조건을 코드로 바꾼다

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) throws Exception {

		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);

        int testCases = sc.nextInt();
        for (int testCase = 1; testCase <= testCases; testCase++) {
            int n = sc.nextInt();
            int k = 0;
            
            // get k (좌상단부터 우하단까지 대각선값의 합)
            int[][] arr = new int[n][n];
            for(int i = 0 ; i < n ; i++) {
                for(int j = 0 ; j < n ; j++) {
                    arr[i][j] = sc.nextInt();
                    if (i == j) {
                        k += arr[i][j];
                    }
                }
            }
            
            // get r (중복되는 원소를 가진 행의 갯수)
            int r = 0;
            for(int i = 0 ; i < n ; i++) {
                Set<Integer> nums = new HashSet();
                for(int j = 0 ; j < n ; j++) {
                    if (nums.contains(arr[i][j])) {
                        r++;
                        break;
                    } else {
                        nums.add(arr[i][j]);
                    }
                }
            }
            
            // get c (중복되는 원소를 가진 열의 갯수)
            int c = 0;
            for(int j = 0 ; j < n ; j++) {
                Set<Integer> nums = new HashSet();
                for(int i = 0 ; i < n ; i++) {
                    if (nums.contains(arr[i][j])) {
                        c++;
                        break;
                    } else {
                        nums.add(arr[i][j]);
                    }
                }
            }

            pw.printf("Case #" + testCase + ": %d %d %d\n", k, r ,c);
            pw.flush();
        }

        pw.close();
        sc.close();
    }
}

Nesting Depth

문제보기

직전 숫자와의 차이만큼 ( 혹은 ) 를 붙혀준다

import java.io.*;
import java.util.*;

public class Solution {
    private static final char LEFT = '(';
    private static final char RIGHT = ')';

    public static void main(String[] args) throws Exception {

        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        int testCases = sc.nextInt();
        for (int testCase = 1; testCase <= testCases; testCase++) {
            String s = sc.next();
            StringBuilder sb = new StringBuilder();
            int prev = 0;

            for (int i = 0 ; i < s.length(); i++) {
                int curr = s.charAt(i) - '0';
                int diff = curr - prev;

                if (diff > 0) {
                    sb.append(makeRepeatedStr(LEFT, diff));
                } else if (diff < 0) {
                    sb.append(makeRepeatedStr(RIGHT, Math.abs(diff)));
                }
                sb.append(curr);
                prev = curr;
            }

            sb.append(makeRepeatedStr(RIGHT, s.charAt(s.length() - 1) - '0'));

            pw.printf("Case #" + testCase + ": %s\n", sb.toString());
            pw.flush();
        }

        pw.close();
        sc.close();
    }

    private static String makeRepeatedStr(char chr, int count) {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < count; i++) {
            sb.append(chr);
        }
        return sb.toString();
    }

}