I propose the following for the next week quiz:
Write a ruby program that takes a sentence as its input an produces an
output that autoreferentially describes the letters found in the
sentence and the description itself.
This is an example in italian:
Questa nota contiene esattamente: cinque A sette C nove D diciotto E
dodici I due M otto N undici O tre Q due R sei S diciotto T sette U
This note contains exactly: five A’s seven C’s nine D’s eighteen E’s
twelve I’s two M’s eight N’s eleven O’s three Q’s two R’s six S’s
eighteen T’s seven U’s two V’s.
(which is false, but its’ true in the italian version).
I’m sorry I don’t have an English example at the moment, but I hope
that the problem is quite easy to understand anyway.