시나브로

#include int connect[101][101] = { 0 }; int q = 0; int person_amount = 0; int connect_amount = 0; void search(int list[],int point) { for (int i = 1; i

#include int input[500005] = { 0 }; int num; void quickSort(int first, int last) { int pivot; int i; int j; int temp; if (first < last) { pivot = first; i = first; j = last; while (i < j) { while (input[i] input[pivot]) { j--; } if (i < j) { temp = input[i]; input[i] = input[j]; input[j] = temp; } } temp = input[pivot]; input[pivot] = input[j]; input[j] = temp; quickSort(first, j - 1); quickSort..

#include int start_x = 0; int start_y = 0; int end_x = 0; int end_y = 0; int virtual_reality(int signal,int amount,int x, int y) { if (x == end_x&&end_y == y) return amount; if (signal == 0) { if (x > end_x) return virtual_reality(1, amount + 1, x - 1, y); else return virtual_reality(1, amount + 1, x + 1, y); } else { if (y > end_y) return virtual_reality(0, amount + 1, x, y-1); else return virt..