Light OJ 1275 Internet Service Providers （数学）

B - Internet Service Providers

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit  Status  Practice  LightOJ 1275  uDebug

Appoint description:  System Crawler  (Jul 23, 2016 12:16:30 PM)

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 ≤ 10⁹).

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

题意：给出C N，求最小的T使 T*（C-T* N）最大。

思路：一元二次方程求最大值

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int t;
	long long c,n,m,b,num1,num2;
	scanf("%d",&t);
	int k=1;
	while(t--)
	{
		scanf("%lld%lld",&n,&c);
		if(n==0||c==0)
		{
			printf("Case %d: 0\n",k++);
			continue;
		}
		m=c/(n*2);
		num1=m*(c-n*m);
		if(c%(n*2)!=0)
		{
			b=m+1;
			num2=b*(c-n*b);
		}
		if(num1>=num2)
		printf("Case %d: %lld\n",k++,m);
		else
		printf("Case %d: %lld\n",k++,b);
	}
	return 0;
 }