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

 

题解：两种方法（数学规律/数位DP）

两种方法都非常6.然而跟我没关系，因为我只会暴力hhh。

记录一下这两种方法，一会碰到类似的题就会了。

更推荐数位DP，因为数学规律并不是那么好找的，而且题不同规律也不一样。

数位DP思想，类似题型都可以应用。

数位DP：

#include <iostream>
using namespace std;
int   N ,total; 
void getOnes(int n, int m, int cnt) {
    if( n == 0 ) 
	    return;
    int a = n % 10;
    int b = n / 10;
    int c = cnt;
    int d = 1;
    while(c--) {
        d *= 10;
    }
    if(a < 1) {
        total += b*d;
    }
    else if(a > 1) {
        total += (b+1)*d;
    }
    else {
        total += b*d+m+1;
    }
    m += a*d;
    getOnes(b, m, cnt+1);
}
int main(){
    cin>> N;
    getOnes(N, 0, 0);
    cout<< total;
    return 0;
}

 

数学规律：

#include<iostream>
#include<algorithm>
using namespace std;
int ans;
int main()
{
    int n;
    scanf("%d", &n);
    int a = 1, left, right;
    while (n / a)
    {
        int now = n / a % 10;
        left = n / (a * 10);
        right = n%a;
        if (now == 0)ans += left*a;
        else if (now == 1)ans += left*a + 1 + right;
        else if (now > 1)ans += (left + 1)*a;
        a *= 10;
        cin.get();
    }
    printf("%d", ans);
    return 0;
}