Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
46 lines (42 loc) · 869 Bytes

File metadata and controls

46 lines (42 loc) · 869 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include <bits/stdc++.h>
#define int long long
#define dl long double
#define ff first
#define ss second
#define pb push_back
#define forn(i,n) for(int i=0;i<(int)n;i++)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MAXN 1000100
#define inf 1000000000
using namespace std;
typedef pair<int,int> pii;
const int MOD = 1e9+7;
int dp[MAXN];
int pot[10];
int solve(int x){
if(dp[x]!=-1)return dp[x];
if(x==0)return 0;
int res=inf;
vector<int> v;
int X = x;
while(X>0){
int y = X%10;
v.pb(y);
X=X/10;
}
for(int i=0;i<(int)v.size();i++){
int y = v[i];
if(y==0)continue;
res = min(res,1+solve(x-y));
}
return dp[x]=res;
}
int32_t main(){
fastio;
int a;
cin>>a;
memset(dp,-1,sizeof(dp));
pot[0]=1;
for(int i=1;i<10;i++)pot[i]=10*pot[i-1];
cout<<solve(a)<<endl;
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.