The following program works to count the individual occurrences of each digit from 0-9 , each alphabet a-z and A-Z .
Program follows :
Program follows :
#include<stdio.h> int main(){ /*Program in C to count the number of whitespaces , number of respective alphabats and the number of repective digits */ int i =0; char s[1000]; int d[10]; int sp=0; int alpha[128]; for(i=0;i<10;++i){d[i]=0;} for(i=0;i<=127;++i){alpha[i]=0;} printf("Enter thy text hither : "); for(i=0;i<1000;++i){ scanf("%[^\n]s",s); } i=0; while(s[i]!='\0'){ if(s[i]==' '){ ++sp; }else{ if(s[i]>='0' && s[i]<='9'){ ++d[s[i]-'0']; }else{ int j=0; if((s[i]>='a' && s[i]<='z') || (s[i]>='A' && s[i]<='Z') ){ j=s[i]; ++alpha[j]; } } } ++i; } printf("THE TOTAL NUMBER OF WHITESPACES ARE : %d\n\n",sp); printf("THE TOTAL NUMBER OF RESPECTIVE DIGITS ARE : \n\n"); for(i=0;i<=9;++i){ printf("DIGIT %d occured %d times \n\n",i,d[i]); } printf("THE TOTAL NUMBER OF REPECTIVE ALPHABATS ARE : \n\n"); for(i=65;i<=90;++i){ printf("THE ALPHABAT %c OCCURED %d TIMES. \n",i,alpha[i]); } for(i=97;i<=122;++i){ printf("THE ALPHABAT %c OCCURED %d TIMES. \n",i,alpha[i]); } return 0; }Sample Output : hemant@hemant-desktop:~/code$ clear hemant@hemant-desktop:~/code$ gcc testa.c hemant@hemant-desktop:~/code$ a.out Enter thy text hither : My name is Hemant KUmar and my Dell badge ID is 123456789 THE TOTAL NUMBER OF WHITESPACES ARE : 11 THE TOTAL NUMBER OF RESPECTIVE DIGITS ARE : DIGIT 0 occured 0 times DIGIT 1 occured 1 times DIGIT 2 occured 1 times DIGIT 3 occured 1 times DIGIT 4 occured 1 times DIGIT 5 occured 1 times DIGIT 6 occured 1 times DIGIT 7 occured 1 times DIGIT 8 occured 1 times DIGIT 9 occured 1 times THE TOTAL NUMBER OF REPECTIVE ALPHABATS ARE : THE ALPHABAT A OCCURED 0 TIMES. THE ALPHABAT B OCCURED 0 TIMES. THE ALPHABAT C OCCURED 0 TIMES. THE ALPHABAT D OCCURED 2 TIMES. THE ALPHABAT E OCCURED 0 TIMES. THE ALPHABAT F OCCURED 0 TIMES. THE ALPHABAT G OCCURED 0 TIMES. THE ALPHABAT H OCCURED 1 TIMES. THE ALPHABAT I OCCURED 1 TIMES. THE ALPHABAT J OCCURED 0 TIMES. THE ALPHABAT K OCCURED 1 TIMES. THE ALPHABAT L OCCURED 0 TIMES. THE ALPHABAT M OCCURED 1 TIMES. THE ALPHABAT N OCCURED 0 TIMES. THE ALPHABAT O OCCURED 0 TIMES. THE ALPHABAT P OCCURED 0 TIMES. THE ALPHABAT Q OCCURED 0 TIMES. THE ALPHABAT R OCCURED 0 TIMES. THE ALPHABAT S OCCURED 0 TIMES. THE ALPHABAT T OCCURED 0 TIMES. THE ALPHABAT U OCCURED 1 TIMES. THE ALPHABAT V OCCURED 0 TIMES. THE ALPHABAT W OCCURED 0 TIMES. THE ALPHABAT X OCCURED 0 TIMES. THE ALPHABAT Y OCCURED 0 TIMES. THE ALPHABAT Z OCCURED 0 TIMES. THE ALPHABAT a OCCURED 5 TIMES. THE ALPHABAT b OCCURED 1 TIMES. THE ALPHABAT c OCCURED 0 TIMES. THE ALPHABAT d OCCURED 2 TIMES. THE ALPHABAT e OCCURED 4 TIMES. THE ALPHABAT f OCCURED 0 TIMES. THE ALPHABAT g OCCURED 1 TIMES. THE ALPHABAT h OCCURED 0 TIMES. THE ALPHABAT i OCCURED 2 TIMES. THE ALPHABAT j OCCURED 0 TIMES. THE ALPHABAT k OCCURED 0 TIMES. THE ALPHABAT l OCCURED 2 TIMES. THE ALPHABAT m OCCURED 4 TIMES. THE ALPHABAT n OCCURED 3 TIMES. THE ALPHABAT o OCCURED 0 TIMES. THE ALPHABAT p OCCURED 0 TIMES. THE ALPHABAT q OCCURED 0 TIMES. THE ALPHABAT r OCCURED 1 TIMES. THE ALPHABAT s OCCURED 2 TIMES. THE ALPHABAT t OCCURED 1 TIMES. THE ALPHABAT u OCCURED 0 TIMES. THE ALPHABAT v OCCURED 0 TIMES. THE ALPHABAT w OCCURED 0 TIMES. THE ALPHABAT x OCCURED 0 TIMES. THE ALPHABAT y OCCURED 2 TIMES. THE ALPHABAT z OCCURED 0 TIMES. hemant@hemant-desktop:~/code$
No comments:
Post a Comment