Submission #1623608


Source Code Expand

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

int min(int *data, int length);
int belong_in(int i, int* ng, int length);

int main(int argc, char* argv[])
{
  int n, ng[3];
  int i;
  int* data;
  int* p;
  int max_trial = 100;
  
  scanf("%d", &n);
  for(i = 0; i < 3; ++i){
    scanf("%d", ng + i);
    if(*(ng + i) == n){
      printf("NO\n");
      return 0;
    }
  }
  data = (int *) malloc(n + 3);
  *(data + n + 2) = max_trial;
  *(data + n + 1) = max_trial;
  *(data + n) = 0;
  p = data + n - 1;
  for(i = n - 1; i >= 0; --i, --p){
    if(belong_in(i, ng, 3)){
      *p = max_trial;
    }else{
      *p = min(p + 1, 3) + 1;
    }
    if(*p > max_trial){
      printf("NO\n");
      free(data);
      return 0;
    }
  }

  printf("YES\n");
  free(data);
  return 0;
}

int min(int *data, int length)
{
  int min = *data;
  int* p = data + 1;
  int i;
  for(i = 1; i < length; ++i, ++p){
    min = min > *p ? *p : min;
  }
  return min;
}

int belong_in(int i, int* ng, int length)
{
  int j;
  int* p = ng;
  for(j = 0; j < length; ++j, ++p){
    if(i == *p){
      return 1;
    }
  }
  return 0;
}

Submission Info

Submission Time
Task C - 123引き算
User bocchi
Language C (GCC 5.4.1)
Score 0
Code Size 1169 Byte
Status RE
Exec Time 99 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:15:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ^
./Main.c:17:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", ng + i);
     ^

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 11
RE × 20
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, test_143_142_141_140.txt, test_1_1_2_3.txt, test_1_2_3_4.txt, test_200_200_2_3.txt, test_231_77_78_80.txt, test_235_124_126_125.txt, test_253_45_47_48.txt, test_297_223_224_225.txt, test_297_294_292_290.txt, test_297_297_30_83.txt, test_297_3_43_72.txt, test_298_125_123_124.txt, test_298_293_295_291.txt, test_298_298_4_8.txt, test_298_36_72_98.txt, test_298_55_3_43.txt, test_298_92_91_295.txt, test_299_200_151_65.txt, test_299_240_35_154.txt, test_299_300_299_298.txt, test_299_33_242_151.txt, test_299_56_57_58.txt, test_299_66_132_198.txt, test_300_271_44_68.txt, test_300_299_298_296.txt, test_300_30_99_183.txt, test_300_4_5_6.txt, test_84_34_64_36.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 128 KB
sample_02.txt RE 95 ms 128 KB
sample_03.txt RE 95 ms 128 KB
test_143_142_141_140.txt AC 1 ms 128 KB
test_1_1_2_3.txt AC 0 ms 128 KB
test_1_2_3_4.txt AC 1 ms 128 KB
test_200_200_2_3.txt AC 0 ms 128 KB
test_231_77_78_80.txt RE 96 ms 128 KB
test_235_124_126_125.txt AC 1 ms 128 KB
test_253_45_47_48.txt RE 95 ms 128 KB
test_297_223_224_225.txt AC 1 ms 128 KB
test_297_294_292_290.txt RE 94 ms 128 KB
test_297_297_30_83.txt AC 0 ms 128 KB
test_297_3_43_72.txt RE 96 ms 128 KB
test_298_125_123_124.txt AC 1 ms 128 KB
test_298_293_295_291.txt RE 95 ms 128 KB
test_298_298_4_8.txt AC 0 ms 128 KB
test_298_36_72_98.txt RE 99 ms 128 KB
test_298_55_3_43.txt RE 96 ms 128 KB
test_298_92_91_295.txt RE 98 ms 128 KB
test_299_200_151_65.txt RE 96 ms 128 KB
test_299_240_35_154.txt RE 95 ms 128 KB
test_299_300_299_298.txt AC 0 ms 128 KB
test_299_33_242_151.txt RE 96 ms 128 KB
test_299_56_57_58.txt RE 96 ms 128 KB
test_299_66_132_198.txt RE 97 ms 128 KB
test_300_271_44_68.txt RE 95 ms 128 KB
test_300_299_298_296.txt RE 96 ms 128 KB
test_300_30_99_183.txt RE 95 ms 128 KB
test_300_4_5_6.txt RE 96 ms 128 KB
test_84_34_64_36.txt RE 96 ms 128 KB