목록분류 전체보기 (172)

시나브로

[D5] 7812. 옥희의 OK! 부동산

#include int main() { int test_case = 0; scanf("%d", &test_case); for (int q = 0; q < test_case; q++) { int soil_length = 0; int add_money = 0; int money = 0; int soil[10000] = { 0 }; int paper_amount = 0; scanf("%d %d", &soil_length, &money); for (int i = 0; i < soil_length; i++) scanf("%d", &soil[i]); for (int i = 0; i < soil_length; i++) { add_money = 0; for (int j = i; j < soil_length; j++) ..
알고리즘/SW Expert Academy 2019. 10. 6. 11:00
[D6] 1263. [S/W 문제해결 응용] 8일차 - 사람 네트워크2

#include #include #include using namespace std; int graph[1020][1020] = { 0 }; int main(void) { int test_case = 0; scanf("%d", &test_case); for (int i = 0; i < test_case; i++) { int person_number = 0; scanf("%d", &person_number); for (int n = 0; n < person_number; n++) { for (int m = 0; m < person_number; m++) { scanf("%d", &graph[n][m]); if (graph[n][m] == 0) graph[n][m] = 100000; if (n == m) g..
알고리즘/SW Expert Academy 2019. 10. 6. 11:00
[D5] 1256. [S/W 문제해결 응용] 6일차 - K번째 접미어

#include #include #include using namespace std; int count_number[10000] = { 0 }; typedef struct same { char charater; char next_charater; char next_next_charater; char next_next_next_charater; int index; }same; int compare(const void *a, const void *b) // 오름차순 비교 함수 구현 { same p1 = *(same *)a; same p2 = *(same *)b; if (p1.charater p2.charater) retu..
알고리즘/SW Expert Academy 2019. 10. 6. 10:59
[D4] 5432. 쇠막대기 자르기

#include #include #include #include #include using namespace std; int main(void) { int test_case = 0; char buffer = 0; scanf("%d", &test_case); scanf("%c", &buffer); for (int i = 0; i < test_case; i++) { char words[100010] = { 0 }; for (int j=0;;j++) { scanf("%c", &words[j]); if (words[j] == '\n') break; } char before = 0; int open = 0; int number = 0; for (int j = 0;; j++) { if (words[j] == '\n..
알고리즘/SW Expert Academy 2019. 10. 6. 10:58
Prev 1 ··· 38 39 40 41 42 43 Next