# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667882 | 600Mihnea | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 1 ms | 468 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 <bits/stdc++.h>
using namespace std;
void findTreasure(int n)
{
vector<pair<int, int>> sol;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (countTreasure(i, j, i, j))
{
sol.push_back({i, j});
}
}
}
for (auto &it : sol)
{
Report(it.first, it.second);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |