# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
54666 | gs18115 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 3 ms | 724 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<cstdlib>
#include<vector>
using namespace std;
vector<pair<int,int> >V;
void findTreasure (int N)
{
int i,j;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
if(countTreasure (i,j,i,j))
V.push_back(make_pair(i,j));
for(auto I:V)
Report(I.first,I.second);
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |