# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362722 | nighthallo | 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"
//4분할을 하는 건 맞음 -> 1개짜리로 4개 보는것보다, 4개 한번, 2개 2번으로 해결 가능
//d = (a + b + c + d) - (a + b) - (a + c) + a
void findTreasure (int N) {
int arr[101][101];
int mid = (int)(N/2)
for(int i = 1 ; i <= N ; i++){
for(int j = 1 ; j <= N ; j++){
arr[i][j] = countTreasure(1, 1, i, j);
}
}
for(int i = 1 ; i <= N ; i++){
for(int j = 1 ; j <= N ; j++){
if (arr[i][j] - arr[i-1][j] - arr[i][j-1] + arr[i-1][j-1]){
Report(i, j);
}
}
}
}