fork download
copy 
  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.  
  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. const int N = 3e6+9;
  28.  
  29. vector<int> isPrime;
  30.  
  31. void seive(){
  32. 	isPrime.resize(N+1, 1);
  33. 	isPrime[0] = isPrime[1] = false;
  34.  
  35. 	for(int i=2; i*i<=N; i++){
  36. 		if(!isPrime[i]) continue;
  37.  
  38. 		for(int j=i*i; j<=N; j+=i){
  39. 			isPrime[j] = false;
  40. 		}
  41. 	}
  42. }
  43.  
  44.  
  45.  
  46. string a;
  47.  
  48. int consistency(int n){
  49.  
  50. 	vector<int> dp(n+1, 0);
  51. 	dp[0] = 1;
  52.  
  53. 	for(int i=1; i<=n; i++){
  54.  
  55. 		int j = i-1;
  56. 		while(  j>=max(0LL, i-6) ){
  57. 			string s = a.substr(j, i-j);
  58.  
  59. 			if(s[0] != '0' &&  isPrime[stoi(s)]){
  60. 				dp[i] = (dp[i] + dp[j])%M;
  61. 			}
  62. 			j--;
  63. 		}
  64. 	}
  65.  
  66. 	return dp[n];
  67. }
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83. int practice(int n){
  84.  
  85.  
  86.     return 0;
  87. }
  88.  
  89.  
  90.  
  91.  
  92.  
  93. void solve() {
  94.  
  95. 	static int _ = (seive(), 0);
  96.  
  97.     int n;
  98. 	cin >> a;
  99. 	n = a.size();
  100.  
  101.     cout << consistency(n) << endl;
  102.  
  103.  
  104. }
  105.  
  106.  
  107.  
  108.  
  109.  
  110. int32_t main() {
  111.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  112.  
  113.     int t = 1;
  114.     // cin >> t;
  115.     while (t--) {
  116.         solve();
  117.     }
  118.  
  119.     return 0;
  120. }
Success #stdin #stdout 0.04s 26708KB
comments (?)
stdin
copy 
11375
stdout
copy 
3
https://ideone.com/zzRFMa
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!