Submission #1164053


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <stack>
#include <queue>
#include <map>
using namespace std;

#define max_n 101
#define max_m 50
#define max_w 10000
#define max_h 1000
#define max_k 10000
#define max_l 10000
#define INF 9999999

typedef long long lint;


int main()
{
    int n;
    cin>>n;
    char ans[max_n];
    int a=0,b=0,c=0,d=0;
    for(int i=0;i<n;i++){
        cin>>ans[i];
        switch (ans[i]) {
            case '1':
                a++;
                continue;
                
            case '2':
                b++;
                continue;
            case '3':
                c++;
                continue;
            case '4':
                d++;
                continue;
        }
    }
    
    int r=max(a,max(b,max(c,d)));
    
    int s=min(a,min(b,min(c,d)));
    cout<<r<<' '<<s<<endl;
    
    return 0;
}

Submission Info

Submission Time
Task A - センター採点
User asterisk10
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1032 Byte
Status AC
Exec Time 1 ms
Memory 256 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 256 KB
00_sample2.txt AC 1 ms 256 KB
01_rnd_00.txt AC 1 ms 256 KB
01_rnd_01.txt AC 1 ms 256 KB
01_rnd_02.txt AC 1 ms 256 KB
01_rnd_03.txt AC 1 ms 256 KB
01_rnd_04.txt AC 1 ms 256 KB
01_rnd_05.txt AC 1 ms 256 KB
01_rnd_06.txt AC 1 ms 256 KB
01_rnd_07.txt AC 1 ms 256 KB
01_rnd_08.txt AC 1 ms 256 KB
01_rnd_09.txt AC 1 ms 256 KB
01_rnd_10.txt AC 1 ms 256 KB
01_rnd_11.txt AC 1 ms 256 KB
01_rnd_12.txt AC 1 ms 256 KB
01_rnd_13.txt AC 1 ms 256 KB
01_rnd_14.txt AC 1 ms 256 KB
01_rnd_15.txt AC 1 ms 256 KB
01_rnd_16.txt AC 1 ms 256 KB
01_rnd_17.txt AC 1 ms 256 KB
01_rnd_18.txt AC 1 ms 256 KB
01_rnd_19.txt AC 1 ms 256 KB
02_all_1.txt AC 1 ms 256 KB
02_all_2.txt AC 1 ms 256 KB
02_all_3.txt AC 1 ms 256 KB
02_all_4.txt AC 1 ms 256 KB
03_mini_1.txt AC 1 ms 256 KB
03_mini_2.txt AC 1 ms 256 KB
03_mini_3.txt AC 1 ms 256 KB
03_mini_4.txt AC 1 ms 256 KB