编程之美算法一：统计1的个数

#include <iostream>
using namespace std;
int count1(int v)
{
int sum =0;
int flactor = 1;
int bignum = 0;
int curnum = 0;
int smlnum = 0;
while(v/flactor)
{
smlnum = v-(v/flactor)*flactor;
curnum = v/flactor;
bignum = v/(flactor*10);
switch(curnum)
{
case 0:
sum+= bignum*flactor;
break;
case 1:
sum+=bignum*flactor+smlnum+1;
break;
default:
sum+=(bignum+1)*flactor; 
}
flactor*=10;
}
return sum;
}
void main()
{
int ival;
while(cin>>ival)
cout<<count1(ival)<<endl;
}