← 返回题目

题库练习 Minimum number of steps

← 上一题下一题 →

A10872 | $Minimum number of steps$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

We have a string of letters 'a' and 'b'. We want to perform some operations on it. On each step we choose one of substrings "ab" in the string and replace it with the string "bba". If we have no "ab" as a substring, our job is done. Print the minimum number of steps we should perform to make our job done modulo $10^{9}+7$ . The string "ab" appears as a substring if there is a letter 'b' right after the letter 'a' somewhere in the string.

输入格式

The first line contains the initial string consisting of letters 'a' and 'b' only with length from $1$ to $10^{6}$ .

输出格式

Print the minimum number of steps modulo $10^{9}+7$ .

输入输出样例

输入 #1

ab

输出 #1

输入 #2

aab

输出 #2

C++ 编辑器

输入

输出