CRGreathouse wrote:Ah yes, I see you now. You stopped when you saw that 8 and 10 were hard. Heh, I hated those sorts of problems that deal more with strings than with numbers -- Pari's ill-suited for those. For the worst of them I had to write C or C# code to solve them.\
12 and 13 are ordinary computation problems again, and 14 is your kind of recursive problem, more of a Haskell/Scheme/etc. problem than the other so far IMO.
Yeah... mostly I just haven't gotten back into it... my problem wasn't that they were hard, but that the only viable solution I could think of was messy... and I don't have fun doing something messy-- since I don't need to be doing it, I didn't do them.
I'll look at 14 though... I'm procrastinating on 2 assignments (probabilistic method, and a linked list in C/learning gdb) and a project I've imposed on myself (a binomial tree in Haskell... I just realized the absurdity of having to do all 3 of those at the same time.)
<Aoi-chan> everyone's first vi session. ^C^C^X^X^X^XquitqQ!qdammit[esc]qwertyuiopasdfghjkl;:xwhat