1049 Counting Ones (30 分) PAT 甲级 数1的个数

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

这道题，我第一次也想到了逐位分析，但是分析方向错了

分为三种情况：

如果当前位：（left 表示当前位置左边的数值，right表示当前位置右边的数值）

==0：  left*right的位数

>1:  (left+1)*right的位数

==1 ：left*right的位数+right+1

#include<iostream>
using namespace std;
int main()
{
	int n,i,j,l=0,r=1,cur=0,sum=0;
	scanf("%d",&n);
	l=n;
	while(l!=0)
	{
		cur=l%10;
		l/=10;
		
//		printf("%d\n",sum);
		if(cur==0)
		{
			sum+=l*r;
//			printf("1   %d\n",l*r);
		}
		
		else
		if(cur==1)
		{
			sum+=l*r+n%r+1;
//			printf("2   %d\n",l*r+n%r+1);
		}
		else
		{
			sum+=(l+1)*r;
//			printf("3   %d\n",(l+1)*r);
		}
		r*=10;
	}
	printf("%d\n",sum);
	return 0;
}