RGPC '18 P1 - Giant Cookie

View as PDF
Submit solution
Points: 3
Time limit: 2.0s
Memory limit: 64M
Author:
tiffie44
Problem type

Elton has a giant cookie that he'd like to share with the rest of the CS club. The cookie is preemptively broken up into N equal pieces, but he soon realizes that N people might not be present at the club's next meeting! He will only share his cookie if he is sure that there will be no pieces remaining after it is equally divided amongst the club members.

Given the number of pieces there are, as well as the number of people that will be present at the club's next meeting, determine if Elton will share his cookie, and if so, how many pieces each person will get. Otherwise, determine how many additional people would need to be present in order for him to share it.

Input Specification

The first and only line of input will contain two space-separated integers N and M (1 \le M \le N \le 5\,000), representing the number of pieces the cookie has already been broken up into, as well as the number of people that will be present at the next club meeting, respectively.

Output Specification

If Elton will share his cookie, output yes X, where X is the number of pieces that each person will get. Otherwise, output no Y, where Y is the smallest number of additional people needed to attend the meeting in order for the cookie to be shared.

Sample Input 1

8 4

Sample Output 1

yes 2

Sample Input 2

13 7

Sample Output 2

no 6

Comments


  • 0
    SuperCyther  commented on Feb. 26, 2018, 2:48 a.m.

    What is wrong with my code?


    • 3
      aeternalis1  commented on Feb. 26, 2018, 3:10 a.m. ← edited

      Note that the question asks for the minimum number of extra people so that the cookie pieces can be split evenly, not the number of leftover pieces. For example, the test case 21 4 should output 3, rather than 1.


      • 0
        SuperCyther  commented on Feb. 27, 2018, 12:43 a.m.

        oh ok thanks!