:: ADVANCE ::
[dovelet][DFS] 최단 거리 미로 / maze
dovelet 16 단계 DFS 최단 거리 미로 / maze http://59.23.113.171/30stair/maze/maze.php?pname=maze 1234567891011121314151617181920212223242526272829303132333435363738394041424344#include int n, m, min = 9999;char map[25][25]; void dfs(int y, int x, int cnt){ if (y == 1 && x == m) { if (min > cnt) min = cnt; return; } map[y][x] = '1'; if (map[y - 1][x] == '0') dfs(y - 1, x, cnt + 1); if (map[y][x - 1] == '0..
[dovelet][수학] 술 취한 간수 / jailer
dovelet 29 단계 수학 술 취한 간수 / jailer http://59.23.113.171/30stair/jailer/jailer.php?pname=jailer 12345678910111213141516171819202122232425#include int main(void){ int n, i, j, cnt = 0; int check[110] = { 0, }; scanf("%d", &n); for (i = 1; i
[ALGOSPOT][stack] Mismatched Brackets
ALGOSPOT stack Mismatched Brackets https://algospot.com/judge/problem/read/BRACKETS2 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 #include #include char input[50]; char stack[50]; int out[50]; int main(void) { int i, result = 0, n = 0, index = 0; gets(input); for (i = 0; i