Skip to content

Commit 773769c

Browse files
Update jazzy and cricket balls.md
1 parent 2a4de1d commit 773769c

File tree

1 file changed

+4
-3
lines changed

1 file changed

+4
-3
lines changed

Techgig Code Gladiators 2021/semifinals/jazzy and cricket balls.md

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,8 @@ Jazzy is good with bowling but is not good with studies. His mom wants him to fo
44

55
She will give the balls to Jazzy only if he can tell the maximum number of moves required in which he can get to play with all the balls. There are few conditions though:
66

7-
* In one move, Jazzy can divide the number of balls in the packet into an equal number of groups only.
7+
8+
* In one move, Jazzy can divide the number of balls in the packet into an equal number of groups only.
89

910
Example : Suppose there are 6 balls in the packet.
1011

@@ -16,11 +17,11 @@ She will give the balls to Jazzy only if he can tell the maximum number of moves
1617

1718
Note: Dividing a single group into multiple groups of equal number is considered one move only.
1819

19-
* Jazzy can get to play with the balls when they are present as a single unit only and not in any group of size greater than 1. Also, getting to play with a ball is considered a move.
20+
* Jazzy can get to play with the balls when they are present as a single unit only and not in any group of size greater than 1. Also, getting to play with a ball is considered a move.
2021

2122
Example: In a group there are 2 balls, then Jazzy cannot play with them until he further divides them into single-single units.
2223

23-
* The length of all the packets/groups should always be an integer.
24+
* The length of all the packets/groups should always be an integer.
2425

2526
Example: Number of Packets, N = 1
2627
Number of balls in packet = 6

0 commit comments

Comments
 (0)