#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

typedef struct{
    char *words;
    int count;
}Word;

void error(char *s)
{
    fprintf(stderr,"%s\n",s);
    exit(1);
}
char *strsave(char *s)
{
    char *p;
    if((p=malloc(strlen(s)+1))==NULL)
        error("can not get memory for string");
    strcpy(p,s);
    return(p);
}
int regist_string(char *s,int smax,char *pw[])
{
    int i;
    for(i=0;i<smax;++i)
        if(!strcmp(s,pw[i]))
            return smax;
        pw[smax++]=strsave(s);
        return(smax);
}
void sortlist(int cmax,char *pw[])
{
    int gap,i,j,n;
    char *p,*w;
    for(i=0;i<n;++i){
        for(j=i;j<n;++j){
            if(strcmp(pw[j],pw[i])<0){
                w=pw[j];
                pw[j]=pw[i];
                pw[i]=w;
            }
        }
    }
}
int getword(int bmax,char *s)
{
    int c,i=0;
    for(i=0;i<bmax-1;++i){
        if(('a'<=(c=getchar())&&c<='z')
||      ('A'<=c&&c<='Z'))
            *s++=c;
        else
            break;
    }
    *s='\0';
    if(c==EOF&&i<=0)i=-1;
    return(i);
}
int main(int argc,char *argv[])
{
    int i,smax,len;
    char str[80];
    char *words[2048];

    smax=0;
    while(len=getword(80,str)){
        if(len==0)continue;
        smax=regist_string(str,smax,words);
    }
    sortlist(smax,words);
    for(i=0;i<smax;++i)
        printf("%d:%s\n",,words[i]);
}

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>

#define BUF_SIZE 80
#define MAX_WORD_NUM 2048
#define Error(msg) fprintf(stderr,"%s [Line:%d]\n", msg, __LINE__), exit(1)

typedef struct {
    char * word;
    int freq;
} WORD;

char * strdup(const char * s)
{
    char * p;
    if ((p = malloc(strlen(s)+1)) == NULL) {
        Error("Out of memory.");
    }
    return strcpy(p, s);
}

int GetWord(char * s, int len)
{
    int c, i = 0;
    while (i < len-1 && (c = getchar()) != EOF && c != '\n') {
        if (isalpha(c)) {
            s[i++] = c;
        }
    }
    s[i] = '\0';
    return i;
}

int RegistWord(char * s, int smax, WORD words[])
{
    int i;
    for (i = 0; i < smax; ++i) {
        if (strcmp(s, words[i].word) == 0) {
            ++words[i].freq;
            return 0;
        }
    }
    words[i].word = strdup(s);
    return 1;
}

int CompareWord(const void * e1, const void * e2)
{
    const WORD * w1 = e1;
    const WORD * w2 = e2;
    return w2->freq - w1->freq;
}

int main(int argc, char * argv[])
{
    char buf[BUF_SIZE];
    int smax = 0, i;
    WORD words[MAX_WORD_NUM] = {0};
    while(GetWord(buf, BUF_SIZE)){
        smax += RegistWord(buf, smax, words);
    }
    qsort(words, smax, sizeof(WORD), CompareWord);
    for (i = 0; i < smax; ++i) {
        printf("%d:%s %d回\n", i+1, words[i].word, words[i].freq);
        free(words[i].word);
    }
    return 0;
}

#include <stdio.h>
#include <stdlib.h>

/* プロトタイプ宣言 */
int sortfunc( const void *n1, const void *n2 );

int main( void )
{
    int i;

    /* 初期データ */
    static int num[10] = { 9, 5, 1 ,7, 2, 6, 8, 4, 0, 3 };

    /* データのソート */
    qsort( (void *)num, 10, sizeof(int), sortfunc );

    /* 結果の表示 */
    for( i = 0; i < 10; i++ )   printf( "%d ", num[i] );
    putchar('\n');

    return 0;
}

/* ソート関数(昇順ソートさせる) */
int sortfunc( const void *n1, const void *n2 )
{
    int *pn1 = (int *)n1;
    int *pn2 = (int *)n2;

    if( *pn1 < *pn2 ){
        return -1;
    }
    else if( *pn1 > *pn2 ){
        return 1;
    }
    return 0;
}