:: ADVANCE ::

dovelet 옥상 색종이 (koi_Mpaper) http://59.23.113.171/pool/koi_Mpaper/koi_Mpaper.php?pname=koi_Mpaper 123456789101112131415161718192021222324252627282930313233343536#include int map[110][110];int cnt; int main(void){ int n, i, x, y, j; scanf("%d", &n); while (n--) { scanf("%d%d", &x, &y); for (i = 0; i

dovelet 3 단계 For 최대공약수, 최소공배수 / gcd_lcm http://59.23.113.171/30stair/gcd_lcm/gcd_lcm.php?pname=gcd_lcm 1234567891011121314151617181920212223242526272829303132333435363738394041#include int gcd(int n, int m){ int temp; while (n != m) { if (n > m) { temp = n; n = m; m = temp; } temp = n; n = m - n; m = temp; } return n;} int lcm(int n, int m){ int i = 1, temp = n; while (temp % m != 0) { temp = n ..

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