http://hihocoder.com/problemset/problem/1791
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+45;
#define INF 0x3f3f3f3f;
#define ll long long int
#define charmax(x,y) x=max(x,y)
#define charmin(x,y) x=min(x,y)
#define clr(x,p) memset(x,p,sizeof x)
ll n;ll s[20];
ll dp[15][150][150];ll k=0;ll mod;
ll dfs(ll pos,ll sum,ll have,ll lim){
if(pos<=0){return sum==0&&have==0;}
if(!lim&&dp[pos][sum][have]!=-1) return dp[pos][sum][have];
ll ans=0;
ll num=lim?s[pos]:9;ll hvt;
for(ll i=0;i<=num&&i<=sum;i++){
hvt=(have*10+i)%mod;
ans+=dfs(pos-1,sum-i,hvt,lim&&(i==num||i==sum));
}
return dp[pos][sum][have]=ans;
}
int main()
{
scanf("%lld",&n);
ll ans=0;
while(n>0){
s[++k]=n%10;
n/=10;
}
for(ll i=1;i<=9*k;i++){
mod=i;clr(dp,-1);
ans+=dfs(k,i,0,1);
}
printf("%lld\n",ans);
return 0;
}