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 (<=230).
Output Specification:
For each test case, print the number of 1's in one line.
Sample Input:12Sample Output:
5
#include<iostream>
#include<cstdio>
#include<string.h>
#include<math.h>
using namespace std;
int CntOne(int n)
{
int cnt=0;
int wei=0;
int m=n;
while(m)
{
wei++;
m/=10;
}
int cur=0;
for(int i=1;i<=wei;i++)
{
if(cur==0) cur=1;
else cur*=10;
int h=(n/cur)/10;
int l=n%cur;
int c=(n-h*cur*10-l)/cur;
if(c==0){
cnt+=(h*cur);
}
else if(c==1)
{
cnt+=(l+1+h*cur);
}
else
{
cnt+=(h*cur+cur);
}
}
return cnt;
}
int main()
{
int n;
cin>>n;
cout<<CntOne(n);
cin>>n;
return 0;
}