# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77696 | MohamedAhmed0 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 4 ms | 848 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)
{
int arr[N+1][N+1] ;
for(int i = 1 ; i <= N ; ++i)
{
for(int j = 1 ; j <= N ; ++j)
arr[i][j] = countTreasure(i , j , i , j);
}
//int cnt = countTreasure(1, 1, N, N);
//if(cnt > 0) Report(1 , 1);
cout<<"END\n";
for(int i = 1 ; i <= N ; ++i)
{
for(int j = 1 ; j <= N ; ++j)
cout<<arr[i][j]<<" ";
cout<<"\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |