Description A Benedict monk No.16 writes down the decimal representations of all natural numbers between and including m and n, m ≤ n. How many 0's will he write down? Input Input consists of a sequence of lines. Each line contains two unsigned 32-bit integers m and n, m ≤ n. The last line of input has the value of m negative and this line should not be processed. Output For each line of input print one line of output with one integer number giving the number of 0's written down by the monk. Sample Input 10 11 100 200 0 500 1234567890 2345678901 0 4294967295 -1 -1 Sample Output 1 22 92 987654304 3825876150 Source
Waterloo Local Contest, 2006.5.27
|
<span style="color:#cc0000;">题意:与poj2282差不多,这里只需要求区间内0的个数;</span>
代码:
<pre name="code" class="cpp">#include<cstdio> #include<algorithm> #include<cstring> using namespace std; __int64 dfs(__int64 n,__int64 ans,__int64 k) { if(n<=0) return ans; int p=n%10; int d=n/10; while(d) { if(d%10==0) ans=ans+(p+1)*k; d=d/10; } ans=ans+(n/10)*k; return dfs(n/10-1,ans,k*10); } int main() { __int64 n,m; while(~scanf("%I64d%I64d",&n,&m)) { if(n==-1&&m==-1) break; if(n==0) //因为dfs没有考虑0,所以要判断一下 printf("%I64d\n",dfs(m,0,1)+1); else printf("%I64d\n",dfs(m,0,1)-dfs(n-1,0,1)); } }