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. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a;
  31.  
  32. int consistency(int n, int k){
  33.  
  34. vector<int> dp(n+1, 0);
  35. dp[0] = 1;
  36. if(stoi(a.substr(0, 1)) <= k) dp[1] = 1;
  37.  
  38. for(int i=2; i<=n; i++){
  39.  
  40. int j = i-1;
  41. while(j>=max(0LL, i-10)){
  42. string str = a.substr(j, i-j);
  43. int num = stoi(str);
  44.  
  45. if(num > k) break;
  46.  
  47. if(str[0] != '0') dp[i] = (dp[i] + dp[j])%M;
  48. j--;
  49. }
  50. }
  51.  
  52. return dp[n];
  53. }
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69. int practice(int n, int k){
  70.  
  71.  
  72. return 0;
  73. }
  74.  
  75.  
  76.  
  77.  
  78.  
  79. void solve() {
  80.  
  81. int n, k;
  82. cin >> n >> k;
  83.  
  84. cin >> a;
  85.  
  86. cout << consistency(n, k) << 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. // cin >> t;
  100. while (t--) {
  101. solve();
  102. }
  103.  
  104. return 0;
  105. }
Success #stdin #stdout 0s 5312KB
stdin
5 80
11357
stdout
8