제출 #4901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
4901		gs13068	Treasure (different grader from official contest) (CEOI13_treasure2)	C++98	0 / 100	0 ms	1224 KiB

treasure

#include"treasure.h"

int arr[101][101];

void findTreasure(int n)
{
  int i,j;
  for(i=1;i<=n;i++)for(j=1;j<=n;j++)
  {
    if(i<n/2)
    {
      if(j<n/2)
        arr[i][j]=countTreasure(i,j,n,n)+countTreasure(i+1,j+1,n,n)-countTreasure(i+1,j,n,n)-countTreasure(i,j+1,n,n);
      else
        arr[i][j]=countTreasure(i,1,n,j)+countTreasure(i+1,1,n,j-1)-countTreasure(i+1,1,n,j)-countTreasure(i,1,n,j-1);
    }
    else
    {
      if(j<n/2)
        arr[i][j]=countTreasure(1,1,i,j)+countTreasure(1,1,i-1,j-1)-countTreasure(1,1,i-1,j)-countTreasure(1,1,i,j-1);
      else
        arr[i][j]=countTreasure(1,1,i,j)+countTreasure(1,1,i-1,j-1)-countTreasure(1,1,i-1,j)-countTreasure(1,1,i,j-1);
    }
  }
  for(i=1;i<=n;i++)for(j=1;j<=n;j++)if(arr[i][j])Report(i,j);
}

컴파일 시 표준 에러 (stderr) 메시지

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)");
                                  ^

• Subtask 1: 0 / 100