fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25.  
  26. //_ ***************************** START Below *******************************
  27.  
  28.  
  29. string a;
  30.  
  31. int consistency(int n){
  32.  
  33. string b;
  34. for(int i=0; i<n; i++){
  35. if(a[i] == 'a' || a[i] == 'b') b.push_back(a[i]);
  36. }
  37.  
  38. n = b.size();
  39.  
  40. int ans = 1;
  41. int i=0;
  42.  
  43. while(i<n){
  44. while(i<n && b[i] == 'b') i++;
  45. if(i==n) break;
  46.  
  47. int j = i+1;
  48. while(j<n && b[j] == 'a') j++;
  49. int ct = j-i;
  50. ans = (ans * (ct+1))%M;
  51. i = j;
  52. }
  53.  
  54. return ans-1 ;
  55. }
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71. int practice(int n){
  72.  
  73.  
  74. return 0;
  75. }
  76.  
  77.  
  78.  
  79.  
  80.  
  81. void solve() {
  82.  
  83. cin >> a;
  84. int n = a.size();
  85.  
  86. cout << consistency(n) << endl;
  87.  
  88.  
  89. }
  90.  
  91.  
  92.  
  93.  
  94.  
  95. int32_t main() {
  96. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  97.  
  98. int t = 1;
  99. while (t--) {
  100. solve();
  101. }
  102.  
  103. return 0;
  104. }
Success #stdin #stdout 0s 5308KB
stdin
aabbaaababaa
stdout
71