문제 정보

    • 문제 ID
    • 시간 제한
    • 메모리 제한
    • 제출 횟수
    • 정답 횟수 (비율)
    • 출제자
    • 출처
    • 분류


Lea runs into a lot of words in her life. A lot of them she finds unpleasant. To compensate for that she started making up plesant words. Lea makes up new words by writing a nice looking string of characters on a piece of paper. She than erases a few of the most nasty looking characters and replaces them with underscores '_'. After that she tries to replace the underscores with more acceptable characters trying to form a plesant word.

Lea considers words plesant if they do not contain 3 sequential vowels, 3 sequential consonants and contain at least one letter 'L'.

In Croatian vowels are letters A, E, I, O, U only. All other lettters are consonants.


The first and only line of input contains a string of characters, at most 100. The string contains only of uppercase english letters and characters '_'. There will be at most 10 characters '_'.


The first and only line of output should cotain a single integer - the total number of plesant words that can be formed by substituing underscores with uppercase letters of the english alphabet.

Warning: Use 64 bit number formats. long long in C/C++, int64 in Pascal.

예제 입력

Example 1

Example 2

Example 3

예제 출력

Example 1

Example 2

Example 3


Due to technical difficulty in AOJ, the given input and output examples are displayed in a single box. Please note that they should be considered as completely different instances of input and output, unlike other problems. Every test cases will be judged against a fresh instance of compiled submission process.

6개의 댓글이 있습니다.