111qqz的小窝

老年咸鱼冲锋!

whust #0.1 I – Laughing Out Loud

I – Laughing Out Loud

Time Limit:1000MS     Memory Limit:524288KB     64bit IO Format:%I64d & %I64u

Description

standard input/output 

Little Toojee was a happy go lucky boy. He seemed to find most, if not all, things funny. One day he read a word and started laughing a lot. Turns out that the word consisted only of the letters L and O. Whenever he saw the subsequence LOL’ in the word, he laughed for 1 second. Given t strings, find out for how long Toojee laughed on seeing each string.

Input

The first line contains t queries. This is followed by t lines each containing one string S. String S consists only of capital alphabets.

Output

Output for each string on a new line.

Constraints

  •  ≤ t ≤ 10
  •  ≤ |S| ≤ 105

Sample Input

Input

Output

Hint

Test1: On observation, we can tell that there is only 1 occurrence of LOL.

Test2: Let the string be 0-indexed and let V = {a, b, c} denote the indices that make up the string LOL”, where a is index of the 1st L’, b is index of the O’ and c is the index of the 2nd L’. So, V can be {0, 1, 2}, {2, 3, 4}, {0, 1, 4} and {0, 3, 4}. We see that there are 4 occurrences of the string “LOL”.

又是求有多少种组合的题.

和上次cf那道求等比数列的非常像.

View Code

 

说点什么

您将是第一位评论人!

提醒
wpDiscuz
粤ICP备18103363