Submission #24491662

---

Source Code Expand

#include<bits/stdc++.h>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define EPS (1e-9)
#define equals(a,b) (fabs((a)-(b))<EPS)

using namespace std;

bool LT(double a,double b) { return !equals(a,b) && a < b; }
bool LTE(double a,double b) { return equals(a,b) || a < b; }

const string YES = "";
const string NO  = "";

typedef long long ll;
typedef pair<int,int> ii;

const ll mod = 1000000007LL;

#define MAX 200010
ll dp[MAX][10];

void solve() {

}

string t = "chokudai";

int main() {
  string s;
  cin >> s;
  int n = s.size();
  dp[0][0] = 1;
  rep(i,n) {
    rep(j,8) {
      if( dp[i][j] == 0 ) continue;
      if( s[i] == t[j] ) {
	( dp[i+1][j+1] += dp[i][j] ) %= mod;
      }
      ( dp[i+1][j] += dp[i][j] ) %= mod;
    }
  }
  ll ans = 0;
  rep(i,n+1) {
    ( ans += dp[i][(int)t.size()] ) %= mod;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result