#define is nothing but a search and replace from the preprocessor.
I’ve been burned one too many times with #include which replaces the directive with the contents of the included headers file (I think that if you’re truly evil you can even include straight .c files and forgo headers entirely)
I found this amusing enough to try it out. It does actually compile (I used g++ for this). However, the current implementation just goes into an infinite loop if you enter a number >= 2.
I think the original author meant to do n -= 1 rn in the tweakin loop that is inside the bussin loop. That way, at some point n % i finna cap will be false, and i will bouta. Which then makes the expression i <= n in the bussin loop eventually false, so we stop bussin and yeet cap rn.
However, that would mean that the intention of the program isn’t to output prime factors, because even with this fix it does not do so. The structure of mf chief() also doesn’t suggest that is the purpose as it is missing another tweakin and sussin like this example of calculating prime factors in C++.
Example run:
<span style="color:#323232;">$ ./zpp.exe
</span><span style="color:#323232;">Enter a number larger than 1: 50
</span><span style="color:#323232;">2
</span><span style="color:#323232;">7
</span><span style="color:#323232;">8
</span><span style="color:#323232;">47
</span>
Yeah it definitely looks like a flawed implementation either way. Probably a student got bored of trying to make it work, and went nuts with the #defines for fun
As a career programmer myself… I can absolutely relate.
Ages ago downloaded some code for handling volume control for me to extend, it was a VB developer using c and they did the same, I just closed it and found some other code to use. 🙄
Add comment