ABC problem: Difference between revisions

{{task}}

 

 

;Example:

True

>>> can_make_word("BARK")

True

>>> can_make_word("CONFUSE")

<br><br>

 

=={{header|Acurity Architect}}==

Using #HASH-OFF

</pre>

FUNCTION bCAN_MAKE_WORD(zWord: STRING): BOOLEAN

VAR sBlockCount: SHORT

RETURN OCCURS(zUsedBlocks, ",") = sWordLength

ENDFUNCTION

{{out}}

<pre>

</pre>

 

use Ada.Characters.Handling;

 

end loop;

end Abc_Problem;

 

{{out}}

=={{header|ALGOL 68}}==

{{works with|ALGOL 68G|Any - tested with release 2.8.win32}}

 

# construct the list of blocks #

 

)

Output:

<pre>

 

=={{header|ALGOL W}}==

begin

% Returns true if we can spell the word using the blocks, %

testCanSpell( "confuse", 7 )

end

{{out}}

<pre>

 

=={{header|Apex}}==

if (String.isEmpty(word)) {

return true;

System.debug('"COMMON": ' + canMakeWord(blocks, 'COMMON'));

System.debug('"SQuAd": ' + canMakeWord(blocks, 'SQuAd'));

{{out}}

<pre>"": true

"SQuAd": true

"CONFUSE": true</pre>

 

=={{header|AppleScript}}==

 

canMakeWordWithBlocks("a", blocks)

 

on canMakeWordWithBlocks(theString, constBlocks)

end canMakeWordWithBlocks

 

=={{header|AutoHotkey}}==

 

'''Function'''

o := {}

loop, parse, blocks, `n, `r

added := 1

}

 

'''Test Input''' (as per question)

(

BO

loop, parse, wordlist, `n

out .= A_LoopField " - " isWordPossible(blocks, A_LoopField) "`n"

 

{{out}}

CONFUSE - 1</pre>

 

 

 

 

 

 

 

 

 

 

=={{header|BASIC}}==

Works with:VB-DOS, QB64, QBasic, QuickBASIC

' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '

' ABC_Problem '

 

END FUNCTION

 

=={{header|BBC BASIC}}==

{{works with|BBC BASIC for Windows}}

PROCcan_make_word("A")

PROCcan_make_word("BARK")

ENDWHILE

IF word$>"" PRINT "False" ELSE PRINT "True"

 

{{out}}

Confuse -> True

</pre>

 

=={{header|Bracmat}}==

( can-make-word

= ABC blocks

& can-make-word'SQUAD

& can-make-word'CONFUSE

{{out}}

<pre>A yes

=={{header|C}}==

Recursive solution. Empty string returns true.

#include <ctype.h>

 

 

return 0;

{{out}}

<pre>

</pre>

 

===Regex===

This Method uses regular expressions to do the checking. Given that n = length of blocks string and

m = length of word string, then CheckWord's time complexity comes out to about m*(n - (m-1)/2).

using System.IO;

// Needed for the method.

return true;

}

{{out}}

<pre>

</pre>

'''Unoptimized'''

using System.Linq;

 

}

}

{{out}}

<pre>

SQUAD :True

CONFUSE :True</pre>

 

=={{header|Ceylon}}==

<b>module.ceylon</b>

 

module rosetta.abc "1.0.0" {}

 

<b>run.ceylon</b>

 

shared void run() {

printAndCanMakeWord("A", blocks);

myRemainingLetterIndexes)

else false;

 

{{out}}

=={{header|Clojure}}==

A translation of the Haskell solution.

(def blocks

(-> "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM" (.split " ") vec))

(doseq [word ["A" "BARK" "Book" "treat" "COMMON" "SQUAD" "CONFUSE"]]

 

{{out}}

SQUAD: true

CONFUSE: true</pre>

 

=={{header|CoffeeScript}}==

 

canMakeWord = (word="") ->

# Expect true, true, false, true, false, true, true, true

for word in ["A", "BARK", "BOOK", "TREAT", "COMMON", "squad", "CONFUSE", "STORM"]

 

{{out}}

CONFUSE -> true

STORM -> true</pre>

 

=={{header|Common Lisp}}==

(defun word-possible-p (word blocks)

(cond

collect (word-possible-p

(subseq word 1)

 

{{out}}

> (word-possible-p "abba" '("AB" "AB" "AC" "AC"))

T</pre>

 

=={{header|D}}==

{{trans|Python}}

A simple greedy algorithm is enough for the given sequence of blocks. canMakeWord is true on an empty word because you can compose it using zero blocks.

 

bool canMakeWord(in string word, in string[] blocks) pure /*nothrow*/ @safe {

foreach (word; "" ~ "A BARK BoOK TrEAT COmMoN SQUAD conFUsE".split)

writefln(`"%s" %s`, word, canMakeWord(word, blocks));

{{out}}

<pre>"" true

===@nogc Version===

The same as the precedent version, but it avoids all heap allocations and it's lower-level and ASCII-only.

 

bool canMakeWord(in string word, in string[] blocks) nothrow @nogc

foreach (word; "" ~ "A BARK BoOK TrEAT COmMoN SQUAD conFUsE".split)

writefln(`"%s" %s`, word, canMakeWord(word, blocks));

 

===Recursive Version===

This version is able to find the solution for the word "abba" given the blocks AB AB AC AC.

{{trans|C}}

 

alias Block = char[2];

immutable word = "abba";

writefln(`"%s" %s`, word, blocks2.canMakeWord(word));

{{out}}

<pre>"" true

===Alternative Recursive Version===

This version doesn't shuffle the input blocks, but it's more complex and it allocates an array of indexes.

 

alias Block = char[2];

immutable word = "abba";

writefln(`"%s" %s`, word, blocks2.canMakeWord(word));

The output is the same.

 

=={{header|Delphi}}==

Just to be different I implemented a block as a set of (2) char rather than as an array of (2) char.

{$APPTYPE CONSOLE}

 

readln;

end.

 

{{out}}

Can make SQUAD

Can make CONFUSE

</pre>

 

=={{header|EchoLisp}}==

(lib 'list) ;; list-delete

 

(spell (string-rest word) (list-delete blocks block))))))

{{out}}

<pre>

=={{header|Ela}}==

{{trans|Haskell}}

 

:::IO

 

mapM_ (\w -> putLn (w, not << null $ abc blocks (map char.upper w)))

 

{{out}}

("A",true)

("",true)</pre>

=={{header|Elena}}==

{

}

"GT", "RE", "TG", "QD", "FS",

"JW", "HU", "VI", "AN", "OB",

{{out}}

<pre>

=={{header|Elixir}}==

{{trans|Erlang}}

def can_make_word(word, avail) do

end

defp can_make_word(_, [], _), do: false

defp can_make_word([l|tail], [b|rest], tried) do

or can_make_word([l|tail], rest, [b|tried])

end

blocks = ~w(BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM)c

~w(A Bark Book Treat Common Squad Confuse) |>

 

{{out}}

Squad: true

Confuse: true

</pre>

 

=={{header|Erlang}}==

-export([can_make_word/1, can_make_word/2, blocks/0]).

 

main(_) -> lists:map(fun(W) -> io:fwrite("~s: ~s~n", [W, can_make_word(W)]) end,

["A","Bark","Book","Treat","Common","Squad","Confuse"]).

 

{{Out}}

 

=={{header|ERRE}}==

PROGRAM BLOCKS

 

CANMAKEWORD("Confuse")

END PROGRAM

 

=={{header|Euphoria}}==

implemented using OpenEuphoria

include std/text.e

 

 

if getc(0) then end if

{{out}}

<pre>

=={{header|F_Sharp|F#}}==

<p>This solution does not depend on the order of the blocks, neither on the symmetry of blocks we see in the example block set. (Symmetry: if AB is a block, an A comes only with another AB|BA)</p>

let rec look_for_right_candidate candidates noCandidates c rest =

match candidates with

 

List.iter (fun w -> printfn "Using the blocks we can make the word '%s': %b" w (spell_word_with blocks w)) words

{{out}}

<pre>h:\RosettaCode\ABC\Fsharp>RosettaCode "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM" a bark book threat common squad confuse

h:\RosettaCode\ABC\Fsharp>RosettaCode "US TZ AO QA" Auto

Using the blocks we can make the word 'AUTO': true</pre>

 

=={{header|FBSL}}==

This approach uses a string, blanking out the pair previously found. Probably faster than array manipulation.

#APPTYPE CONSOLE

SUB MAIN()

RETURN TRUE

END FUNCTION

{{out}}

<pre>

Press any key to continue...

</pre>

 

=={{header|Fortran}}==

Attempts to write the word read from unit 5. Please find the output, bash command, and gfortran compilation instructions as commentary at the start of the source, which starts right away!

!Compilation started at Thu Jun 5 01:52:03

!

end subroutine ucase

 

 

===But if backtracking might be needed===

 

The following source begins with some support routines. Subroutine PLAY inspects the collection of blocks to make various remarks, and function CANBLOCK reports on whether a word can be spelled out with the supplied blocks. The source requires only a few of the F90 features. The MODULE protocol eases communication, but the key feature is that subprograms can now declare arrays of a size determined on entry via parameters. Previously, a constant with the largest-possible size would be required.

MODULE PLAYPEN !Messes with a set of alphabet blocks.

INTEGER MSG !Output unit number.

END DO

END

Output: the first column of T/F is the report from CANBLOCK, the second is the expected answer from the example, and the third is whether the two are in agreement.

<pre>

T T T SQUAD

T T T CONFUSE

</pre>

 

=={{header|Go}}==

 

import (

fmt.Println(word, sp(word))

}

{{out}}

<pre>

=={{header|Groovy}}==

Solution:

def blocks

 

word.every { letter -> blocksLeft.remove(blocksLeft.find { block -> block.contains(letter) }) }

}

 

Test:

"JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"])

 

['', 'A', 'BARK', 'book', 'treat', 'COMMON', 'SQuAd', 'CONFUSE'].each {

println "'${it}': ${a.canMakeWord(it)}"

 

{{out}}

=={{header|Harbour}}==

Harbour Project implements a cross-platform Clipper/xBase compiler.

 

LOCAL cStr

NEXT

 

{{out}}

<pre>

 

The following function returns a list of all the solutions. Since Haskell is lazy, testing whether the list is null will only do the minimal amount of work necessary to determine whether a solution exists.

import Data.Char (toUpper)

 

main :: IO ()

main = mapM_ (\w -> print (w, not . null $ abc blocks (map toUpper w)))

 

{{out}}

("conFUsE",True)

</pre>

 

=={{header|Icon}} and {{header|Unicon}}==

 

Works in both languages:

blocks := ["bo","xk","dq","cp","na","gt","re","tg","qd","fs",

"jw","hu","vi","an","ob","er","fs","ly","pc","zm",&null]

}

}

 

Sample run:

"CONFUSE" can be spelled with blocks.

->

</pre>

 

=={{header|J}}==

'''Solution:'''

'rows cols'=. i.&.> $y

for_c. cols do.

)

 

'''Examples:'''

ExampleWords=: <;._2 'A BaRK BOoK tREaT COmMOn SqUAD CoNfuSE '

 

"COmMOn" F

"SqUAD" T

 

'''Tacit version'''

uppc=:(-32*96&<*.123&>)&.(3&u:)

reduc=: ] delElem 1 i.~e."0 1

 

{{out}}

Another approach might be:

 

ExampleWords=: ;: 'A BaRK BOoK tREaT COmMOn SqUAD CoNfuSE '

 

need=: #/.~ word,word

relevant=: (x +./@e."1 word) # x

+./(((#need){. #/.~)"1 candidates) */ .>:need

 

Example use:

 

1

Blocks canform 1{::ExampleWords

1

Blocks canform 6{::ExampleWords

 

Explanation:

For example:

 

1

word

ANN

AAA

 

 

=={{header|Java}}==

{{trans|C}}

{{works with|Java|1.6+}}

 

 

{{out}}

<pre>"": true

 

=={{header|JavaScript}}==

The following method uses regular expressions and the string replace function to allow more support for older browsers.

 

function CheckWord(blocks, word) {

for(var i = 0;i<words.length;++i)

console.log(words[i] + ": " + CheckWord(blocks, words[i]));

 

Result:

</pre>

 

 

var strBlocks =

return strWords.split(' ').map(solution).join('\n');

 

{{Out}}

bark -> BO NA RE XK

BooK: [no solution]

COMMON: [no solution]

squAD -> FS DQ HU NA QD

 

===ES6===

let blocks = characters.split(" ").map(pair => pair.split(""));

"CONFUSE"

].forEach(word => console.log(`${word}: ${isWordPossible(word)}`));

 

Result:

SQUAD: true

CONFUSE: true</pre>

 

=={{header|jq}}==

# when_index(cond;ary) returns the index of the first element in ary

# that satisfies cond; it uses a helper function that takes advantage

else .[1:] | abc($blks)

end

["BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS",

"JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"] as $blocks

| ("A", "BARK","BOOK","TREAT","COMMON","SQUAD","CONFUSE")

{{Out}}

A : true

SQUAD : true

CONFUSE : true

 

=={{header|Julia}}==

BARK | true

BOOK | false

CONFUSE | true</pre>

 

=={{header|Kotlin}}==

{{trans|Java}}

fun run() {

println("\"\": " + blocks.canMakeWord(""))

}

 

 

private fun Array<String>.canMakeWord(word: String): Boolean {

return true

 

var i = 0

forEach { b ->

return false

}

}

 

{{out}}

<pre>"": true

SQuAd: true

CONFUSE: true</pre>