:: ADVANCE ::

dovelet 16 단계 DFS 단지 번호 붙이기 / danji http://59.23.113.171/30stair/danji/danji.php?pname=danji 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 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 #include int map[50][50]; int danji[50][50]; int total = 1; int count[50]; void dfs(in..

dovelet 21 단계 DP SCV 자원채취 / SCV http://59.23.113.171/30stair/scv/scv.php?pname=scv 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 #include int map[110][110]; int scv[110][110]; int main(void) { int n, i, j; scanf("%d", &n); for (i = 1; i

dovelet 3 단계 for 소다수 (ncpc_soda) http://59.23.113.171/30stair/ncpc_soda/ncpc_soda.php?pname=ncpc_soda 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 #include int main(void) { int have, pick, need, temp; int namerge = 0, mok = 0, drink = 0; scanf("%d%d%d", &have, &pick, &need); mok = (have + pick) / need; namerge = (have + pick) % need; while (mok != 0) { drink += mok; temp = mok + name..