:: ADVANCE ::

ALGOSPOT 문자열 암호화 https://www.algospot.com/judge/problem/read/ENCRYPT 123456789101112131415161718192021#include int main(void){ int t, i; scanf("%d", &t); while (t--) { char input[110] = { 0, }; scanf("%s", input); for (i = 0; input[i]; i += 2) printf("%c", input[i]); for (i = 1; input[i]; i += 2) printf("%c", input[i]); printf("\n"); } return 0;}Colored by Color Scriptercs

dovelet 14 단계 BFS 도망간 소를 잡아라 / catch_cow http://59.23.113.171/30stair/catch_cow/catch_cow.php?pname=catch_cow 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include int queue[1000000][2];int visit[1000010]; int main(void){ int start, end; int N, K; scanf("%d%d", &N, &K); if (N == K) { printf("0\n"); return 0; } else if (N > K) { printf("%d\n", N..

dovelet 9 단계 재귀 하노이 탑 (hanoi) http://59.23.113.171/30stair/hanoi/hanoi.php?pname=hanoi 1234567891011121314151617181920212223#include void hanoi(int n, int x, int y, int z){ if (n > 0){ hanoi(n - 1, x, z, y); printf("%d -> %d\n", x, z); hanoi(n - 1, y, x, z); }} int main(void){ int n; scanf("%d", &n); hanoi(n, 1, 2, 3); return 0;}cs 단순히 이동 횟수를 묻는 거라면 2*f(n-1)+1을 재귀로 돌리면 됨이동 경로를 나타내는 문제인데제공된 기본 소스..