Miscellaneous > Programming & Networking

Re: Let's play a game, pals.

<< < (4/4)

worker201:

--- Quote from: solemnwarning ---i already posted answer
--- End quote ---

Except yours only works when n=3.  What if n=8?

I tried Tux's with n=6, and it worked.  Right on!

I really don't have the skills with initializing and populating arrays at this time, so I failed the challenge.  Currently, I am working through the first chapter of K&R, relearning for loops.  The last programming language I used (besides awk and JavaScript) was C++ in '97.  So I kinda have to relearn.

KernelPanic:

--- Quote from: worker201 ---Except yours only works when n=3.  What if n=8?

I tried Tux's with n=6, and it worked.  Right on!

I really don't have the skills with initializing and populating arrays at this time, so I failed the challenge.  Currently, I am working through the first chapter of K&R, relearning for loops.  The last programming language I used (besides awk and JavaScript) was C++ in '97.  So I kinda have to relearn.
--- End quote ---


Yup I know how you feel.
I used to do a bit of C++ but now feel absolutely retarded when faced with a problem like this. :(
Time to brush up on things.

Pathos:
recursion is always the best solution :)

Anyway, in this excerise a recursive solution is pretty much the same as the iterative.

KernelPanic:
I was bored so I edited my script to format the results properly,
again it is kludgy.
Attached as matrix.txt :)


Also, I want one of you fuckers to demonstrate a solution in C/C++ or maybe Pascal so I can learn from it.
Preferably using function recursion but anything is good. :D

[verwijderd door de beheerder]

worker201:
Nice work, I have verified your correctness using n=8.

Navigation

[0] Message Index

[*] Previous page