KUSAC - Kusac
Mirko has given up on the difficult coach job and switched to food tasting instead. Having skipped
breakfast like a professional connoisseur, he is visiting a Croatian cured meat festival. The most
renowned cook at the festival, Marijan Bajs, has prepared N equal sausages which need to be
distributed to M tasters such that each taster gets a precisely equal amount. He will use his trusted knife
to cut them into pieces.
In order to elegantly divide the sausages, the number of cuts splitting individual sausages must be as
small as possible. For instance, if there are two sausages and six tasters (the first test case below), it is
sufficient to split each sausage into three equal parts, making a total of four cuts. On the other hand, if
there are three sausages and four tasters (the second test case below), one possibility is cutting off three
quarters of each sausage. Those larger parts will each go to one of the tasrers, while the fourth taster
will get the three smaller pieces (quarters) left over.
Mirko wants to try the famous sausages, so he volunteered to help Bajs. Help them calculate the
minimum total number of cuts needed to carry out the desired division.
The first and only line of input contains two positive integers, N and M (1 ≤ N, M ≤ 100), the number
of sausages and tasters, respectively.
The first and only line of output must contain the required minimum number of cuts.
Input: 2 6 Output: 4
Input: 3 4 Output: 3
Input: 6 2 Output: 0
play with some test cases and use a recursive function
there is a very simple closed formula :) Input Constraints are waaay too low
can anyone provide some tricky test cases (n and m >50)
Can anybody provide the ans for test case n=55&m=79.
This problem is ok now , everyone who got WA or TLE can send their solutions again
It seems rejudged had been cancelled. Can you explain what happened ?
Test cases problem solved! All solution are rejudged.