1049 Counting Ones

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 (≤230).

Output Specification:

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

Sample Input:

12

Sample Output:

5

#include <iostream>
using namespace std;

int main() {
	int n, ans = 0, right, left, radix = 1, curr;
	cin >> n;
	while (n / radix) {
		left = n / radix / 10;
		curr = n / radix % 10;
		right = n % radix;
		if (curr == 0) {
			ans += left * radix;
		} else if (curr == 1) {
			ans += left * radix + right + 1;
		} else {
			ans += (left + 1) * radix;
		}
		radix *= 10;
	}
	cout << ans;
	return 0;
}

 参考博客：PAT 1049 Counting Ones (30分) 编程之美--1的个数 - 编程猎人 (programminghunter.com)