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