PAT甲级 1049

题目 String Subtraction

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.

解析

找规律

代码

#include<bits/stdc++.h>

#define INF 1<<29

using namespace std;

void pat1049() {
    int n;
    int sum;
    scanf("%d",&n);
    int now, left, right, a;
    a = 1;
    while(n/a){
        left = n / (a*10);
        right = n % a;
        now = n/a % 10;
        if(now == 0) sum += left * a;
        if(now == 1) sum += left * a + right + 1;
        if(now >= 2) sum += (left + 1) * a;
        a = a*10;
    }

    printf("%d",sum);
}

int main() {
    pat1049();
    return 0;
}