목록알고리즘 (52)

hara

BEAKJOON JAVA ALGORITHM #10942(팰린드롬?)

https://www.acmicpc.net/problem/10942 import java.util.Scanner; public class a10942 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num+1]; for(int i=1; i
공부/알고리즘 2017. 8. 23. 15:03
BEAKJOON JAVA ALGORITHM #1890(점프)

https://www.acmicpc.net/problem/1890 import java.util.Scanner; public class a1890 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int[][] arr = new int[a+1][a+1]; for(int i=1; i
공부/알고리즘 2017. 8. 23. 15:02
BEAKJOON JAVA ALGORITHM #11048(이동하기)

https://www.acmicpc.net/problem/11048 import java.util.Scanner; public class a11048 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); int[][] arr = new int[a+1][b+1]; for(int i=1; i
공부/알고리즘 2017. 8. 23. 15:01
BEAKJOON JAVA ALGORITHM #1699(제곱수의 합)

https://www.acmicpc.net/problem/1699 import java.util.Scanner; public class a1699 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] d = new int[num+1]; for(int i=1; i
공부/알고리즘 2017. 8. 21. 14:09
BEAKJOON JAVA ALGORITHM #2579(계단 오르기)

https://www.acmicpc.net/problem/2579 import java.util.Scanner; public class a2579 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num+1]; for(int i=1; i
공부/알고리즘 2017. 8. 21. 14:08
BEAKJOON JAVA ALGORITHM #1912(연속합)

https://www.acmicpc.net/problem/1912 import java.util.Scanner; public class a1912 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num]; for(int i=0; i
공부/알고리즘 2017. 8. 21. 14:06
Prev 1 2 3 4 ··· 9 Next