# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43501 | Hassoony | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 644 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<bits/stdc++.h>
#include "treasure.h"
using namespace std;
typedef long long ll;
const int MX=102;
int grid[MX][MX],n;
void findTreasure (int N) {
n=N;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
grid[i][j]=countTreasure(1,1,i,j);
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(grid[i][j]-grid[i-1][j]-grid[i][j-1]+grid[i-1][j-1])Report(i,j);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |