Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEAThank you for posting this challenge, it is really interesting.
The most challenging aspect for me, personally, is how to make the solutions as generalised as possible, such as being able to take in unlimited number of digits and design the logic flow so that it can handle generalised the problem of adding numbers of different numbers of order of magnitudes (e.g. how to handle if the remainders when added together exceed the divisor).
I solved it using 3 iterative macros and this seems to work when tested with extra long numbers.
Learned from solution.
I like this challenge. How long is the workflow suppose to run? Tried the solution via generate rows and it has been running for the past 20 minutes.
Ok, kind of proud of this, took a little thought but love the result.
4 tools 0.4 seconds, no macro needed.
Flexible and should work for any number to 30 digits. 'If' it doesn't it would be the tiniest of tweaks, the concept certainly does with almost zero hard code.
@patrick_digan since this challenge is your baby, and I tend to like a lot of your approaches, I'd be interested in your take.
Thank you @patrick_digan for the challenge, that was brutal! Found this post really helpful to solve this challenge
https://www.geeksforgeeks.org/program-quotient-remainder-big-number/
Workflow:
Macro :
Back after a short hiatus! I want that #300 Badge 😀
Really proud of this solution that simulates long division!
Quite interesting problem to have, I went for the long division route, so the macro should work for any length (Divisor is set Int16 currently). Though still need to improve the macro to set a stop condition.