Submission #1368045


Source Code Expand

#include <stdio.h>
 
struct names {
  int year;
  char name[31];
};

int main() {
  int i, n, q;
  struct names A[51];
  scanf("%d %d",&n, &q);
  for(i=0; i<n; i++) {
    scanf("%d %s", &A[i].year, A[i].name);
  }
  for(i=0; i<n; i++) {
    if(A[i].year > q) break;
  }
  if(q < A[0].year) printf("kogakubu10gokan\n");
  else printf("%s\n",A[i-1].name);
  return 0;
}

Submission Info

Submission Time
Task A - 旧総合研究7号館
User kzyKT
Language C++14 (GCC 5.4.1)
Score 100
Code Size 387 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&n, &q);
                        ^
./Main.cpp:13:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %s", &A[i].year, A[i].name);
                                          ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 43
Set Name Test Cases
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_small_0.txt, 10_small_1.txt, 10_small_2.txt, 10_small_3.txt, 10_small_4.txt, 10_small_5.txt, 10_small_6.txt, 10_small_7.txt, 10_small_8.txt, 10_small_9.txt, 20_large_0.txt, 20_large_1.txt, 20_large_2.txt, 20_large_3.txt, 20_large_4.txt, 20_large_5.txt, 20_large_6.txt, 20_large_7.txt, 20_large_8.txt, 20_large_9.txt, 30_random_0.txt, 30_random_1.txt, 30_random_2.txt, 30_random_3.txt, 30_random_4.txt, 30_random_5.txt, 30_random_6.txt, 30_random_7.txt, 30_random_8.txt, 30_random_9.txt, 40_max_0.txt, 40_max_1.txt, 40_max_2.txt, 40_max_3.txt, 40_max_4.txt, 40_max_5.txt, 40_max_6.txt, 40_max_7.txt, 40_max_8.txt, 40_max_9.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 128 KB
00_sample_01.txt AC 1 ms 128 KB
00_sample_02.txt AC 1 ms 128 KB
10_small_0.txt AC 0 ms 128 KB
10_small_1.txt AC 1 ms 128 KB
10_small_2.txt AC 1 ms 128 KB
10_small_3.txt AC 1 ms 128 KB
10_small_4.txt AC 1 ms 128 KB
10_small_5.txt AC 1 ms 128 KB
10_small_6.txt AC 0 ms 128 KB
10_small_7.txt AC 1 ms 128 KB
10_small_8.txt AC 1 ms 128 KB
10_small_9.txt AC 1 ms 128 KB
20_large_0.txt AC 1 ms 128 KB
20_large_1.txt AC 1 ms 128 KB
20_large_2.txt AC 1 ms 128 KB
20_large_3.txt AC 1 ms 128 KB
20_large_4.txt AC 1 ms 128 KB
20_large_5.txt AC 1 ms 128 KB
20_large_6.txt AC 1 ms 128 KB
20_large_7.txt AC 1 ms 128 KB
20_large_8.txt AC 1 ms 128 KB
20_large_9.txt AC 1 ms 128 KB
30_random_0.txt AC 0 ms 128 KB
30_random_1.txt AC 1 ms 128 KB
30_random_2.txt AC 1 ms 128 KB
30_random_3.txt AC 1 ms 128 KB
30_random_4.txt AC 0 ms 128 KB
30_random_5.txt AC 1 ms 128 KB
30_random_6.txt AC 1 ms 128 KB
30_random_7.txt AC 1 ms 128 KB
30_random_8.txt AC 1 ms 128 KB
30_random_9.txt AC 1 ms 128 KB
40_max_0.txt AC 1 ms 128 KB
40_max_1.txt AC 1 ms 128 KB
40_max_2.txt AC 1 ms 128 KB
40_max_3.txt AC 1 ms 128 KB
40_max_4.txt AC 1 ms 128 KB
40_max_5.txt AC 1 ms 128 KB
40_max_6.txt AC 1 ms 128 KB
40_max_7.txt AC 1 ms 128 KB
40_max_8.txt AC 1 ms 128 KB
40_max_9.txt AC 1 ms 128 KB