dbfe3 No.287
I've been diving deep into some coding challenges lately, and I stumbled upon something pretty neat - Leetcode 808: Soup Serving! So here's the deal. We got two soups, A and B, each starting with n mL. Each turn, our program takes a lucky dip from four possible serving operations (each with a 25% chance): 1. Pour 100mL from A, nothing from B 2. Pour 75mL from A, 25mL from B 3. Pour 50mL from A, 50mL from B 4. Pour 25mL from A, 75mL from B The game ends when one of the soups runs dry! But what if it asks to serve more than what's left… that'd be awkward, right? I found this problem really fun and thought you guys might enjoy solving it too. Let me know how you tackle it! Happy coding, [Your Name