ZOJ Problem Set - 1151 Word Reversal

ZOJ Problem Set - 1151
Word Reversal

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

char word[200];

int main(void)
{
    int cases, line, i, j, count, len;
    while (scanf("%d", &cases) != EOF)
    {
        for (i = 0; i < cases; ++i)
        {
            scanf("%d", &line);
            for (count = 0; ; )
            {
                 scanf("%s", word);
                 len = strlen(word);
                 for (j = len - 1; j >= 0; --j)
                     putchar(word[j]);

                 char ch = getchar();
                 if (ch == '\n' || ch == '\r')
                 {
                    count++;
                    printf("\n");
                    if (count == line) break;
                 }
                 else putchar(ch);
            }
            if (i != cases - 1)  
                printf("\n");
        }
    }
    return 0;
}