프로그래밍

백준 알고리즘 1032번 : 명령 프롬프트 (JAVA)

C++ : https://1nnovator.tistory.com/30 REPOSITORY 1nnovator.tistory.com 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 32 33 34 35 36 37 38 39 40 41 42 43 44 package java_algorithm; import java.util.Scanner; public class Baekjoon_1032 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); String[] str = new Strin..

백준 알고리즘 1026번 : 보물 (JAVA)

C++ : https://1nnovator.tistory.com/29 REPOSITORY 1nnovator.tistory.com 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 32 33 34 35 36 37 38 39 40 41 42 43 44 package java_algorithm; import java.util.Arrays; import java.util.Collections; import java.util.Scanner; public class Baekjoon_1026 { public static void main(String[] args) { Scanner sc = new Scanner(Sys..

백준 알고리즘 1037번 : 약수 (C++)

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 #include using namespace std; int main() { // https://www.acmicpc.net/problem/1037 int n, temp; scanf("%d",&n); int p[50]; for(int i=0; i

백준 알고리즘 1032번 : 명령 프롬프트 (C++)

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 32 33 #include #include using namespace std; int main() { // https://www.acmicpc.net/problem/1032 int n; scanf("%d", &n); string str[50]; for(int i=0; i> str[i]; } char c; for(int i=0; i

백준 알고리즘 1026번 : 보물 (C++)

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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 #include using namespace std; int main() { // https://www.acmicpc.net/problem/1026 int n, temp, sum = 0; int a[50]; int b[50]; scanf("%d",&n); for(int i=0; i