【PAT】1049. Counting Ones (30)

最新推荐文章于 2020-02-24 14:10:42 发布

realxuejin

最新推荐文章于 2020-02-24 14:10:42 发布

阅读量337

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.youkuaiyun.com/realxuejin/article/details/49642941

PAT 专栏收录该内容

107 篇文章

订阅专栏

本文提供了一种高效的算法来计算给定范围内整数中1的总数，详细介绍了输入输出规范和核心代码逻辑。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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³⁰).

Output Specification:

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

Sample Input:

Sample Output:

分析：数1出现的个数。根据《编程之美》书上的 “2.4 1的数目” 写的。代码如下：

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int sum(int n){
	int iCount = 0;
	int iFractor = 1;
	int iLowerNum = 0;
	int iCurrNum = 0;
	int iHigherNum = 0;
	while(n/iFractor != 0){
		iLowerNum = n-(n/iFractor)*iFractor;
		iCurrNum = (n/iFractor)%10;
		iHigherNum = n / (iFractor*10);
		switch(iCurrNum){
			case 0:
				iCount += iHigherNum*iFractor;
				break;
			case 1:
				iCount += iHigherNum*iFractor + iLowerNum + 1;
				break;
			default:
				iCount += (iHigherNum + 1) * iFractor;
				break;
		}
		iFractor *= 10;
	}
	return iCount;
}

int main(int argc, char** argv) {
	int n;
	scanf("%d",&n);
	printf("%d\n",sum(n));
	return 0;
}