HDU3652:B-number

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define clr(x,c) memset(x,c,sizeof(x))
#define dwn(i,s,t) for(int i=s;i>=t;i--)
const int mod=13;
int dp[12][13][3],bit[12],mul[13];
void init(){
	mul[1]=1;
	rep(i,2,10) mul[i]=(mul[i-1]*10)%mod;
	clr(dp,0);dp[0][0][0]=1;
	rep(i,0,9) rep(j,0,12){
		rep(k,0,9) dp[i+1][(j+mul[i+1]*k)%mod][0]+=dp[i][j][0];
		rep(k,0,9) dp[i+1][(j+mul[i+1]*k)%mod][2]+=dp[i][j][2];
		dp[i+1][(j+mul[i+1])%mod][0]-=dp[i][j][1];
		dp[i+1][(j+mul[i+1]*3)%mod][1]+=dp[i][j][0];
		dp[i+1][(j+mul[i+1])%mod][2]+=dp[i][j][1];
	}
}
int work(int x){
	int tmp=x,cnt=0,ans=0,temp=0;bool flag=false;
	while(tmp) bit[++cnt]=tmp%10,tmp/=10;
	bit[cnt+1]=0;
	dwn(i,cnt,1){
		rep(j,0,bit[i]-1) ans+=dp[i-1][(13-(mul[i]*j+temp)%13)%13][2];
		if(flag) rep(j,0,bit[i]-1) ans+=dp[i-1][(13-(mul[i]*j+temp)%13)%13][0];
		else{
			if(bit[i]>1) ans+=dp[i-1][(13-(mul[i]+temp)%13)%13][1];
			if(bit[i+1]==1&&bit[i]>3) ans+=dp[i][(13-temp)%13][1];
		}
		if(bit[i+1]==1&&bit[i]==3) flag=true;
		temp=(bit[i]*mul[i]+temp)%mod;
	}
	return ans;
}
int main(){
	int n;init();
	while(scanf("%d",&n)!=EOF) printf("%d\n",work(n+1));
	return 0;
}