从１到N的整数中１出现的次数

/*
 * 1-n整数中１出现的次数.cpp
 *
 *  Created on: 2018年5月1日
 *      Author: soyo
 */
#include<iostream>
using namespace std;
int NumberOf1( unsigned int n)
{
   int number=;
  while(n>=)
   {
       if(n%==)
           number++;
       n=n/;
   }
   return number;
}
int NumberOf1Between1AndN(unsigned int n)
{
    unsigned int i;
    int number=;
    for(i=;i<=n;i++)
    {
        //cout<<i<<" ";
       number+=NumberOf1(i);
    }
    return number;
}
int main()
{
    unsigned int n;
    cin>>n;
    int num;
    num=NumberOf1Between1AndN(n);
    cout<<endl;
    cout<<"Num中１的个数为:"<<num<<endl;
}

结果:

Num中１的个数为: