매일 Algorithm

백준 9546번 (Bronze 2)

import java.util.Scanner;

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


        for (int i = 0; i < t; i++) {
            int n = in.nextInt();

            int result = 1;

            for (int j = 1; j < n; j++) {

                // result 값 갱신
                result = (result * 2) + 1;
            }
            System.out.println(result);
        }


    }
}

백준 10539번 (Bronze 2)

import java.util.Scanner;

public class problem322 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        int[] result = new int[t];
        int[] arr = new int[t];

        for (int i = 0; i < t; i++) {
            arr[i] = in.nextInt();
        }
        int sum = 0;
        for (int i = 0; i < t; i++) {
            // result 배열에 값을 담아준다.
            result[i] = arr[i] * (i + 1) - sum;
            sum += result[i];
        }

        for (int r : result) {
            System.out.print(r + " ");
        }
    }
}