A1049 Counting Ones

最新推荐文章于 2020-07-06 14:57:34 发布

Highlight_Jin

最新推荐文章于 2020-07-06 14:57:34 发布

阅读量200

点赞数

分类专栏： # PAT 文章标签：简单数学

本文链接：https://blog.csdn.net/Highlight_Jin/article/details/88932498

版权

PAT 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

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:

Sample Output:

#include <cstdio>
#include <iostream>
#include <string>
using namespace std;

int main()
{
	int n, a = 1, ans = 0;
	int left, now, right;
	scanf("%d" ,&n);
	while(n/a != 0){
		left = n / (a * 10);
		now = n / a % 10;
		right = n % a;
		if(now == 0)
			ans += left * a;
		else if(now == 1)
			ans += left * a + right + 1;
		else 
			ans += (left + 1) * a;
		a *= 10;
	}
	printf("%d", ans);
	return 0;
}