시나브로

#include int main() { int test_case = 0; scanf("%d", &test_case); for (int q = 0; q < test_case; q++) { long long layer = 0; scanf("%d", &layer); long long box = 2 * (layer - 1)*(layer - 1) + 1; printf("#%lld %lld %lld\n",q+1 ,box, box + 4*(layer - 1)); } return 0; }

#include int tree[3000]; int each_depth[12][1025]; int each_depth_index[12]; int max_depth = 0; int squeared_2[11] = { 0 }; void seach_depth(int start, int end, int depth) { if (depth > max_depth) return; int box = (end-start) / 2; each_depth[depth][each_depth_index[depth]++] = tree[start + box]; seach_depth(start, start + box - 1, depth + 1); seach_depth(start + box+1, end, depth + 1); } int ma..

#include int main() { int test_case = 0; scanf("%d", &test_case); for (int q = 0; q < test_case; q++) { int N = 0; int K = 0; scanf("%d %d", &N, &K); printf("#%d ",q+1); if (N % 2 != 0) { int box = (N+1)*K; int box1 = (N + 1)*K; box = (box*(box + 1)) / (2 * K); for (int i = 0; i < K; i++) { printf("%d ", box-box1); box1--; } } else { int box = N*K; box = (box*(box + 1)) / (2 * K); for (int i = 0..

#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 =..