题目这么说的：编写一个程序，打印输入中单词长度的直方图。水平方向的直方图比较容易绘制，垂直方向的直方图则要困难些。
我现在不是想知道代码怎么写，我是觉得我不懂这道题到底是什么意思。

#include <stdio.h>

#define MAXHIST 15
#define MAXWORD 11
#define IN        1
#define OUT        0

int main(){
    int c, i, nc, state;
    int len;
    int maxvalue;
    int ovflow;
    int wl[MAXWORD];
   
    state = OUT;
    nc = 0;
    ovflow = 0;
    for ( i = 0 ; i < MAXWORD ; ++i)
        wl[i] = 0;
    while ((c = getchar()) != EOF) {
        if ( c == ' ' || c == '\n' || c == '\t' ){
            state = OUT;
            if ( nc > 0 )
                if ( nc < MAXWORD )
                    ++wl[nc];
                else
                    ++ovflow;
                nc = 0;
        }
        else if ( state == OUT){
            state = IN;
            nc = 1;            
        }
        else
            ++nc;
    }
    maxvalue = 0;
    for ( i = 1; i < MAXWORD; ++i )
        if ( wl[i] > maxvalue )
            maxvalue = wl[i];
    for ( i = 1; i < MAXWORD ; ++i ){
        printf ( "%5d - %5d : ", i, wl[i] );
        if ( wl[i] > 0 ){
            if(( len = wl[i] * MAXHIST / maxvalue ) <= 0)
                len = 1;
        }
        else
            len = 0;
        while ( len > 0 ) {
            putchar ( '*' );
            --len;
        }
        putchar( '\n' );
    }
    if ( ovflow > 0 )
        printf ( "There are %d words >= %d\n", ovflow, MAXWORD );
}



这是参考代码，我读了一下，有点儿晕，还是不懂这道题的意思。。

我还拿来运行了。。表示还是看不明白啊啊啊啊啊啊

好吧，我把书上给的注释加上。。。

#include <stdio.h>

#define MAXHIST 15
#define MAXWORD 11
#define IN        1
#define OUT        0

int main(){
    int c, i, nc, state;
    int len;                //length of each bar
    int maxvalue;            //maximum value for wl[]
    int ovflow;                //number of overflow words
    int wl[MAXWORD];        //word length counters
   
    state = OUT;
    nc = 0;                    //number of chars in a word
    ovflow = 0;                //number of words >= MAXWORD
    for ( i = 0 ; i < MAXWORD ; ++i)
        wl[i] = 0;
    while ((c = getchar()) != EOF) {
        if ( c == ' ' || c == '\n' || c == '\t' ){
            state = OUT;
            if ( nc > 0 )
                if ( nc < MAXWORD )
                    ++wl[nc];
                else
                    ++ovflow;
                nc = 0;
        }
        else if ( state == OUT){
            state = IN;
            nc = 1;            //beginning of a new word
        }
        else
            ++nc;            //inside a word
    }
    maxvalue = 0;
    for ( i = 1; i < MAXWORD; ++i )
        if ( wl[i] > maxvalue )
            maxvalue = wl[i];
    for ( i = 1; i < MAXWORD ; ++i ){
        printf ( "%5d - %5d : ", i, wl[i] );
        if ( wl[i] > 0 ){
            if(( len = wl[i] * MAXHIST / maxvalue ) <= 0)
                len = 1;
        }
        else
            len = 0;
        while ( len > 0 ) {
            putchar ( '*' );
            --len;
        }
        putchar( '\n' );
    }
    if ( ovflow > 0 )
        printf ( "There are %d words >= %d\n", ovflow, MAXWORD );
}