# 【PAT】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 FORMAT

Each input file contains one test case which gives the positive N (<=230).

## OUTPUT FORMAT

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

12

5

## 解题思路

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#define INF 99999999
using namespace std;
int N;
int main(){
scanf("%d",&N);
int sum=0,pow=1;
while(N/pow){
int left=N/(pow*10);
int now=N/pow%10;
int right=N%pow;
if(now==0)sum+=left*pow;
else if(now==1)sum+=left*pow+right+1;
else    sum+=(left+1)*pow;
pow*=10;
}
printf("%d\n",sum);
return 0;
}



• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120