63207
It's not tha thard ShilaSiku, basically all that occurs is this
We have five numbers (each digit in our number), I called them q1, q2, q3, q4, q5
So the number 63200 has q1 = 6, q2 = 3, q3 = 2, q4 = 0 and q5 = 0
We then have three operators, these can be either +, -, *, / or ^, we will call these operators c1, c2 and c3
We have to find three operators such that
q1 c1 q2 c2 q3 c3 q4 = q5
In this case it'd be
6 c1 3 c2 2 c3 0 = 0
So what the program does is check EVERY possible combination of each c, so for example it checks
6 + 3 + 2 + 0 and checks whether that's equal to 0, if not then it checks
6 + 3 + 2 - 0 and it cycles through each operator, going through every single possible combination until it runs out of combinations or finds the a combination that equals 0
There's also a paranthesis argument, basically you can do each calculation between two numbers in any order you want. I found 5 different orders, these are
((6 + 3) + 2) + 0
(6 + (3 + 2)) + 0
6 + ((3 + 2) + 0)
6 + (3 + (2 + 0)
(6 + 3) + (2 + 0)
There are more variations, but all other variations can be reduced to these five. So not only does it go through every operator, it goes through every order or operations, until it reaches it's goal
Basically, it brute forces it, so it's not so difficult.
