Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

The cleverest person on /prog? (currently) challenge!

Name: Anonymous 2016-08-19 12:32

challenges tba by challengers!
1 on 1 battles!

Name: Anonymous 2016-08-20 10:21

>>4
Like all other programming problems this is best solved in QBasic.

10 REM TREE is an adjacency matrix describing a tree
20 REM NNODES is the number of nodes in the tree
25 REM For this task, the program must traverse the nodes
26 REM so the adjacency matrix is irrelevant
30 FOR I=1 TO NNODES
40 PRINT "FOUND NODE ";I
50 NEXT I
60 PRINT "WHAT ACCEPTABLE LISP IS THIS?"

Newer Posts