Hi, that's my version with i:
seq=: monad : '{.y+/(-@>:@| {. i:) (-/|.y)'
Mario
Devon McCormick schrieb am So., 8. Apr. 2018, 01:52:
> Thanks to everyone who answered - there were a few that were just what I
> needed.
>
> On Sat, Apr 7, 2018 at 6:48 AM, 'Pascal Jasmin' via Programming <
> pro
Here's a fun math challenge on Quora:
Find the number of 6-digit numbers made up of the digits 1, 2, and 3 which
have no digit recurring three or more times, consecutively?
The link to my answer on Quora is: https://goo.gl/BzBDQe
Skip Cave
Cave Consulting LLC
Not the fastest method...
f=: -.@:(1&e.)@:(#@:~."1)@(3&(]\))`0:@.(1&e.@:('0456789'&e.))@:":
D=: 1e5 + i. 1e6 - 1e5
+/ f"0 D
492
On Mon, 4/9/18, Skip Cave wrote:
Subject: [Jprogramming] Quora Problem
To: "programm...@jsoftware.com"
Date: Monday,
