codeforces 804B

B. Minimum number of steps
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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".

题意：

         输入一个只有a和b的字符串，如果出现ab，则将ab换成bba，问最少需要多少次更换才能是字符串没有ab

思路：

         其实就是将所有a移到b的后面，遍历字符串，记录下a的个数，如果遇到b，这将b前面的a移到b的后面需要2^n-1次操作，n为b前a的个数，然后累加就可以了

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
#define ll long long
const int mod = 1e9+7;
char a[N];
ll work(ll x,ll n)
{
    ll sum=1;
    while(n)
    {
        if(n&1)
            sum=(sum*x)%mod;
        x=(x*x)%mod;
        n>>=1;
    }
    return sum%mod;
}
int main()
{
    scanf("%s",a);
    int al=strlen(a);
    ll ans=0,num=0;
    for(int i=0;i<al;i++)
    {
        if(a[i]=='a')
            num++;
        if(a[i]=='b')
        {
            ll b=work(2,num);
            ans=(ans+b-1)%mod;
        }
    }
    printf("%I64d\n",ans);
    return 0;
}