Submission #172535


Source Code Expand

Copy
#include <stdio.h>
#include <stdlib.h>

int i,j,k;

int main(){
  int r,c,d;
  int f;
  int max = 0;
  scanf("%d %d %d",&r, &c, &d);  
  int a[1000][1000];
  f=d%2;
  for(i=0;i<r;i++){
    for(j=0;j<c;j++){
      scanf("%d",&a[i][j]);
      if(j%2==f+i%2 && i+j <= d){
	if(max<a[i][j]){
	  max = a[i][j];
	}
      }
    }
  }

  printf("%d\n",max);
  return 0;
}

Submission Info

Submission Time
Task B - 謎の人物X
User Tanix
Language C (GCC 4.6.4)
Score 0
Code Size 387 Byte
Status WA
Exec Time 167 ms
Memory 4636 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:10:8: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:15:12: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 60 0 / 40
Status
AC × 3
AC × 14
WA × 4
AC × 24
WA × 6
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Subtask2 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt
Case Name Status Exec Time Memory
sample_01.txt AC 20 ms 676 KB
sample_02.txt AC 20 ms 792 KB
sample_03.txt AC 22 ms 668 KB
subtask1_01.txt AC 22 ms 792 KB
subtask1_02.txt WA 21 ms 792 KB
subtask1_03.txt AC 22 ms 1132 KB
subtask1_04.txt AC 22 ms 1064 KB
subtask1_05.txt AC 21 ms 796 KB
subtask1_06.txt WA 22 ms 920 KB
subtask1_07.txt AC 22 ms 1172 KB
subtask1_08.txt AC 22 ms 1180 KB
subtask1_09.txt AC 21 ms 1064 KB
subtask1_10.txt WA 22 ms 1060 KB
subtask1_11.txt AC 24 ms 1044 KB
subtask1_12.txt AC 22 ms 1176 KB
subtask1_13.txt AC 24 ms 1052 KB
subtask1_14.txt AC 22 ms 1176 KB
subtask1_15.txt WA 20 ms 1176 KB
subtask2_01.txt WA 21 ms 796 KB
subtask2_02.txt WA 26 ms 4636 KB
subtask2_03.txt AC 64 ms 2468 KB
subtask2_04.txt AC 20 ms 716 KB
subtask2_05.txt AC 24 ms 1172 KB
subtask2_06.txt AC 45 ms 1584 KB
subtask2_07.txt AC 149 ms 4524 KB
subtask2_08.txt AC 166 ms 4516 KB
subtask2_09.txt AC 163 ms 4512 KB
subtask2_10.txt AC 167 ms 4520 KB
subtask2_11.txt AC 161 ms 4520 KB
subtask2_12.txt AC 167 ms 4632 KB
subtask2_13.txt AC 162 ms 4524 KB
subtask2_14.txt AC 166 ms 4516 KB
subtask2_15.txt AC 166 ms 4524 KB