알고리즘

import java.util.Scanner; public class Main { static int T; static int[][] dp = new int[41][2]; public static void main(String[] args) { Scanner sc = new Scanner(System.in); T = sc.nextInt(); dp[0][0] = 1; dp[1][1] = 1; for (int i = 2; i < 41; i++) { for (int j = 0; j < 2; j++) { dp[i][j] = dp[i-1][j] + dp[i-2][j]; } } for (int i = 0 ; i < T; i++) { int Tcase = sc.nextInt(); System.out.println(d..

import java.util.Scanner; public class Main { static int N; static int[] stairs; static int[] dp; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); dp = new int[N+1]; stairs = new int[N+1]; for (int i = 1; i = 2) dp[2] = dp[1] + stairs[2]; for (int i = 3; i

import java.util.Scanner; public class Main { static int N; static int[] num = new int[11]; static int[] result; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); result = new int[N]; num[0] = 1; num[1] = 2; num[2] = 4; int testCase; for (int i = 0 ; i< N; i++) { testCase = sc.nextInt(); for (int j = 3; j < testCase; j++) { num[j] = num[j-1] + num[j-..

import java.util.Scanner; public class Main { static int N; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); int dp[] = new int[N+1]; dp[0] = dp[1] = 0; for (int i = 2; i

import java.util.Arrays; import java.util.Scanner; public class Main { static int N; static int[] K; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); K = new int[N]; for (int i = 0; i =0; i--) { K[i] = K[i]*(N-i); if (max < K[i]) max = K[i]; } System.out.println(ma..

import java.util.Scanner; public class Main { static int[] money = {500, 100, 50, 10, 5, 1}; static int pay; public static void main(String[] args) { Scanner sc = new Scanner(System.in); pay = sc.nextInt(); int change = 1000 - pay; int result = 0; for (int i = 0; i = money[i]) { result += change/money[i]; change = change%money[i]; } } System.out.println(result); } }

import java.util.Arrays; import java.util.Comparator; import java.util.Scanner; public class Main { static int[][] conference; static int N; static int K; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); conference = new int[N][2]; for (int i = 0; i < N; i++) { for (int j = 0; j < 2; j++) { conference[i][j] = sc.nextInt(); } } Arrays.sort(conference..

import java.util.Scanner; public class Main { static int[] coin; static int N; static int K; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N = sc.nextInt(); K = sc.nextInt(); coin = new int[N]; for (int i = 0; i = 0; i--) { if (coin[i]