1049 Counting Ones (30 分)

The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1’s in 1, 10, 11, and 12.

Input Specification:

Each input file contains one test case which gives the positive N (≤$2^{30}$).

Output Specification:

For each test case, print the number of 1’s in one line.

Sample Input:

12
结尾无空行

Sample Output:

5
结尾无空行

解释：

找o-n，所有数，各位上的1的个数之和

枚举太耗时了，这里还是找规律

可以固定一个1，然后变动其他位，可以有多少种变化，这样就找到规律了

规律如下：

设当前是第k位，最低位k=0，k位上的数字为now，left代表k位左面的数字，right代表k为后面的数字

now==0 ans+=left*$10^k$

now==1 ans+=left*$10^k$+right+1

now>=2 ans+=(left+1)*$10^k$

#include<iostream>
#include<math.h>
using namespace std;
int main()
{
    int n,a=1,ans=0;
    int left,now,right;
    cin>>n;
    while (n/a!=0)
    {
        //当前位数左边的数
        left=n/(a*10);
        //当前位置上的数字
        now=n/a%10;
        //右边的数
        right=n%a;
        if(now==0) 
            ans+=left*a;
        else if(now==1) 
            ans+=left*a+right+1;
        else 
            ans+=(left+1)*a;
        a*=10;
    }
    cout<<ans;
    return 0;
}