소스
-
BOJ 10799번 쇠막대기백준 2020. 5. 11. 17:18
BOJ 10799번 쇠막대기 문제링크 : https://www.acmicpc.net/problem/10799 제출링크 : https://www.acmicpc.net/source/19727524 CPP 소스 : https://github.com/skysign/WSAPT/blob/master/BOJ/10799%EB%B2%88%20%EC%87%A0%EB%A7%89%EB%8C%80%EA%B8%B0/10799%EB%B2%88%20%EC%87%A0%EB%A7%89%EB%8C%80%EA%B8%B0.cpp
-
BOJ 17413번 단어 뒤집기 2백준 2020. 5. 11. 16:23
문제링크 : https://www.acmicpc.net/problem/17413 제출링크 : https://www.acmicpc.net/source/19726366 CPP소스 : https://github.com/skysign/WSAPT/blob/master/BOJ/17413%EB%B2%88%20%EB%8B%A8%EC%96%B4%20%EB%92%A4%EC%A7%91%EA%B8%B0%202/17413%EB%B2%88%20%EB%8B%A8%EC%96%B4%20%EB%92%A4%EC%A7%91%EA%B8%B0%202.cpp
-
BOJ 9663번 N-Queen백준 2020. 5. 7. 17:11
문제링크 : https://www.acmicpc.net/problem/9663 제출링크 : https://www.acmicpc.net/source/19653593 자바코드 : https://github.com/skysign/WSAPT/blob/master/BOJ/9663%EB%B2%88%20N-Queen/src/Main.java BOJ 9663번 N-Queen 1/2 BOJ 9663번 N-Queen 2/2 import java.io.BufferedWriter; import java.io.IOException; import java.io.OutputStreamWriter; import java.io.DataInputStream; import java.io.FileInputStream; import java..
-
BOJ 11726번 2×n 타일링백준 2020. 1. 27. 23:03
문제링크 : https://www.acmicpc.net/problem/11726 제출링크 : https://www.acmicpc.net/source/17183178 자바 소스 : https://github.com/skysign/WSAPT/blob/master/BOJ/11726%EB%B2%88%202%C3%97n%20%ED%83%80%EC%9D%BC%EB%A7%81/src/Main.java import java.util.Scanner; public class Main { public void solve() { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] d = new int[N+1]; d[1] = 1; if(N>=2) d[2] = 2;..
-
1463번 1로 만들기 / BOJ / acmicpc.net백준 2020. 1. 27. 22:38
문제링크 : https://www.acmicpc.net/problem/1463 제출링크 : https://www.acmicpc.net/source/17152022 import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] dp = new int[N+1]; for(int n=2; n