Minimum number of steps（待改）

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

很好的解法//https://blog.csdn.net/feizaoSYUACM/article/details/71209632

#include<stdio.h>
#include<string.h>
int sum[1000005];
char a[1000005];
int main()
{
    long long int ans = 0;
    long long b = 0;
    scanf("%s",a);
    int i,n,x = 0;
    n = strlen(a);
    for(i=n-1; i>=0; --i)
    {
        if(a[i]=='a')
        {
            ans+=b;
            ans%=1000000007;
            b*=2;
            b%=1000000007;
        }
        else if(a[i]=='b')
        {
            b++;
            b%=1000000007;
        }

    }
    printf("%lld\n",ans);
    return 0;
}