Difference between revisions of "Haskell Quiz/Posix Pangrams"
Jump to navigation
Jump to search
Jim Burton (talk | contribs) |
Jim Burton (talk | contribs) |
||
| Line 1: | Line 1: | ||
[[Category:Code]] |
[[Category:Code]] |
||
| − | RubyQuiz #97: Create pangrams (sentences containing every letter of the alphabet at least once) from the list of [[http://www.unix.org/version3/apis/cu.html|posix utilities]]. From the quiz page: "Pangrams should (1) use the fewest utilities and (2) have the minimum number of repeated letters. In either case, break ties on the other criterion; that is, your first solution should also have as few repeated letters as possible, and your second one should use as few utilities as possible." |
+ | RubyQuiz #97: Create pangrams (sentences containing every letter of the alphabet at least once) from the list of [[http://www.unix.org/version3/apis/cu.html|posix utilities]]. From the quiz page: "Pangrams should (1) use the fewest utilities and (2) have the minimum number of repeated letters. In either case, break ties on the other criterion; that is, your first solution should also have as few repeated letters as possible, and your second one should use as few utilities as possible." [[Haskell Quiz/Posix Pangrams/Posix Utils|List of the utilities]]. |
==The Problem== |
==The Problem== |
||
Revision as of 08:48, 27 October 2006
RubyQuiz #97: Create pangrams (sentences containing every letter of the alphabet at least once) from the list of [utilities]. From the quiz page: "Pangrams should (1) use the fewest utilities and (2) have the minimum number of repeated letters. In either case, break ties on the other criterion; that is, your first solution should also have as few repeated letters as possible, and your second one should use as few utilities as possible." List of the utilities.