모의고사

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> solution(vector<int> answers) 
{
    vector<int> answer;
    vector<int> answer_1 {1, 2, 3, 4, 5, 1, 2, 3, 4, 5};
    vector<int> answer_2 {2, 1, 2, 3, 2, 4, 2, 5};
    vector<int> answer_3 {3, 3, 1, 1, 2, 2, 4, 4, 5, 5};
    vector <int> result;
    int i, size = answers.size();
    int l = 0, m = 0, n = 0, a = 0, b = 0, c = 0;
    
    for(i = 0; i < size; i++)
    {
        if(l == 10)
        {
            l = 0;
            n = 0;
        }
        if(m == 8)
        {
            m = 0;
        }
        if(answers[i] == answer_1[l])
        {
            a++;
        }
        if(answers[i] == answer_2[m])
        {
            b++;
        }
        if(answers[i] == answer_3[n])
        {
            c++;
        }
        l++;
        m++;
        n++;
    }
    result.push_back(a);
    result.push_back(b);
    result.push_back(c);
    sort(result.begin(), result.end());
    if(result.back() == a)
    {
        answer.push_back(1);
    }
    if(result.back() == b)
    {
        answer.push_back(2);
    }
    if(result.back() == c)
    {
        answer.push_back(3);
    }
    
    return answer;
}