Submission #172555


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];
  for(i=0;i<r;i++){
    for(j=0;j<c;j++){
      scanf("%d",&a[i][j]);
      if(i+j > d)
	a[i][j]=0;
    }
  }
 
  //printf("開始\n");
  f=d%2;
  for(i=0;i<r;i++){
    //printf("%d行\n",i);
    for(j=(f+i)%2;j<c;j+=2){
      //printf("%d列\n",j);
      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 100
Code Size 531 Byte
Status AC
Exec Time 252 ms
Memory 4912 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:14: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 60 / 60 40 / 40
Status
AC × 3
AC × 18
AC × 30
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 92 ms 948 KB
sample_02.txt AC 30 ms 976 KB
sample_03.txt AC 29 ms 940 KB
subtask1_01.txt AC 28 ms 1004 KB
subtask1_02.txt AC 29 ms 944 KB
subtask1_03.txt AC 29 ms 1320 KB
subtask1_04.txt AC 28 ms 1320 KB
subtask1_05.txt AC 91 ms 932 KB
subtask1_06.txt AC 28 ms 1188 KB
subtask1_07.txt AC 29 ms 1320 KB
subtask1_08.txt AC 30 ms 1324 KB
subtask1_09.txt AC 30 ms 1316 KB
subtask1_10.txt AC 31 ms 1328 KB
subtask1_11.txt AC 32 ms 1324 KB
subtask1_12.txt AC 30 ms 1324 KB
subtask1_13.txt AC 33 ms 1316 KB
subtask1_14.txt AC 33 ms 1320 KB
subtask1_15.txt AC 32 ms 1308 KB
subtask2_01.txt AC 29 ms 940 KB
subtask2_02.txt AC 33 ms 4912 KB
subtask2_03.txt AC 73 ms 2728 KB
subtask2_04.txt AC 30 ms 1060 KB
subtask2_05.txt AC 252 ms 1312 KB
subtask2_06.txt AC 52 ms 1956 KB
subtask2_07.txt AC 155 ms 4904 KB
subtask2_08.txt AC 206 ms 4904 KB
subtask2_09.txt AC 210 ms 4900 KB
subtask2_10.txt AC 211 ms 4904 KB
subtask2_11.txt AC 185 ms 4900 KB
subtask2_12.txt AC 204 ms 4904 KB
subtask2_13.txt AC 209 ms 4904 KB
subtask2_14.txt AC 206 ms 4904 KB
subtask2_15.txt AC 216 ms 4896 KB