30.在从1到n的正数中1出现的次数

题目：输入一个整数n，求从1到n这n个整数的十进制表示中1出现的次数。
例如输入12，从1到12这些整数中包含1 的数字有1，10，11和12，1一共出现了5次。

分析：这是一道广为流传的google面试题。

答案：

参考文章：http://blog.csdn.net/fanzitao/article/details/7908247

//20130305

#include <iostream>
using namespace std;
unsigned long long  count1(unsigned long long n);
int main()
{
	unsigned long long n = count1(11000);
	cout<<n<<endl;
	return 0;
}
unsigned long long count1(unsigned long long n)
{
	unsigned long long counts = 0;
	unsigned long long rnum = 0;
	unsigned long long lnum = 0;
	unsigned long long curnum = 0;
	unsigned long long ifactor = 1;
	while (n / ifactor != 0)
	{
		curnum = n / ifactor % 10;
		rnum = n / ifactor /10;
		lnum = n - n / ifactor * ifactor;
		switch (curnum)
		{
		case 0:
			counts += rnum * ifactor;
			break;
		case 1:
			counts += rnum * ifactor + lnum +1;
			break;
		default :
			counts += (rnum + 1) * ifactor;
			break;
		}
		ifactor *= 10;
	}
	return counts;
}