CF1926A.Vlad and the Best of Five

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Vladislav has a string of length 55 , whose characters are each either A\texttt{A} or B\texttt{B} .

Which letter appears most frequently: A\texttt{A} or B\texttt{B} ?

输入格式

The first line of the input contains an integer tt ( 1t321 \leq t \leq 32 ) — the number of test cases.

The only line of each test case contains a string of length 55 consisting of letters A\texttt{A} and B\texttt{B} .

All tt strings in a test are different (distinct).

输出格式

For each test case, output one letter ( A\texttt{A} or B\texttt{B} ) denoting the character that appears most frequently in the string.

输入输出样例

  • 输入#1

    8
    ABABB
    ABABA
    BBBAB
    AAAAA
    BBBBB
    BABAA
    AAAAB
    BAAAA

    输出#1

    B
    A
    B
    A
    B
    A
    A
    A
首页