4097226_ac_16ms_204k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <algorithm>

using namespace std;

__int64 num_0(__int64 n)
{
	if (n < 0)
	{
		return 0;
	}
	if (n < 10)
		return 1;
	__int64 ret = 0;
	__int64 high, low, now, fact = 1;
	while (n / fact)
	{
		low = n - n / fact * fact;
		now = n / fact % 10;
		high = n / (fact * 10);

		if (now == 0)
			ret += (high - 1) * fact + low + 1;
		else
			ret += high * fact;
		fact *= 10;
	}
	return ++ret;
}

__int64 num(__int64 n, __int64 f)
{
	if (n < 0)	
	{
		return 0;
	}
	__int64 ret = 0;
	__int64 high, low, now, fact = 1;
	while (n / fact)
	{
		low = n - n / fact * fact;
		now = n / fact % 10;
		high = n / (fact * 10);

		if (now < f)
			ret += high * fact;
		else
			if (now == f)
				ret += high * fact + low + 1;
			else
				ret += (high + 1) * fact;
		fact *= 10;
	}
	return ret;
}

int main()
{
	__int64 m, n;
	
	while (scanf("%I64d%I64d", &m, &n) == 2 && m > 0)
	{
		if (m > n)
			swap(m, n);
		printf("%I64d", num_0(n) - num_0(m - 1));
		for (int i = 1; i < 10; i++)
		{
			printf("% I64d", num(n, i) - num(m - 1, i));
		}
		puts("");
	}
	return 0;
}