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.  
  31. int consistency(int n, int x, int y, int z, int b){
  32.  
  33. vector<int> dp(n+1);
  34. dp[1] = 0;
  35.  
  36. for(int i=2; i<=n; i++){
  37. int mini = dp[i-1] + x;
  38.  
  39. if(i % 3 == 0) mini = min(mini, dp[i/3] + y);
  40. if(i % 5 == 0) mini = min(mini, dp[i/5] + z);
  41. if(i % 7 == 0) mini = min(mini, dp[i/7] + b);
  42.  
  43. dp[i] = mini;
  44. }
  45.  
  46. return dp[n];
  47. }
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63. int practice(int n, int x, int y, int z, int b){
  64.  
  65.  
  66. return 0;
  67. }
  68.  
  69.  
  70.  
  71.  
  72.  
  73. void solve() {
  74.  
  75. int n, x, y, z, b;
  76. cin>> n >> x >> y >> z >> b;
  77.  
  78. cout << consistency(n, x, y, z, b) << endl;
  79.  
  80.  
  81. }
  82.  
  83.  
  84.  
  85.  
  86.  
  87. int32_t main() {
  88. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  89.  
  90. int t = 1;
  91. // cin >> t;
  92. while (t--) {
  93. solve();
  94. }
  95.  
  96. return 0;
  97. }
Success #stdin #stdout 0s 5320KB
stdin
15
100 500 10000000 1
stdout
201