Submission #11376

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
11376	2014-11-22T08:52:10 Z	dohyun0324	Treasure (different grader from official contest) (CEOI13_treasure2)	C++	Compilation error	0 ms	0 KB

treasure

#include "treasure.h"
int a[110][110];
void findTreasure (int N) {
    int i,j;
    for(i=N;i>=1;i--)
    {
        for(j=N;j>=1;j--)
        {
            if(i>N/2 && j>N/2) a[i][j]=countTreasure(1,1,i,j);
            if(i<=N/2 && j>N/2) a[i][j]=a[N][j]-countTreasure(i+1,N,1,j);
            if(i>N/2 && j<=N/2) a[i][j]=a[i][N]-countTreasure(1,i,j+1,N);
            if(i<=N/2 && j<=N/2) a[i][j]=counTreasure(i+1,j+1,N,N)+a[i][N]+a[N][j]-a[N][N];
        }
    }
    for(i=1;i<=N;i++)
    {
        for(j=1;j<=N;j++)
        {
            if(a[i][j]-a[i-1][j]-a[i][j-1]+a[i-1][j-1]) Report(i,j);
        }
    }
}

Compilation message

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^
treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:12:66: error: 'counTreasure' was not declared in this scope
             if(i<=N/2 && j<=N/2) a[i][j]=counTreasure(i+1,j+1,N,N)+a[i][N]+a[N][j]-a[N][N];
                                                                  ^