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.
Input
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.
Output
The first and only line of output must contain the required minimum number of cuts.
Example
Input: 2 6 Output: 4
Input: 3 4 Output: 3
Input: 6 2 Output: 0
hide comments
kaleoum:
20200129 09:53:05
e n=55&m=79


smso:
20190407 06:53:31
play with some test cases and use a recursive function 

Wumbolo:
20160708 06:31:31
there is a very simple closed formula :) Input Constraints are waaay too low 

chhavipatel:
20160125 21:15:45
can anyone provide some tricky test cases (n and m >50)


cute_girl_1:
20160112 16:51:18


Anuj Agrawal:
20150514 19:47:06
Can anybody provide the ans for test case n=55&m=79.


Petar Bosnjak:
20140626 14:07:55
This problem is ok now , everyone who got WA or TLE can send their solutions again


Francky:
20140618 08:28:47
It seems rejudged had been cancelled. Can you explain what happened ? 

Tomislav Babic:
20140617 13:17:04
@Francky


Tomislav Babic:
20140617 13:13:59
Test cases problem solved! All solution are rejudged. 
Added by:  Tomislav Babic 
Date:  20131005 
Time limit:  0.109s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  COCI 2013 1. round 