[1651]Redpacket时间限制:1000ms内存限制:65535K问题描述NewYeariscoming!OurbigbossWine93willdistrib [1651] Red packet 时间限制: 1000 ms 内存限制: 65535 K 问题描述 New Year is coming! Our big boss Wine93 will distribute s
[1651] Red packet
- 时间限制: 1000 ms 内存限制: 65535 K
- 问题描述
New Year is coming! Our big boss Wine93 will distribute some “Red Package”, just like Alipay and Wechat.
Wine93 has m yuan, he decides to distribute them to n people and everyone can get some money(0 yuan is not allowed and everyone’s money is an integer), Now k people has gotten money, it’s your turn to get “Red Package”, you want to know, at least how much money to give you, then you can must become the “lucky man”. and the m yuan must be used out.
Noting that if someone’s money is strictly much than others’, than he is “lucky man”.
- 输入
- Input starts with an integer T (T <= 50) denoting the number of test case.For each test case, three integers n, m, k (1 <= k
- 输出
- Ouput the least money that you need to become the “lucky man”, if it is impossible, output “Impossible” (no quote).
- 样例输入
- 33 5 22 14 10 22 34 15 23 5
- 样例输出
- Impossible46
思路：
发红包有成为幸运儿的说法即你要比每个人得到的红包都要多，你就是幸运儿。
输入数据：
测试数据个数
人数，红包总额，已经分发的人数
已经分发的人数的红包
思路：
代码注释部分。
如果描述不清晰：
博主参考自：Classmata_Wang Yinggang
代码：
#include#include#define MYDD 1103int MAX(int x,int y) {return x>y? x:y;}int main() {int t;scanf("%d",while(t--) {int n,m,k;//人数，红包总额，已经分发的人数int max_get,distri_money,money;scanf("%d%d%d",max_get=0;//当前已分发红包的最高金额distri_mOney=0;//已经分发红包的总额for(int j=0; j