cgy12306

// https://www.acmicpc.net/problem/6588 // 골드바흐의 추측 #include #include #include using namespace std; bool arr[1000001] = {false, false,}; bool is_prime(int num) { for (int i = 2; i*i > num; if (num == 0) break; left = 3; right = num - 3; while (left right) cout

// https://www.acmicpc.net/problem/4948 // 베르트랑 공준 #include using namespace std; bool is_prime(int num) { if (num == 1) return false; for (int i = 2; i*i > N; int cnt = 0; if (N == 0) break; for (int i = N + 1; i

// https://www.acmicpc.net/problem/16496 // 큰 수 만들기 #include #include #include #include using namespace std; bool cmp(string a, string b) { return a + b > b + a; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N; vector vs; cin >> N; for (int i = 0; i > s; vs.push_back(s); } sort(vs.begin(), vs.end(), cmp); string res; for (int i = 0; i <..

// https://www.acmicpc.net/problem/17141 // 연구소 2 #include #include #include #include #include using namespace std; int N, map[51][51], tmap[51][51], M, res = 99999999, Max = 0; bool visited[51][51], vmap[51][51]; int dx[] = {-1, 1 ,0 ,0}; int dy[] = {0, 0, -1, 1}; queue que; vector virus; vector check; void bfs(int x, int y) { while (!que.empty()) { x = que.front().first; y = que.front().second..

// https://www.acmicpc.net/problem/3079 // 입국심사 #include #include using namespace std; int N, M; long long T[100001]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N >> M; long long m = 0; for (int i = 0; i > T[i]; m = max(T[i], m); } long long right = m * M; long long left = 0; long long answer = 0; while (left

// https://www.acmicpc.net/problem/14502 // 연구소 #include #include #include #include #include using namespace std; int res = 0; int N, M, map[9][9], tmp[9][9]; bool visited[9][9], vtmp[9][9]; int dx[] = {-1, 1 , 0, 0}; int dy[] = {0, 0, -1, 1}; vector check; vector new_wall; queue q; void print() { cout > M; for (int i = 0; i > map[i][j]; if (map[i][..

// https://www.acmicpc.net/problem/15686 // 치킨 배달 #include #include #include using namespace std; int N, M, map[51][51], dist = 987654321, res = 987654321; vector store; vector home; vector open; int distance(int x1, int y1, int x2, int y2) { return abs(x1 - x2) + abs(y1 - y2); } void brute_force() { for (int i = 0; i < M; i++) { open[i] = 1; } sort(open.begin(), open.end()); do { int sum = 0; f..

// https://www.acmicpc.net/problem/14890 // 경사로 // reference by wizely #include #include using namespace std; int N, L; int map[101][101] = { 0, }; int res = 0; void checkX(int x) { int cnt = 1; for (int j = 0; j = L) cnt = 1; // 경사가 내려막길일 경우 cnt를 -L..

// https://www.acmicpc.net/problem/14499 // 주사위 굴리기 #include #include using namespace std; int N, M, x, y, K; int map[21][21]; int dice[8]; int tmpdice[8]; int dx[] = {0, 0, 0, -1, 1}; int dy[] = {0, 1, -1, 0, 0}; void roll(int cmd) { memcpy(tmpdice, dice, sizeof(dice)); // 동 if (cmd == 1) { dice[1] = tmpdice[3]; dice[3] = tmpdice[6]; dice[4] = tmpdice[1]; dice[6] = tmpdice[4]; } // 서 else if (c..

// https://www.acmicpc.net/problem/13458 // 시험 감독 #include using namespace std; int arr[1000001]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, B, C; cin >> N; for (int i = 0; i > arr[i]; } cin >> B >> C; long long cnt = 0; for (int i = 0; i 0) { cnt += arr[i] / C; if (arr[i] % C > 0) cnt++; } } cout