法一:纯C写法,和字符串没有太大关系
(vjudge AC)
//Digit Counting
#include <stdio.h>
#include <string.h>
int main(){
int a[20];
int T,n;
scanf("%d",&T);
while(T–){
memset(a,0,sizeof(a));
scanf("%d",&n);
for(int i=1;i<=n;i++){
int num=i;
while(num>0){
a[num%10]++;
num=num/10;
}
}
printf("%d",a[0]);
for(int i=1;i<=9;i++)
printf(" %d",a[i]);
printf("\n");
}
return 0;
}
法二:STL写法,思路来源于Tokyo_z
(vjudge AC)
//Digit Counting
//19+299+3999+…+59999
#include <stdio.h>
#include <string.h>
#include
using namespace std;
int main(){
int T,n;
char buf[543219];
scanf("%d",&T);
while(T–){
memset(buf,0,sizeof(buf));
scanf("%d",&n);
for(int i=1;i<=n;i++){
sprintf(buf+strlen(buf),"%d",i);//将数字i输入到buf中
}
//使用count()计算字符出现次数或遍历
char c=‘0’;
while(c!=‘9’+1){
int num=count(buf,buf+543219,c);
if(c==‘0’) printf("%d",num);
else printf(" %d",num);
c++;
}
printf("\n");
}
return 0;
}