bsc

Comprehensive codebase and cou...
Log | Files | Refs | README | LICENSE

commit cfccdaf1eaae4e85d23662ea8ebe66be47023e2a
parent 443aad14879eaf01a445d94234671cff742bb609
Author: Amit Dutta <amitdutta4255@gmail.com>
Date:   Wed,  8 Oct 2025 11:37:57 +0530

changing my plan

Diffstat:
Mletusc/luc030.c | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/letusc/luc030.c b/letusc/luc030.c @@ -9,7 +9,7 @@ always wins. Rules for the game are as follows : /* Author - Amit Dutta, Date - 8th OCT, 2025 */ /* Let Us C, Chap- 5, Page - 87, Qn No.: B(c) */ -/* Strategy: The total number of matchsticks is 21. To guarantee a win, +/* My Plan: The total number of matchsticks is 21. To guarantee a win, the computer ensures that after its turn, the number of remaining matchsticks is always a multiple of 5 plus 1 (i.e., 16, 11, 6, 1). This is achieved by making the sum of the player's pick and the
© notamitgamer • Site Built: 2026-07-21 13:58:23 UTC • git-mirror commit: 1037f62 [view raw info]
Originally created with stagit • modified by notamitgamer
Forked from github.com/notamitgamer/git-mirror