알고리즘/그리디 알고리즘34 1507 궁금한 민호 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647 #include int arr[30][30] = { 0 };int check[30][30] = { 0 }; int main() { int n; scanf("%d", &n); for (int i = 0; i 2019. 6. 27. 1343 폴리노미오 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374#include char arr[600] = { 0 };char rst[600] = { 0 }; int main() { scanf("%s", &arr); int len = 0; int xNum = 0, comN = 0, rstIdx=0; for (int i = 0; i 2019. 6. 27. 1783 병든 나이트 123456789101112131415161718192021222324252627282930#include int main() { int y, x; scanf("%d %d", &y, &x); if (y == 1) { printf("1"); } else if (y == 2) { if (x 2019. 6. 27. 1138 한 줄로 서기 123456789101112131415161718192021222324252627#include int rst[15] = { 0 }; int main() { int n; scanf("%d", &n); for (int i = 1; i 2019. 6. 27. 2437 저울 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465#include int arr[10000000] = { 0 }; void qSort(int start, int end) { int l = start + 1, r = end; int num = arr[start]; do { while (arr[l] 2019. 6. 27. 1080 행렬 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061#include int arr[51][51] = { 0 }, brr[51][51] = { 0 }, crr[51][51] = { 0 }; void change(int y, int x) { for (int i = y; i 2019. 6. 23. 1541 잃어버린 괄호 1234567891011121314151617181920212223242526272829303132333435#include #include int main() { char arr[51]; scanf("%s", &arr); int flag = 0, num = 0, rst = 0, minus = 0, prev = 0; for (int i = 0; i 2019. 6. 23. 1049 기타줄 123456789101112131415161718192021222324252627282930313233#include int main() { int n, m; scanf("%d %d", &n, &m); int line[51][2] = { 0 }; int min6 = 1000, min1 = 1000; for (int i = 0; i line[i][0]) min6 = line[i][0]; if (min1 > line[i][1]) min1 = line[i][1]; } if (min6 > 6 * min1) min6 = 6 * min1; int rst1 = 0; rst1 += (n / 6) * min6; rst1 += (n % 6) * min1; int rst2; rst2 = (n / 6 + 1) * min6; .. 2019. 6. 23. 1120 문자열 (심화-KMP) 12345678910111213141516171819202122232425262728293031323334#include #include int main() { char strA[51], strB[51]; scanf("%s %s", &strA, &strB); int rst = 100; if (strlen(strA) 2019. 6. 23. 10610 30 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354#include #include char arr[100001] = { 0 };int num[100001]; void qSort(int left, int right) { int l = left + 1, r = right, pivot = num[left]; do { while (num[l] 2019. 6. 22. 2217 로프 123456789101112131415161718192021222324252627282930313233343536373839404142#include int arr[100001] = { 0 }; void qSort(int left, int right) { int l = left + 1, r = right, num=arr[left]; do { while (arr[l] 2019. 6. 22. 5585 거스름돈 1234567891011121314151617181920#include int money[6] = { 500,100,50,10,5,1 }; int main() { int total, idx = 0, rst = 0; scanf("%d", &total); total = 1000 - total; while (idx = money[idx]) { total -= money[idx]; rst++; } idx++; } printf("%d", rst);}Colored by Color Scriptercs 2019. 6. 22. 이전 1 2 3 다음