lightoj1137 - Expanding Rods

  
  

   
   1137 - Expanding Rods
  
  
  
  

   
   
   
PDF (English)
Statistics
Forum
  
  
  
  

   
   
Time Limit: 0.5 second(s)
Memory Limit: 32 MB
  
  
  
  

   
   
When a thin rod of length L is heated n degrees, it expands to a new length L' = (1+n*C)*L, where C is the coefficient of heat expansion.
   
   

   
   
When a thin rod is mounted on two solid walls and then heated, it expands and takes the shape of a circular segment, the original rod being the chord of the segment.
   
   
Your task is to compute the distance by which the center of the rod is displaced. That means you have to calculate h as in the picture.
   
   
Input
   
   
Input starts with an integer T (≤ 20), denoting the number of test cases.
   
   
Each case contains three non-negative real numbers: the initial length of the rod in millimeters L, the temperature change in degrees n and the coefficient of heat expansion of the material C. Input data guarantee that no rod expands by more than one half of its original length. All the numbers will be between 0 and 1000 and there can be at most 5 digits after the decimal point.
   
   
Output
   
   
For each case, print the case number and the displacement of the center of the rod in single line. Errors less than 10-6 will be ignored.
   
   
Sample Input
Output for Sample Input
3
1000 100 0.0001
150 10 0.00006
10 0 0.001
Case 1: 61.3289915
Case 2: 2.2502024857
Case 3: 0
   
   
 
  
  
  
  

  
  

   
   SPECIAL THANKS: JANE ALAM JAN (DESCRIPTION, SOLUTION, DATASET, PICTURES)
  
  

#include<stdio.h>
#include<math.h>
double l,n,c,l1;
double work(double mid)
{
	double r=(l*l)/(8*mid)+mid/2.0;
	double ll=asin(l/(2*r))*r*2;
	return ll;
}
int main()
{
	int t;

	scanf("%d",&t);
	int l2=1;
	while(t--)
	{
		scanf("%lf%lf%lf",&l,&n,&c);
		printf("Case %d: ",l2++);
		l1=(1+n*c)*l;
		if(l1==l)
		printf("0\n");
		else
		{
			double left=0.0;
			double right=l/2.0;
			double mid,ans;
			while((right-left)>1e-12)
			{
				mid=(left+right)/2.0;
				if(l1-work(mid)>=0)
				{
					ans=mid;
					left=mid;
				}
				
				else
				right=mid;
			}
			printf("%.10lf\n",ans);
		}
	}
	return 0;
}