https://www.acmicpc.net/problem/13458 13458번: 시험 감독 첫째 줄에 시험장의 개수 N(1 ≤ N ≤ 1,000,000)이 주어진다. 둘째 줄에는 각 시험장에 있는 응시자의 수 Ai (1 ≤ Ai ≤ 1,000,000)가 주어진다. 셋째 줄에는 B와 C가 주어진다. (1 ≤ B, C ≤ 1,000,000) www.acmicpc.net #include #include using namespace std; #define MAXN 1000000 int N, B, C; int test[MAXN + 10]; void Input(void) { cin >> N; for (int i = 0; i > test[i]; } cin >> B >> C; } voi..

https://www.acmicpc.net/problem/14499 14499번: 주사위 굴리기 첫째 줄에 지도의 세로 크기 N, 가로 크기 M (1 ≤ N, M ≤ 20), 주사위를 놓은 곳의 좌표 x, y(0 ≤ x ≤ N-1, 0 ≤ y ≤ M-1), 그리고 명령의 개수 K (1 ≤ K ≤ 1,000)가 주어진다. 둘째 줄부터 N개의 줄에 지 www.acmicpc.net #include #include #include using namespace std; #define MAXN 20 #define MAXN2 1000 int dice[4][3] = { 0, };// 주사위면에 적혀있는 숫자 static int dr[] = { 0, 0, 0, -1, 1 }; static int dc[] = { 0, 1..

오늘부터 하루에 한두문제씩 개별적으로 알고리즘 문제를 풀어보려고 합니다! #include #include using namespace std; #define MAXN 10 int N, M; int RR, RC, BR, BC; int rcnt, bcnt; char map[MAXN + 5][MAXN + 5]; int visited[MAXN + 5][MAXN + 5][MAXN + 5][MAXN + 5]; struct DATA { int rr, rc, br, bc, t; }; queue q; static int dr[] = { -1, 1, 0, 0 }; static int dc[] = { 0, 0, -1, 1 }; void tilt(int &r, int &c, int &cnt, int i) { for (;;) ..

1. Description Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Constraints: 1

Description Roman numerals are represented by seven different symbols: I, V, X, L, C, Dand M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II. Roman numerals are usually written largest to smallest from left to ri..

Description Given an integer x, return true if x is palindrome integer. An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not. Example 1: Input: x = 121 Output: true Example 2: Input: x = -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome. Example..