Discussion @ 1231. Turing: One, Two, Three, … @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1231. Turing: One, Two, Three, …

n=?

Posted by Bora Milutinovic 5 Nov 2002 19:23

Re: n=?

Posted by Leonid Volkov 6 Nov 2002 16:47

You are to solve this problem by writing such a Turing machine
program, which changes all-but-one dashes to pluses for any N for a
given K.