A. Berland Poker & 1000 [simple mathematical thinking]

Title Description ：

n There is m A king , altogether k Play cards alone . Everyone takes it n/k card （ Guaranteed Division ）, Maximize the difference between the largest and the second largest （ Refined ）

Wrong thinking ：

Put an end to it ：if.... Output an answer ;if...... Output the answer

Positive solution ：

Solve it like a math problem , If you want to get the answer , What elements do I need ？ For these elements, break them one by one .

Actually Maximize the difference between the largest and the second largest Such refinement can already help me solve problems .

The maximum value can be set directly , Or m, Or n / k. The maximum value is less than or equal to both , So take min.

When the maximum value is determined , Second largest value isomorphism , There is one Round up The operation of .

        int theirs = (m - our + k - 2) / (k - 1);// On whom to round , Add denominator -1

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
 
int main(){
	std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
 	int t;
 	cin >> t;
 	while(t -- ){
 		int n, m, k;
 		cin >> n >> m >> k;
 		int our = min(n / k, m);
 		int thiers = (m - our) / (k - 1);
        // Rounding up manually 
 		if((m - our) % (k - 1) != 0) {
 			thiers ++;
 		}
 		cout << our - thiers << '\n';
 	}   
	return 0;
}