Submission #3981556

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int n, dp[1009], mod = 1000000007; string s, t[109];
int main() {
	cin >> n >> s;
	for (int i = 0; i < n; i++) cin >> t[i];
	dp[0] = 1;
	for (int i = 1; i <= s.size(); i++) {
		for (int j = 0; j < n; j++) {
			if (i >= t[j].size() && s.substr(i - t[j].size(), t[j].size()) == t[j]) {
				dp[i] += dp[i - t[j].size()];
				if (dp[i] >= mod) dp[i] -= mod;
			}
		}
	}
	cout << dp[s.size()] << endl;
	return 0;
}

Submission Info

Judge Result