# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116228 | emilem | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "treasure.h"
#include <vector>
void FindTreasure(int n)
{
std::vector< std::vector<int> > pref(n + 1, std::vector<int>(n + 1, 0));
for (size_t i = 1; i <= n; ++i)
for (size_t j = 1; j <= n; ++j)
pref[i][j] = CountTreasure(1, 1, i, j);
for (size_t i = 1; i <= n; ++i)
for (size_t j = 1; j <= n; ++j)
if (pref[i][j] - pref[i - 1][j] - pref[i][j - 1] + pref[i - 1][j - 1])
Report(i, j);
}