목록코테 대비 (19)

시나브로

[D5] 7730. 나무 깎는 홍준

#include int tree[1000000]; int tree_amount = 0; int want_to_tree_amount = 0; int available(int mid) { long long buffer = 0; for (int i =tree_amount-1; i >0; i--) { if (tree[i] > mid) { buffer += tree[i] - mid; } if (tree[i] = want_to_tree_amount) return 1; return 0; } void quickSort(int first, int last) { int pivot; int i; int j; int temp; if (first < last) { pivot =..
알고리즘/SW Expert Academy 2019. 10. 6. 11:02
[D4] 7829. 보물왕 태혁

#include int main(){ int test_case=0; scanf("%d",&test_case); for(int q=0;q
알고리즘/SW Expert Academy 2019. 10. 6. 11:01
[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
Prev 1 2 3 4 5 Next