LightOJ 1275:Internet Service Providers
来源:互联网 发布:马穆鲁克 知乎 编辑:程序博客网 时间:2024/04/29 14:30
Description
A group of N Internet Service Provider companies (ISPs) use a private communication channel that has a maximum capacity of C traffic units per second. Each company transfers T traffic units per second through the channel and gets a profit that is directly proportional to the factor T(C - T*N). The problem is to compute the smallest value of T that maximizes the total profit the N ISPs can get from using the channel. Notice that N, C, T, and the optimal T are integer numbers.
Input
Input starts with an integer T (≤ 20), denoting the number of test cases.
Each case starts with a line containing two integers N and C (0 ≤ N, C ≤ 109).
Output
For each case, print the case number and the minimum possible value of T that maximizes the total profit. The result should be an integer.
Sample Input
6
1 0
0 1
4 3
2 8
3 27
25 1000000000
Sample Output
Case 1: 0
Case 2: 0
Case 3: 0
Case 4: 2
Case 5: 4
Case 6: 20000000
求解一元二次方程 我们知道 -ax^2+bx+c 最大值是在x= -b/(2a)处取得
<pre name="code" class="cpp">#include<cstdio>int main(){long long t,cut=0;scanf("%lld",&t);while(t--){cut++;long long n,c;scanf("%lld%lld",&n,&c);printf("Case %lld: ",cut);if(n==0){printf("0\n");continue;} long long a=(c/n)/2;//这里结果可能为小数 因为定义为int型结果就只取整数部分 那么结果就不一定是最大了 需要将x向左或右移一位 long long b=a+1; printf("%lld\n",a*(c-a*n)>=b*(c-b*n)?a:b);}return 0; }
- LightOJ 1275 - Internet Service Providers
- LIGHTOJ-1275 - Internet Service Providers
- LightOJ 1275 Internet Service Providers
- LightOJ 1275 - Internet Service Providers
- LightOJ 1275:Internet Service Providers
- lightoj 1275 - Internet Service Providers 【求导】
- LightOJ 1275 - Internet Service Providers (简单数学)
- lightoj 1275 - Internet Service Providers 一元二次方程
- 【数学-二元一次方程求最值】LightOJ Internet Service Providers 1275
- LightOJ 1275 Internet Service Providers(数学求解)
- lightoj 1275 - Internet Service Providers (基本数学-二元一次方程)
- 【Light】[1275]Internet Service Providers
- LightOJ 1275 Internet Service Providers <一元二次函数的最值>
- Light OJ: 1275 - Internet Service Providers【数学】
- E - Internet Service Providers
- Internet Service Providers
- WOJ1406-Internet Service Providers
- POJ 3911:Internet Service Providers
- Password【NOIP2016提高A组模拟8.15】
- 莫队算法一(小z的袜子)
- 逆波兰表示法(Reverse Polish Notation)
- iOS之UI高级---CoreAnimation框架
- Hdu-5834 Magic boy Bi Luo with his excited tree(树形DP)
- LightOJ 1275:Internet Service Providers
- 设计模式GOF23——备忘录模式
- c#的第18节课
- 算法-最长递增子序列
- HDU1561 树形dp,泛化背包
- OSX小功能
- bzoj 2436: [Noi2011]Noi嘉年华 (dp)
- Android ToolBar 用法总结
- Sunday算法详解