| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | |||||
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 |
| 24 | 25 | 26 | 27 | 28 | 29 | 30 |
| 31 |
- priorityqueue
- SQL
- SWEA
- 투포인터
- MySQL
- greedy
- 운동기록
- COS PRO
- 문제해결
- dfs
- 시뮬레이션
- binary search
- oracle
- DP
- 이분탐색
- BFS
- 문제풀이
- 문자열
- 백준
- math
- 프로그래머스
- BOJ
- Java
- 알고리즘
- db
- 코테
- 코딩테스트
- 러닝일지
- 건강
- 자바
- Today
- Total
목록Java (469)
슈콩
[문제]https://www.acmicpc.net/problem/2748 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); long[] dp = new long[n+1]; dp[1] = 1; for(int i=2;i
계단을 연속으로 3칸 밟을 수 없다(제약조건) : 1,2 연속으로 몇 계단을 밟았는지 정보를 Check! [문제]https://www.acmicpc.net/problem/2579 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[] stair = new int[n+1]; int[][] dp =..
[백준]https://www.acmicpc.net/problem/2482 [소스코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int k = Integer.parseInt(br.readLine()); int[][] dp = new int[n+1][k+1]; for(int i=1;i
[문제]https://www.acmicpc.net/problem/2302 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int m = Integer.parseInt(br.readLine()); int[] dp = new int[n+1]; if(n==1) { System.out.pr..
[문제]https://www.acmicpc.net/problem/2294 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n= Integer.parseInt(st.nextToken()); int k = Integer.parseInt(st.nextToken()); ..
[문제]https://www.acmicpc.net/problem/2293 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int n = Integer.parseInt(st.nextToken()); int k = Integer.parseInt(st.nextToken());..
[문제]https://www.acmicpc.net/problem/2240 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); int t = Integer.parseInt(st.nextToken()); int w = Integer.parseInt(st.nextToken());..
[문제]https://www.acmicpc.net/problem/2193 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); long[][] dp = new long[n+1][2]; dp[1][1] = 1; for(int i=2;i
[문제]https://www.acmicpc.net/problem/2156 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[] juice = new int[n+1]; int[][] dp = new int[n+1][3]; for(int i=1;i
[문제]https://www.acmicpc.net/problem/2133 [소스 코드]import java.io.*;import java.util.*;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[] dp = new int[n+1]; dp[0] = 1; for(int i=2;i=0;j-=2) { dp[i] += dp[j] * 2; } ..