Submission #1159517

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159517		Doncho_Bonboncho	Treasure (different grader from official contest) (CEOI13_treasure2)	C++20	10 / 100	0 ms	328 KiB

treasure

#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include "treasure.h"

typedef long long ll;


const int MAX_N = 128;
bool oke[MAX_N][MAX_N];
void findTreasure( int n ){
    for( int i=1 ; i <= n ; i++ ){
        for( int j=1 ; j <= n ; j++ ){
            if( countTreasure( i, j, i, j ) ) oke[i][j] = true;
        }
    }

    for( int i=1 ; i <= n ; i++ ){
        for( int j=1 ; j <= n ; j++ ){
            if( oke[i][j] ) Report( i, j );
        }
    }
}

• Subtask 1: 10 / 100