Codeforces Round #411 (Div. 2) D. Minimum number of steps

最新推荐文章于 2020-07-11 11:09:01 发布

原创最新推荐文章于 2020-07-11 11:09:01 发布 · 389 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

codefoce 同时被 2 个专栏收录

21 篇文章

订阅专栏

快速幂

9 篇文章

订阅专栏

本文介绍了一种计算字符串中所有'ab'子串转换为'bba'所需的最小操作次数的方法。通过统计每个'b'之前的'a'数量，并利用快速幂求解，最终输出模10^9 + 7的结果。

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 109 + 7.

The string "ab" appears as a substring if there is a letter 'b' right after the letter 'a' somewhere in the string.

Input

The first line contains the initial string consisting of letters 'a' and 'b' only with length from 1 to 106.

Output

Print the minimum number of steps modulo 109 + 7.

Examples

input
ab

output
1

input
aab

output
3

Note

The first example: "ab" → "bba".

The second example: "aab" → "abba" → "bbaba" → "bbbbaa".

题意：

ab串必须全部转化位bba

我们需要的操作就是统计每个b前边a的数量

已知 ab需要一次

aab需要三次 1+2

aaab需要 7次 1+2+4(2^0+2^1+2^2==2^num-1);

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int N=1e9+7;
#define ll long long
int dp[1000333];
ll quick_mi(int n)
{
    ll res=1;
    ll tem=2;
    while(n)
    {
        if(n%2==1)
            res*=tem;
        tem*=tem;
        tem%=N;
        res%=N;
        n/=2;
    }
    return res;
}
char s[1000333];
int main()
{
    scanf("%s",s);
    int l=strlen(s);
    if(s[0]=='a')
        dp[0]=1;
    else dp[0]=0;
    long long res=0;
    for(int i=1;i<l;i++)
    {
        if(s[i]=='a')
            dp[i]=dp[i-1]+1;
        else
        {
            dp[i]=dp[i-1];
            res+=(quick_mi(dp[i])-1);
            res%=N;
        }
    }
    printf("%lld\n",res);
}