2966번 찍기

 브루트 포스 기본 문제.

 

 

#include <iostream>
#include <algorithm>
#define MAX 101
 
using namespace std;
 
char Adrian[3]={'A','B','C'};
char Bruno[4]={'B','A','B','C'};
char Goran[6]={'C','C','A','A','B','B'};
int N;
int A,B,C;
int answer;
char P[MAX];
 
int main(){
    cin >> N;
    
    for(int i=0;i<N;i++){
        cin >> P[i];
    }
    
    for(int i=0;i<N;i++){
        if(P[i]==Adrian[i%3]){
            A++;
        }
    }
    for(int i=0;i<N;i++){
        if(P[i]==Bruno[i%4]){
            B++;
        }
    }
    for(int i=0;i<N;i++){
        if(P[i]==Goran[i%6]){
            C++;
        }
    }
    
    answer=max({A,B,C});
    
    cout << answer << endl;
    
    if(answer==A){
        cout << "Adrian" << endl;
    }
    if(answer==B){
        cout << "Bruno" << endl;
    }
    if(answer==C){
        cout << "Goran" << endl;
    }
}