Description: John and Brus are bored. They have n+m common friends. The first n of them are bored and other m are not. John chooses the j-th (1-based) friend for a talk. If the friend is not bored, he becomes bored after the talk. Brus does the same with the b-th (1-based) friend. Note that John and Brus can t choose the same friend.
You have to find the number of bored friends after the talks.
To Search:
File list (Check if you may need any files):
TheBoredomDivTwo.cpp
Download