Out of all "possible" final scores (0<R<3*n) for a team, participating in N games, how many final results cannot be achieved?
|See The Solution||Submitted by Ady TZIDON|
|Rating: 4.0000 (1 votes)|
Jer is right.
The answer is 1.
For N games the only unachievable score is 3N-1.
I have somehow misread Jer's answer.
If one gets in each of his meetings with Grandma
either 1,3 or none candies , there is no way to end up with
3*n-1 candies after the n-th meeting.
Edited on April 4, 2013, 12:03 am
|Posted by Ady TZIDON on 2013-04-03 23:40:50|