字符串统计
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 64173 Accepted Submission(s): 35106
Problem Description
对于给定的一个字符串,统计其中数字字符出现的次数。
Input
输入数据有多行,第一行是一个整数n,表示测试实例的个数,后面跟着n行,每行包括一个由字母和数字组成的字符串。
Output
对于每个测试实例,输出该串中数值的个数,每个输出占一行。
Sample Input
2 asdfasdf123123asdfasdf asdf111111111asdfasdfasdf
Sample Output
6 9
Author
lcy
Source
Recommend
lcy | We have carefully selected several similar problems for you: 2018 2025 2019 2020 2007
#include<stdio.h>
#include<String.h>
int main(){
int n;
while(scanf("%d",&n)!=EOF){
char str[100];
while(n--){
scanf("%s",&str);
int asc,num = 0;
for(int i = 0;i < strlen(str);i++){
asc = str[i];
if(asc>=48 && asc <=57){
num++;
}
}
printf("%d\n",num);
}
}
return 0;
}