Well, half of all problems are deciphering what the author wants you to do, don't feel bad :P
Basically the question boils down to: How many chunks of 5 can you get out of n. Each full chunk is represented by 'e <br>' in the solution. The remainder is thus represented as a, b, c, d depending on what it is.
LOL to those who voted 'Best Practices'. This is NOT a best practice. I used it because I didn't think about the safer
fetchwhich is superior.Convoluted, but I like it :)
Actually this approach is a huge loser in benchmark tests.
I can't argue with that, that's right :)
Thanks for the explaination, it makes sense now :)
Well, half of all problems are deciphering what the author wants you to do, don't feel bad :P
Basically the question boils down to: How many chunks of 5 can you get out of
n. Each full chunk is represented by'e <br>'in the solution. The remainder is thus represented asa, b, c, ddepending on what it is.I read the details a few times, and I'm still there reading it thinking I must be dumb... I really don't get it.