In Random Nim question we can remove any number of stones >=1 from exactly one pile it is not necessary that every turn any player will remove only 1 stone .
@priyanshusingh3208 yes exactly.... I was thinking maybe a player can remove an entire pile ....... But after the video explanation it only makes sense that the last stone matters
Suppose, X=10 And you have this values (b[i]-a[i]+1) 10 3 7 If you sort it then 3 7 10 And the count of votes would have been previous + 2 ( 3+7=X) And if don't sort it 10 3 7 Then only first value would have been considered which is not optimal for the answer
Bhaiya samjhane ka man na raha kare to mat samjhaya karo ,random nim wale question ko aap samjha nahi rahe the aap sirf jo likh rahe the usi ko repeat kare de rahe the , bhaiyaa acche se samjha doge to kya chala jayega koi kaam kar rahe ho to acche se kardo😢😢😢😢😢😢
Sorry, at first I wasn't sure ki logo ko samajh aya hoga ya nhi, so I repeated and tried to approach the problem as how a low rated coder should've approached.
Please fill the Feedback form for PCD: forms.gle/49DgBUSHtkfCsP1e7
Where is 158
the approach to calc largest divisors really helped me. i was getting tle due to this.
In Random Nim question we can remove any number of stones >=1 from exactly one pile it is not necessary that every turn any player will remove only 1 stone .
Problem stated "exactly one stone" in the problem statement
@@itzzRaghav atleast one
@@itzzRaghav it's exactly one pile
@priyanshusingh3208 yes exactly.... I was thinking maybe a player can remove an entire pile ....... But after the video explanation it only makes sense that the last stone matters
Probability of removing last pile and last stone remains same...
You should have explained the crafting coloring(Hard Version).Really wanted t o know the complete approach
My approach was complicated and would've been quite difficult to explain and PCD had already gone too long, so I recommended the text editorial
please suggest some resources for maths required in cp
Utkarsh Gupta has created a video on UA-cam for this
i didn't get that how we got 3 for 18, as 18->2->1, since the largest divisor of 18 is 9. HElp me
sorry a dumb comment, i get it know
what if I not use Sort in Election question?
Suppose,
X=10
And you have this values (b[i]-a[i]+1)
10 3 7
If you sort it then
3 7 10
And the count of votes would have been previous + 2 ( 3+7=X)
And if don't sort it
10 3 7
Then only first value would have been considered which is not optimal for the answer
super Hero code is not provided
Div 4 ?
Bhaiya samjhane ka man na raha kare to mat samjhaya karo ,random nim wale question ko aap samjha nahi rahe the aap sirf jo likh rahe the usi ko repeat kare de rahe the , bhaiyaa acche se samjha doge to kya chala jayega koi kaam kar rahe ho to acche se kardo😢😢😢😢😢😢
Sorry, at first I wasn't sure ki logo ko samajh aya hoga ya nhi, so I repeated and tried to approach the problem as how a low rated coder should've approached.