# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475712 | soba | 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"
#include <bits/stdc++.h>
//#include "grader.c"
void findTreasure (int N) {
int grid[N+1][N+1];
int prfx[N+1][N+1]={0};
int cnt , ans;
for(int i = 1 ; i <=N ; i++)
{
for(int j = 1 ; j <= N ; j++)
{
cout << 1 << " " << 1 << " "<< i << " " << j << "\n";
cout.flush();
cin >>cnt;
prfx[i][j]=cnt;
grid[i][j]=prfx[i][j]-prfx[i-1][j]-prfx[i][j-1]+prfx[i-1][j-1];
}
}
cout <<"END\n"
cout.flush();
for(int i = 1 ; i <= N ; i++ )
{
for(int j =1 ; j <= N ; j++)
{
cout << grid[i][j];
}
cout << "\n";
}
cout.flush();
}