# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321078 | monus1042 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 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"
#include <bits/stdc++.h>
using namespace std;
int ans[105][105];
void findTreasure (int N) {
//int cnt = countTreasure(1, 1, N, N);
//if(cnt > 0) Report (1, 1);
ans[1][1] = countTreasure(1,1, 1,1);
for (int i=1; i<=N; i++){
for (int j=1; j<=N; j++){
if (j==i && j == 1) continue;
int acc = 0;
for (int k=1; k<=i; k++){
for (int l=1; l<=j; l++){
acc += acc[k][l];
}
}
/*for (int k=1; k<=i; k++){
for (int l=1; l<=j - 1; l++){
acc -= acc[k][l];
}
}
for (int k=1; k<=i - 1; k++){
for (int l=1; l<=j; l++){
acc -= acc[k][l];
}
}
for (int k=1; k<=i - 1; k++){
for (int l=1; l<=j - 1; l++){
acc += acc[k][l];
}
}*/
ans[i][j] = countTreasue(1,1, i,j) - acc;
}
}
for (int i=1; i<=N; i++){
for (int j=1; j<=N; j++){
if (ans[i][j]) Report(i,j);
}
}
}