# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471076 | 2021-09-07T02:40:38 Z | chointae | Treasure (different grader from official contest) (CEOI13_treasure2) | C | 0 ms | 0 KB |
#include "treasure.h" void findTreasure (int N) { int MAXN = 101; int reportlist[MAXN * MAXN][2]; int index = 0; int total = countTreasure(1, 1, N, N); // 세로 for (int c = N - 1; c > 0; c--) { int cnt = countTreasure(1, 1, N, c); int find = total - cnt; total = total - find; for (int i = 1; i <= N; i++) { if (countTreasure(1, 1, i, c)) { reportlist[index][0] = i; reportlist[index][1] = c; index++; find--; if (find == 0) break; } } if (total == 0) break; } for (int i = 0; i < index; i++) Report(reportlist[i][0], reportlist[i][1]); }