Submission

Status:

PPP-x--x-x

Subtask/Task Score:

30/100

Score: 30

User: angielala

Problemset: กองชาม

Language: cpp

Time: 0.020 second

Submitted On: 2025-09-20 17:04:34

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int a;
    cin >> a;
    vector <int> bowl(a);
    for (int b=0; b<a; b++)
    {
        cin >> bowl[b];
    }
    int frq[30] = {0};
    for (int b=0; b<a; b++)
    {
        frq[bowl[b]]++;
    }
    int max = 0;
    for (int i=0; i < 30; i++)
    {
        if (frq[i] > max)
        {
            max = frq[i];
        }
    }
    cout << max << "\n";
    return 0;
}