Good morning and here comes the latest challenge.
https://git.qoto.org/Absinthe/onetonine/blob/master/README.md
The numbers 1 2 3 4 5 6 7 8 9 can have either the operator "+" or "-" placed between them.
As well, if no operator is placed, then the adjoining numbers go together such as 1 2 would
become "12" or 1 2 3 would become "123" and so forth.
The goal is to find the combinations that would make the line calculate up to 100 exactly.
Here is an example: 12 + 3 - 4 + 5 + 67 + 8 + 9 = 100
Would like maybe something other than eval().
@Absinthe
I'll reply to this, just so others will see it.
Common Lisp solution: https://github.com/billstclair/toy-programming-challenge/blob/master/zero-to-nine.lisp
#toyprogrammingchallenge
I'll reply to this, just so others will see it.
Common Lisp solution: https://github.com/billstclair/toy-programming-challenge/blob/master/zero-to-nine.lisp
#toyprogrammingchallenge
Follow
@billstclair thanks!
#toyprogrammingchallenge
And here is my solution in python
https://git.qoto.org/Absinthe/onetonine/tree/master
