1049 Counting Ones (30 分)

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

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

int Function (int N) {
	if (N <= 9 && N >= 1) return 1;
	else if (N == 0) return 0;
	int k = N / 10, p = N % 10, res = 0, total = 0;
	string s = to_string(k);
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == '1') total++;
	}
	if (p >= 1) {
		res = k + 1 + total * (p + 1) + Function(k - 1) * 10; 
	} else {
		res = k + total * (p + 1) + Function(k - 1) * 10; 
	}
	return res;
}

int main() {
	int N;
	scanf("%d", &N);
	int res = Function(N);
	cout << res;
}