c-二分

C - 二分
Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Description

Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100; 
Now please try your lucky.
 

Input

The first line of the input contains an integer T(1<=T<=100) which means the number of test cases. Then T lines follow, each line has a real number Y (fabs(Y) <= 1e10);
 

Output

For each test case, you should just output one real number(accurate up to 4 decimal places),which is the solution of the equation,or “No solution!”,if there is no solution for the equation between 0 and 100.
 

Sample Input

       
       
2 100 -4
 

Sample Output

       
       
1.6152 No solution!
 

二分法

代码:

#include<stdio.h>

double sz(double n)
{
	return 8 * n * n * n * n + 2 * n * n + 7 * n * n * n + 3 * n + 6;
}

int main()
{
	int t;
	scanf_s("%d", &t);
	while (t--)
	{
		double y;
		scanf_s("%lf", &y);
		if (sz(0) > y || sz(100) < y)
		{
			printf("No solution!\n");
			continue;
		}
		double l = 0, r = 100, mid;
		while (r - l>1e-10)
		{
			mid = (r + l) / 2;
			if (sz(mid) > y)
			{
				r = mid;
			}
			else
			{
				l = mid;
			}
		}
		printf("%.4lf\n", mid);
	}

	return 0;
}





评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值