1001 Can you solve this equation?
2016-04-20 20:49
387 查看
[align=left]Problem Description[/align]
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;<br>Now please try your lucky.
[align=left]Input[/align]
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);
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2<br>100<br>-4<br>
[align=left]Sample Output[/align]
1.6152<br>No solution!<br>
#include
#include
#include
using namespacestd;
double v(doublex)
{
return (8*pow(x,4) 7*pow(x,3) 2*pow(x,2) 3*x6);
}
double f(doublex,double z, double y)
{
doublemid;
while((y-z)>1e-10)
{
mid=(zy)/2;
if(v(mid)
z=mid 1e-10;
else
y=mid-1e-10;
}
return mid;
}
intmain()
{
int n;
double a;
cin>>n;
while(n--)
{
cin>>a;
if(a<6||a>807020306||fabs(f(a,0,100))<1e-4)
cout<<"Nosolution!"<<endl;
else
cout<<fixed<<setprecision(4)<<f(a,0,100)<<endl;
}
return0;
}
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;<br>Now please try your lucky.
[align=left]Input[/align]
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);
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2<br>100<br>-4<br>
[align=left]Sample Output[/align]
1.6152<br>No solution!<br>
#include
#include
#include
using namespacestd;
double v(doublex)
{
return (8*pow(x,4) 7*pow(x,3) 2*pow(x,2) 3*x6);
}
double f(doublex,double z, double y)
{
doublemid;
while((y-z)>1e-10)
{
mid=(zy)/2;
if(v(mid)
z=mid 1e-10;
else
y=mid-1e-10;
}
return mid;
}
intmain()
{
int n;
double a;
cin>>n;
while(n--)
{
cin>>a;
if(a<6||a>807020306||fabs(f(a,0,100))<1e-4)
cout<<"Nosolution!"<<endl;
else
cout<<fixed<<setprecision(4)<<f(a,0,100)<<endl;
}
return0;
}
相关文章推荐
- PopupWindow,不消失
- splay旋转模板
- java中的事件监听是怎样实现随时监听的
- IMCP包如何区分
- java毕向东听课笔记20(基本数据类型包装类)
- uva 11572 unique snowflakes——yhx
- Codeforces Beta Round #9 (Div. 2 Only) D. How many trees? dp
- [转]Acrylic DNS Proxy 使用方法
- 正则表达式-概要
- Android中AIDL的使用
- 博弈论问题
- org.dbunit.dataset.NoSuchColumnException: t_role.ROLE_TYPE - (Non-uppercase input column: role_type
- C3P0连接超时分析
- 三和韓長庚 著 易學原理總論 對讀 81_100
- 链队
- malloc/free的用法详解
- mac iterm2有什么酷功能?
- 好文章集合
- 1017 非常可乐
- eclipse里面对比两个java文件