1049. Counting Ones (30)计算个位数出现次数.

最新推荐文章于 2020-09-17 14:24:02 发布

shizheng163

最新推荐文章于 2020-09-17 14:24:02 发布

阅读量500

点赞数

本文链接：https://blog.csdn.net/shizheng163/article/details/50846117

版权

PAT解题报告专栏收录该内容

83 篇文章 0 订阅

订阅专栏

传送门:https://www.patest.cn/contests/pat-a-practise/1049

#include <iostream>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <string.h>
#include <unordered_map>
#include <map>
using namespace std;
int a[10]={0};
void deal(int n,int value){
    if(n<=0)
        return;
    int one,ten;
    one = n%10;
    n/=10;
    ten=n;
    for (int i=0; i<=one; ++i) {//个位上出现的数统计下来
        a[i]+=value;
    }
    while (ten) {
        a[ten%10]+= (one+1)*value;
        ten/=10;
    }
    for (int i=0; i<10; ++i) {
        a[i]+=value*n;
    }
    a[0]-=value;//第一位是0的情况排除.
    deal(n-1,value*10);
}
int main(){
    int n;
    scanf("%d",&n);
    deal(n,1);
    printf("%d\n",a[1]);
    return 0;
}