Another update from ingydotnet^djgoku

Task/ABC-Problem/PureBasic/abc-problem-1.purebasic

@@ -0,0 +1,32 @@
+EnableExplicit
+#LETTERS = "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM "
+
+Procedure.s can_make_word(word.s)
+  Define.s letters = #LETTERS, buffer
+  Define.i index1, index2
+  Define.b match
+  For index1=1 To Len(word)
+    index2=1 : match=#False
+    Repeat
+      buffer=StringField(letters,index2,Space(1))
+      If FindString(buffer,Mid(word,index1,1),1,#PB_String_NoCase)
+        letters=RemoveString(letters,buffer+Chr(32),0,1,1)
+        match=#True
+        Break
+      EndIf
+      index2+1
+    Until index2>CountString(letters,Space(1))
+    If Not match : ProcedureReturn word+#TAB$+"FALSE" : EndIf
+  Next
+  ProcedureReturn word+#TAB$+"TRUE"
+EndProcedure
+
+OpenConsole()
+PrintN(can_make_word("a"))
+PrintN(can_make_word("BaRK"))
+PrintN(can_make_word("BOoK"))
+PrintN(can_make_word("TREAt"))
+PrintN(can_make_word("cOMMON"))
+PrintN(can_make_word("SqUAD"))
+PrintN(can_make_word("COnFUSE"))
+Input()

Task/ABC-Problem/PureBasic/abc-problem-2.purebasic

@@ -0,0 +1,21 @@
+Define.i
+#LETTERS = "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM "
+
+Macro test(t)
+  Print(t+#TAB$+#TAB$+"= ") : If can_make_word(t) : PrintN("True") : Else : PrintN("False") : EndIf
+EndMacro
+
+Procedure.s residue(s$,n.i)
+  ProcedureReturn Left(s$,Int(n/3)*3)+Mid(s$,Int(n/3)*3+4)
+EndProcedure
+
+Procedure.b can_make_word(word$,letters$=#LETTERS)
+  n=FindString(letters$,Left(word$,1),1,#PB_String_NoCase)
+  If Len(word$) And n : ProcedureReturn can_make_word(Mid(word$,2),residue(letters$,n)) : EndIf
+  If Not Len(word$)   : ProcedureReturn #True : Else : ProcedureReturn #False           : EndIf
+EndProcedure
+
+OpenConsole()
+test("a")         : test("BaRK")      : test("BOoK")      : test("TREAt")
+test("cOMMON")    : test("SqUAD")     : test("COnFUSE")
+Input()