Submission #6405944


Source Code Expand

#include <cstdio>
#include <stdio.h>

int n,m,k,i,o,max,a;

int Max(int a,int b)
{return(a>b?a:b);}

int main()
{
	scanf("%d %d %d",&n,&m,&k);
	for(i=0;i<n;++i)
		for(o=0;o<m;++o)
		{
			scanf("%d",&a);
			if(i+o<=k&&(k%2)==((i+o)%2))
				max=Max(a,max);
		}
	printf("%d\n",max);
}

Submission Info

Submission Time
Task B - 謎の人物X
User luogu_bot4
Language C++14 (GCC 5.4.1)
Score 100
Code Size 300 Byte
Status AC
Exec Time 81 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&m,&k);
                            ^
./Main.cpp:15:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&a);
                  ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 60 / 60 40 / 40
Status
AC × 3
AC × 18
AC × 33
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 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_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 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
subtask1_01.txt AC 1 ms 128 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 1 ms 128 KB
subtask1_04.txt AC 1 ms 128 KB
subtask1_05.txt AC 1 ms 128 KB
subtask1_06.txt AC 1 ms 128 KB
subtask1_07.txt AC 1 ms 128 KB
subtask1_08.txt AC 1 ms 128 KB
subtask1_09.txt AC 1 ms 128 KB
subtask1_10.txt AC 1 ms 128 KB
subtask1_11.txt AC 1 ms 128 KB
subtask1_12.txt AC 1 ms 128 KB
subtask1_13.txt AC 1 ms 128 KB
subtask1_14.txt AC 1 ms 128 KB
subtask1_15.txt AC 1 ms 128 KB
subtask2_01.txt AC 1 ms 128 KB
subtask2_02.txt AC 1 ms 128 KB
subtask2_03.txt AC 26 ms 128 KB
subtask2_04.txt AC 1 ms 128 KB
subtask2_05.txt AC 4 ms 128 KB
subtask2_06.txt AC 14 ms 128 KB
subtask2_07.txt AC 72 ms 128 KB
subtask2_08.txt AC 80 ms 128 KB
subtask2_09.txt AC 80 ms 128 KB
subtask2_10.txt AC 80 ms 128 KB
subtask2_11.txt AC 75 ms 128 KB
subtask2_12.txt AC 80 ms 128 KB
subtask2_13.txt AC 80 ms 128 KB
subtask2_14.txt AC 81 ms 128 KB
subtask2_15.txt AC 81 ms 128 KB