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
思路:就是一位一位的数,看了算法笔记-上机训练实战指南上讲的之后,搞明白了。我把讲的那两页贴到下面。
#include<iostream>
using namespace std;
int main(){
int a = 1,ans = 0,n,left,now,right;
cin>>n;
while(n / a){ // a/10:就是从右向左的第几位
right = n % a;
now = n /a % 10;
left = n /(a * 10);
if (now == 0){
ans += left * a;
}else if (now == 1){
ans += left * a + right + 1;
}else if(now > 1){
ans += (left + 1) * a;
}
a *= 10;
}
cout<<ans;
return 0;
}