ABBYY Cup 3.0 - Finals (online version)

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
#define LL long long
#define N 1000000
#define INF 0xfffffff
int dp[11][N+10];
int o[11][N+10];
int main()
{
int i,j;
LL n;
for(i = 0 ;i <= 9 ; i++)
{
dp[i][0] = 0;
}
for(i = 0; i <= 9;  i++)
for(j = 1; j <= N ;j++)
{
int mm = i;
int k = j;
while(k)
{
int x = k%10;
mm = max(mm,x);
k/=10;
}
if(mm>=j)
{
dp[i][j] = dp[i][0]+1;
o[i][j] = j-mm;
}
else
{
dp[i][j] = dp[i][j-mm]+1;
o[i][j] = o[i][j-mm];
}
}
while(cin>>n)
{
if(n<=N)
{
cout<<dp[0]
<<endl;
continue;
}
LL m = n%N,nm = n/N;
LL s = 0;
int k = 0;
for(i = nm ; i >= 0; i--)
{
int y = i,ma = 0;
while(y)
{
int x = y%10;
y/=10;
ma = max(ma,x);
}
if(i!=nm) m = N+k;
s += dp[ma][m];
k = o[ma][m];
if(k==0&&i!=0)
{
s++;
k = -ma;
}
}
cout<<s<<endl;
}
return 0;
}