#include <stdio.h>
#include <stdlib.h>
int main()
{
int a[10] = {0,1,20,300,4000,50000,600000,7000000,80000000,900000000};
int b[10] = {0,1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000};
int n =11;
int x[10] = {11,1,1};//n每位上的数:个位->高位 不包括x[0]
int m;
scanf("%d %d",&n,&m);
int len_n = 0;
x[0] = n;
while(x[0]!=0){
len_n ++;
x[len_n] = x[0]%10;
x[0] = x[0]/10;
}
int m1[10] = {0,1,2,3};//要统计的数的数组
for(int i= 1;i<=m;i++)
{
scanf("%d",&m1[i]);
}
int count=0;
for(int i=1;i<=m;i++) //对m1中的每个数进行循环
{
count=0;
for(int j=len_n;j>=1;j--)
{
count += (x[j] * a[j-1] + ((x[j]>m1[i]) ? b[j] : ((x[j] ==m1[i]) ? (n%b[j] + 1) : 0)));
}
printf("%d\n",count);
}
return 0;
}
0-n内 m出现的次数
最新推荐文章于 2022-11-21 21:26:14 发布