Skip to content

Latest commit

 

History

History

candies

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
README.md
README.md
 
 
candies.js
candies.js
 
 

README.md

Check Out My YouTube Channel

Algorithm Challenge Available At CodeFights

n children have got m pieces of candy. They want to eat as much candy as they can, but each child must eat exactly the same amount of candy as any other child. Determine how many pieces of candy will be eaten by all the children together. Individual pieces of candy cannot be split.

Example

  • For n = 3 and m = 10, the output should be candies(n, m) = 9.

    Each child will eat 3 pieces. So the answer is 9.

Hints

  • Math.floor()

Input/Output

  • [execution time limit] 4 seconds (js)

  • [input] integer n

    The number of children. Guaranteed constraints: 1 ≤ n ≤ 10.

  • [input] integer m The number of pieces of candy. Guaranteed constraints: 2 ≤ m ≤ 100.

  • [output] integer The total number of pieces of candy the children will eat provided they eat as much as they can and all children eat the same amount.