Exactly three adjacent 3 in lists: Difference between revisions
Added Easylang
(Initial FutureBasic task solution added) |
(Added Easylang) |
||
| (5 intermediate revisions by 2 users not shown) | |||
Line 977:
1 2 3 4 5 6 7 8 9 -> false
4 6 8 7 2 3 3 3 1 -> true</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
lists[][] = [ [ 9 3 3 3 2 1 7 8 5 ] [ 5 2 9 3 3 7 8 4 1 ] [ 1 4 3 6 7 3 8 3 2 ] [ 1 2 3 4 5 6 7 8 9 ] [ 4 6 8 7 2 3 3 3 1 ] ]
func has3adj3 l[] .
for v in l[]
if v = 3
cnt += 1
else
if cnt = 3
break 1
.
cnt = 0
.
.
return if cnt = 3
.
for i to len lists[][]
write has3adj3 lists[i][] & " "
.
</syntaxhighlight>
{{out}}
<pre>
1 0 0 0 1
</pre>
=={{header|F_Sharp|F#}}==
Line 1,020 ⟶ 1,045:
{ 1 2 3 4 5 6 7 8 9 } -> f
{ 4 6 8 7 2 3 3 3 1 } -> t
</pre>
A somewhat simpler implementation without the fancy statistics and generalizations vocabs.
<syntaxhighlight lang=factor>USING: io kernel sequences ;
{
{ 9 3 3 3 2 1 7 8 5 }
{ 5 2 9 3 3 7 8 4 1 }
{ 1 4 3 6 7 3 8 3 2 }
{ 1 2 3 4 5 6 7 8 9 }
{ 4 6 8 7 2 3 3 3 1 }
}
[
[ [ 3 = ] count 3 = ]
[ { 3 3 3 } subseq-of? ]
bi and "true" "false" ? print
] each</syntaxhighlight>
{{out}}
<pre>
true
false
false
false
true
</pre>
Line 1,887 ⟶ 1,934:
=={{header|Wren}}==
{{libheader|Wren-seq}}
<syntaxhighlight lang="
var lists = [
Line 1,918 ⟶ 1,965:
</pre>
Or, more generally, replacing everything after 'lists' with the following:
<syntaxhighlight lang="
System.print("Exactly %(d) adjacent %(d)'s:")
for (list in lists) {
| |||