数字统计问题

输入一个数字n,统计1到n使用了多少个0,1,2,,9。

#include <stdio.h>
#include <string.h> 
#include <math.h> 
void pageNumber(int n, long long cnt[]) {
	memset(cnt, 0, 10 * sizeof(long long));
	int tmp = n, len = 1;//len表示整数n的位数   
	while (tmp /= 10)
		len++;
	tmp = len;
	while (len > 0) {
		int high = n / (int)pow(10.0, len - 1),
			left = n % (int)pow(10.0, len - 1);
		for (int i = 0; i <= 9; ++i)
			cnt[i] += (len - 1)*(int)pow(10.0, len - 2)*high;
		for (int i = 0; i<high; ++i)
			cnt[i] += (int)pow(10.0, len - 1);
		cnt[high] += left + 1;
		n = left;
		len--;
	}
	//多加了 (len-1)个1组成的数 个零  
	for (int i = 0; i<tmp; ++i)
		cnt[0] -= (int)pow(10.0, i);
}
int main()
{
	int n;
	long long cnt[10];
	while (~scanf("%d", &n)) {
		pageNumber(n, cnt);
		for (int i = 0; i < 10; ++i)
			printf("%lld\n", cnt[i]);
	}

	return 0;
}

poj2282

#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
void pageNumber (long long n, long long cnt[]);

int main () {
	freopen("data.out", "w", stdout);
	long long x, y;
	while (cin >> x >> y) {
		if (!(x | y)){
			break;
		}
		if (x > y) {
			swap(x, y);
		}
		x -= 1;
		long long ans[10] = { 0 }, cnt2[10] = { 0 };
		pageNumber (y, ans);
		pageNumber (x, cnt2);
		for (int i = 0; i < 10; ++i) {
			ans[i] -= cnt2[i];
		} 
		cout << ans[0]; 
		for (long long i = 1; i <= 9; ++i)
			cout << ' ' <<  ans[i];
		cout << endl;
	}
}

void pageNumber (long long n, long long cnt[]) {
	memset (cnt,0,10*sizeof(long long));
	long long tmp = n, len = 1; 
	while (tmp /= 10)len++;
	tmp=len;
	while (len>0) {
		long long highBit = n / (long long)pow(10.0, len - 1), 
		left = n % (long long)pow(10.0, len - 1);
        for (long long i = 0;i <=9 ;++i)
			cnt[i] += (len-1) * (long long)pow(10.0,len-2) * highBit;
        for (long long i = 0; i<highBit; ++i)
			cnt[i] += (long long)pow(10.0, len - 1);
        cnt[highBit] += left + 1;
		n = left;
		len--;
	}
   	for (long long i = 0; i<tmp; ++i)
		cnt[0] -= (long long)pow(10.0, i);
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值