Submission #1136838


Source Code Expand

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

//答えの結果を入力する関数(再帰的呼び出し)
void Input(int *c, int i, int N){
  if(scanf("%1d", &c[i]) < 1)
    exit(1);
  if (N - 1 == i){
    return;
  }
  Input(c, ++i, N);
}

//Grading:採点
void Grading (int N){
  int *c;
  int check[4] = {0};//最大、最小回数をカウント
  int i = 0, min, max;

  //例題の20桁に対応するために入力された値を動的に管理する
  c = (int*) malloc (sizeof (int) * N);

  //答えの入力(再帰的呼び出し)
  Input (c, i, N);

  for( i = 0; i < N; i++){
    switch(c[i]){
      case 1:
        check[0]++;
        break;

      case 2:
        check[1]++;
        break;

      case 3:
        check[2]++;
        break;

      case 4:
        check[3]++;
        break;

      default:
        return;
        break;
    }
  }

  //最大、最小の値を記録
  min = check[0];
  max = check[0];
  for( i = 1; i < 4; i++){
    if( max < check[i] )
      max = check[i];
    if( min > check[i] )
      min = check[i];
  }

  printf("%d %d\n", max, min);
  free(c);
}

int main(void){
  int N;

  //問題数の入力
  if((scanf("%d", &N) < 1))
    exit(1);

  if(N < 1 || N > 100)
    exit(1);

  Grading(N);

  return 0;
}

Submission Info

Submission Time
Task A - センター採点
User EneMy
Language C (GCC 5.4.1)
Score 100
Code Size 1335 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 30
Set Name Test Cases
All 00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_all_1.txt, 02_all_2.txt, 02_all_3.txt, 02_all_4.txt, 03_mini_1.txt, 03_mini_2.txt, 03_mini_3.txt, 03_mini_4.txt
Case Name Status Exec Time Memory
00_sample1.txt AC 1 ms 128 KB
00_sample2.txt AC 1 ms 128 KB
01_rnd_00.txt AC 1 ms 128 KB
01_rnd_01.txt AC 1 ms 128 KB
01_rnd_02.txt AC 1 ms 128 KB
01_rnd_03.txt AC 1 ms 128 KB
01_rnd_04.txt AC 1 ms 128 KB
01_rnd_05.txt AC 1 ms 128 KB
01_rnd_06.txt AC 1 ms 128 KB
01_rnd_07.txt AC 1 ms 128 KB
01_rnd_08.txt AC 1 ms 128 KB
01_rnd_09.txt AC 1 ms 128 KB
01_rnd_10.txt AC 1 ms 128 KB
01_rnd_11.txt AC 1 ms 128 KB
01_rnd_12.txt AC 1 ms 128 KB
01_rnd_13.txt AC 1 ms 128 KB
01_rnd_14.txt AC 1 ms 128 KB
01_rnd_15.txt AC 1 ms 128 KB
01_rnd_16.txt AC 1 ms 128 KB
01_rnd_17.txt AC 1 ms 128 KB
01_rnd_18.txt AC 1 ms 128 KB
01_rnd_19.txt AC 1 ms 128 KB
02_all_1.txt AC 1 ms 128 KB
02_all_2.txt AC 1 ms 128 KB
02_all_3.txt AC 1 ms 128 KB
02_all_4.txt AC 1 ms 128 KB
03_mini_1.txt AC 1 ms 128 KB
03_mini_2.txt AC 1 ms 128 KB
03_mini_3.txt AC 1 ms 128 KB
03_mini_4.txt AC 1 ms 128 KB