Help with divide.

[martin369]

Hi i am stuck on divide. I came up witch substract divisor from devident(you know what i mean :D), but i do not know how to check if output is lower than zero. I tried make something like absolut value from output and add it to original value and if equal zero. But i do not know how to make abs value from modules in this level. Can you give some advice.

[ShivaFang]

As I recall I used an input selector or output selector. All the divisors are less than 9. Let me check...

... that would have been much more efficient than what I did do. Apparentloy I used an equals to check if it equals 1,2,3,4,5,6,7 or 8, and if it did then that was my remainder (with a separate check for 0)

Oh I also did it the other way around. I added from 0 until I got above the number to stop. I think then I subtracte where I was from the total and if it was 1-8 then we had the answer.

My answer does not meet the 'minimum nodes' criteria so I'll have to optimize that. Currently working on optimizing Greater.



Anyway to reprhase: If you subtract a negative number you get a positive and then input select will work on it. If you put a negative number into an input select (or a number greater than the available selections) you get '-'. Also having equals 1/2/3/4/5/6/7/8 works as well (which is why I needed that even though it bloated my node count)