Xref: utzoo comp.lang.c:17519 comp.sys.amiga.tech:4555 comp.lang.modula2:1413 comp.lang.pascal:1685 rec.humor:20575
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!rutgers!bellcore!texbell!uhnix1!sun2!rr
From: rr@sun2.cs.uh.edu (Ravindran Ramachandran)
Newsgroups: comp.lang.c,comp.sys.amiga.tech,comp.lang.modula2,comp.lang.pascal,rec.humor
Subject: Re: Another Silly programming puzzle....
Summary: Silly.
Keywords: contest silly
Message-ID: <3846@uhnix1.uh.edu>
Date: 8 Apr 89 16:53:10 GMT
References: <1210@microsoft.UUCP> <12320@reed.UUCP> <1744@aucs.UUCP>
Sender: nntppost@uhnix1.uh.edu
Reply-To: rr@cs.uh.edu (Ravindran Ramachandran)
Followup-To: comp.lang.c
Organization: University of Houston
Lines: 19

In article <1744@aucs.UUCP> 850347s@aucs.UUCP (Hume Smith) writes:
>reeder@reed.UUCP (Doug Reeder) almost, but not quite, wrote
>}- program decode(input, output, code, plain);
>}- [ ... ]
>}- end.
>
>exactly why i hate pascal - a hundred lines of illegibility instead of the
>2 or 3 you'd have in C.
>
>i wonder if i can do this in Lisp...

Write a parallel program to implement this:
Use 27 nodes. Each node is sent the corresponding character, and it outputs
the ROT13ed character. Have a `manager' node to collect all the characters
back together and output it.

 -- Ravi.

Disclaimer: My computer typed this in when I was not looking.