Normalize spaces without losing word boundaries

Original practice scenario: normalize a short club notice. The input is one available text line of at most 63 text characters, with no embedded null character and no tabs; only the ordinary space character separates words. Remove leading and trailing spaces, replace every internal run of spaces by one space, and preserve all nonspace characters exactly. A word is a maximal nonspace run. Write a function that returns the word count and writes a terminated normalized string into a separate char[64]. Write a driver that reads the bounded line and prints words=N text=[normalized]. An empty or all-space line has zero words. Explain why the output cannot need more storage than the input text plus its terminator. You may rely on the stated maximum input length; do not silently claim this driver rejects longer lines.


