Railway circuit: Difference between revisions

{{draft task}}

 

 

 

 

 

 

 

 

=={{header|EchoLisp}}==

;; R is turn counter in right direction

;; The nb of right turns in direction i

(printf "Number of circuits C%d,%d : %d" maxn straight (vector-length *circuits*)))

(when (< (vector-length *circuits*) 20) (for-each writeln *circuits*)))

{{out}}

<pre>

=={{header|Go}}==

{{trans|Kotlin}}

 

import "fmt"

}

circuits(12, 4)

 

{{out}}

1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0

</pre>

 

=={{header|Java}}==

{{works with|Java|8}}

 

import static java.util.Arrays.stream;

return carry != 1;

}

<pre>1 solution(s) for C12,0

1 1 1 1 1 1 1 1 1 1 1 1

1 1 1 1 1 1 0 0 1 1 1 1 1 1 0 0

1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 0

</pre>

 

{{trans|Java}}

It takes several minutes to get up to n = 32. I called it a day after that!

 

const val RIGHT = 1

for (n in 12..32 step 4) circuits(n, 0)

circuits(12, 4)

 

{{out}}

1 1 1 1 0 1 1 0 1 1 1 1 0 1 1 0

</pre>

 

=={{header|Racket}}==

Made functional, so builds the track up with lists. A bit more expense spent copying vectors, but this solution avoids mutation (except internally in <code>vector+=</code> . Also got rid of the maximum workload counter.

 

 

(define-syntax-rule (vector+= v idx i)

(gen 20)

(gen 24)

 

{{out}}

(0 1 1 0 1 1 1 1 0 1 1 0 1 1 1 1)

(0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1)</pre>

 

=={{header|zkl}}==

{{trans|EchoLisp}}

// The nb of right turns in direction i

// must be = to nb of right turns in direction i+6 (opposite)

else println("Number of circuits C%,d,%d : %d".fmt(maxn,straight,_circuits.len()));

if(_circuits.len()<20) _circuits.apply2(T(T("toString",*),"println"));

gen(16); println();

gen(20); println();

gen(24); println();

{{out}}

<pre>