If you have written a program in a functional language (or Python, or Java) and received TLE, if you are convinced that you are using the best possible approach (in particular, that an equivalent program in C would have … read more

(define (do_it n) (define (print_it n) (display n) (newline)) (cond ((not(= n 42)) (print_it n) (do_it (read))))) (do_it (read))

-module(tested). -export([main/0]). main() -> loop(). loop() -> case io:fread( "","~d" ) of eof -> true; {ok, X} -> [Y] = X… read more

(loop (let ((a (read))) (when (= a 42) (return)) (princ (format nil "~D~%" a))))

let _ = let rec write i = print_int i; print_newline (); read () and read () = match read_int () with | 42 -> () | i -> write i in read () ;;

main = interact f where f = unlines . takeWhile (/="42") . words

The program is run via the sequence of commands: (clear)(load "...")(reset)(assert spoj-non-interactive)(run). Don't make any assumptions about the strategy of inferrence (it is currently DFS, but subject to change to BF… read more

The first and only predicate to be checked is 'program', with no arguments. program :- get_char(X),get_char(Y),check(X,Y). check('4','2'):-!. check(X,Y):-write(X),get_char(Z),check(Y,Z).

Discussion on functional and predicate programming languages (Haskell, O'Caml, Prolog, Scheme, Lisp, Clips) at SPOJ