josiftepe

Untitled

Nov 7th, 2020
60
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.65 KB | None | 0 0
  1. #include <iostream>
  2. #include <algorithm>
  3. #include <fstream>
  4. using namespace std;
  5. const int MOD = 1e9 + 7;
  6. const int INF = 2e9 + 10;
  7. const int maxn = 1e6 + 5;
  8. int n;
  9. int dp[maxn];
  10.  
  11. int main(){
  12.     cin >> n;
  13.     for(int i = 0; i <= n; ++i) {
  14.         dp[i] = INF;
  15.     }
  16.     dp[n] = 0;
  17.     for(int number = n; number >= 0; --number) {
  18.         int tmp = number;
  19.         while(tmp > 0) {
  20.             int digit = tmp % 10;
  21.             if(number - digit >= 0) {
  22.                 dp[number - digit] = min(dp[number - digit], dp[number] + 1);
  23.             }
  24.             tmp /= 10;
  25.         }
  26.     }
  27.     cout << dp[0] << endl;
  28. }
  29. //869167734
  30. //869167734
  31.  
Advertisement
Add Comment
Please, Sign In to add comment