DMOPC '15 Contest 7 P2 - Not a Wall of Text

View as PDF
Submit solution
Points: 3 (partial)
Time limit: 2.0s
Memory limit: 64M
Author:
FatalEagle
Problem type

After seeing the first problem, you are probably very angry at the fact that you wasted a lot of time reading. For this problem, you should just count the number of words you have to read in a text. That's it. No tricks, no hidden catches. For the purposes of this problem, a word is any maximal contiguous group of non-whitespace characters.

Input Specification

The input will be a text with only lowercase letters and spaces (ASCII code 32). You should count how many words there are. The only constraint is that the length of the entire text will not exceed 80 characters (because nobody likes essays). Also, there won't be anything tricky like double whitespace in a row, leading whitespace, or trailing whitespace because we don't roll like that. In fact, we won't even give you a trailing newline to deal with.

Output Specification

Output the number of words in the text.

Sample Input

problem one is really long

Sample Output

5

Comments


  • -14
    ouderkirk  commented on Aug. 29, 2024, 9:47 p.m. ← edited

    This comment is hidden due to too much negative feedback. Show it anyway.


  • -1
    amei  commented on Aug. 11, 2024, 4:38 p.m.

    don't write the answer here they will copy it


  • 2
    DarkUnicast  commented on June 16, 2024, 9:47 a.m.

    I initially tried to solve it myself, without going to the solution in the book, but it was clear that I kept failling so I just applied the solution in the book which seems way simpler than what I tried. So far I like how this book is structured.