PAT——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 (≤2
30 ).

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

Sample Input:

12
结尾无空行

Sample Output:

5
结尾无空行

AC代码

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int h,l,cur,base=1,cnt=0;
	while(n/base)
	{
		h=n/(base*10);
		l=n-n/base*base;
		cur=n/base%10;
		if(cur==0) cnt+=h*base;
		else if(cur==1) cnt+=h*base+l+1;
		else cnt+=(h+1)*base;
		base*=10;
	}
	cout<<cnt;
}

参考

PAT–049 Counting Ones(找规律)