Preparando MOJI

Two Substrings

2000ms 262144K

Description:

You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).

Input:

The only line of input contains a string s of length between 1 and 105 consisting of uppercase Latin letters.

Output:

Print "YES" (without the quotes), if string s contains two non-overlapping substrings "AB" and "BA", and "NO" otherwise.

Sample Input:

ABA

Sample Output:

NO

Sample Input:

BACFAB

Sample Output:

YES

Sample Input:

AXBYBXA

Sample Output:

NO

Note:

In the first sample test, despite the fact that there are substrings "AB" and "BA", their occurrences overlap, so the answer is "NO".

In the second sample test there are the following occurrences of the substrings: BACFAB.

In the third sample test there is no substring "AB" nor substring "BA".

Informação

Codeforces

Provedor Codeforces

Código CF550A

Tags

brute forcedpgreedyimplementationstrings

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:58:27

Relacionados

Nada ainda