Internet Service Providers
来源:互联网 发布:网上宿迁网络问政 编辑:程序博客网 时间:2024/04/29 17:25
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
题意:求获得一元二次方程的最大值的跟,
思路:当x=-b/(2*a)时,值最大,但不要忘记,这个数最大值的解可能为小数,但是用除法求的是整数,答案也是求的整数,所以在求一个x+1的值与其进行比较,取最大;
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define size 1000000using namespace std;int main(){int n,c,l=1,t;scanf("%d",&t);while(t--){ long long ans=0,k,h; scanf("%d%d",&n,&c);printf("Case %d: ",l++);if(n==0){printf("0\n");continue;}k=c/(2*n);h=k+1;ans=k*(c-k*n)>=h*(c-h*n)?k:h;printf("%lld\n",ans);}return 0;}
- E - Internet Service Providers
- Internet Service Providers
- WOJ1406-Internet Service Providers
- POJ 3911:Internet Service Providers
- LightOJ 1275 - Internet Service Providers
- LIGHTOJ-1275 - Internet Service Providers
- LightOJ 1275 Internet Service Providers
- LightOJ 1275 - Internet Service Providers
- 【Light】[1275]Internet Service Providers
- LightOJ 1275:Internet Service Providers
- lightoj 1275 - Internet Service Providers 【求导】
- LightOJ 1275 - Internet Service Providers (简单数学)
- poj 3911--Internet Service Providers【求导】
- Light OJ: 1275 - Internet Service Providers【数学】
- lightoj 1275 - Internet Service Providers 一元二次方程
- 数学 poj 3911(Internet Service Providers)
- POJ 3911 Internet Service Providers 可能会
- poj 3911 Internet Service Providers 解一元二次方程
- SDUT OJ 2123 查找练习 hash——出现过的数字
- 数据结构实验之排序七:选课名单
- 机器学习实战笔记——微软小冰的读心术与决策树
- 程序包org.apache.http不存在的解决方法
- 在python中直接调用androguard
- Internet Service Providers
- Android .9图的问题
- CF660A -- Co-prime Array
- jsp post和get区别
- 一些例题的技巧
- LeetCode #132: Palindrome Partitioning II
- Joint Cascade Detection and Alignment & Local Binary Features 阅读笔记
- JavaScript 学习笔记---------(二)
- List集合中的对象根据属性排序