목록다이나믹 (17)

hara

BEAKJOON JAVA ALGORITHM #11057(오르막수)

https://www.acmicpc.net/problem/11057 import java.util.Scanner; public class a11057 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); long[][] arr = new long[num+1][10]; for(int i=0; i
공부/알고리즘 2017. 8. 16. 18:17
BEAKJOON JAVA ALGORITHM #10844(쉬운 계단 수)

https://www.acmicpc.net/problem/10844 import java.util.Scanner; public class a10844 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); long[][] arr = new long[num+1][10]; for(int i=1; i
공부/알고리즘 2017. 8. 16. 18:15
BEAKJOON JAVA ALGORITHM #2193(이친수)

https://www.acmicpc.net/problem/2193 import java.util.Scanner; public class a2193 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); long[] arr = new long[num+1]; arr[1] = 1; if(num == 1) { System.out.println(arr[num]); }else { for(int i=2; i
공부/알고리즘 2017. 8. 16. 18:14
BEAKJOON JAVA ALGORITHM #11727(2xn타일링2)

https://www.acmicpc.net/problem/11727 import java.util.Scanner; public class a11727 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num+1]; arr[0] = arr[1] = 1; if(num == 1) { System.out.println(arr[num]); }else { for(int i=2; i
공부/알고리즘 2017. 8. 16. 18:11
BEAKJOON JAVA ALGORITHM #11052(붕어빵판매하기)

https://www.acmicpc.net/problem/11052 import java.util.Scanner; public class a11052 { public static void main(String[] args){ Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] p = new int[num+1]; for(int i=1; i
공부/알고리즘 2017. 8. 16. 18:10
Prev 1 2 3 Next