51nod 1009 数字1的数量

#include <bits/stdc++.h>
using namespace std;

long long dp[20][20],digit[20];

long long dfs(int pos ,int sum,int num,int zero,int limit)
{
	if(pos<0)
		return sum;
	if(!limit&&dp[pos][sum]!=-1&&!zero)
		return dp[pos][sum];
	long long ed,i,ret=0;
	if(limit)
		ed=digit[pos];
	else
		ed=9;
	for(i=0;i<=ed;i++)
	{
		if(zero)
		{
			if(i==0)
				ret+=dfs(pos-1,sum,num,1,limit&&i==ed);
			else
				ret+=dfs(pos-1,sum+(i==num?1:0),num,0,limit&&i==ed);
		}
		else
		{
			ret+=dfs(pos-1,sum+(i==num?1:0),num,0,limit&&i==ed);
		}
	}
	if(!limit&&!zero)
		dp[pos][sum]=ret;
	return ret;
}

long long cal(long long x,int num)
{
	memset(dp,-1,sizeof(dp));
	int pos=0;
	while(x)
	{
		digit[pos++]=x%10;
		x/=10;
	}
	return dfs(pos-1,0,num,1,1);
}

int main()
{
	long long n;
	while(cin>>n)
	{
		cout<<cal(n,1)<<endl;
	}
}