Solve It UVA
来源:互联网 发布:最近很火的网络歌曲女 编辑:程序博客网 时间:2024/06/04 18:40
Solve the equation:
p ∗ e
−x + q ∗ sin(x) + r ∗ cos(x) + s ∗ tan(x) + t ∗ x
2 + u = 0
where 0 ≤ x ≤ 1.
Input
Input consists of multiple test cases and terminated by an EOF. Each test case consists of 6 integers in
a single line: p, q, r, s, t and u (where 0 ≤ p, r ≤ 20 and −20 ≤ q, s, t ≤ 0). There will be maximum
2100 lines in the input file.
Output
For each set of input, there should be a line containing the value of x, correct up to 4 decimal places,
or the string ‘No solution’, whichever is applicable.
Sample Input
0 0 0 0 -2 1
1 0 0 0 -1 2
1 -1 1 -1 -1 1
Sample Output
0.7071
No solution
p ∗ e
−x + q ∗ sin(x) + r ∗ cos(x) + s ∗ tan(x) + t ∗ x
2 + u = 0
where 0 ≤ x ≤ 1.
Input
Input consists of multiple test cases and terminated by an EOF. Each test case consists of 6 integers in
a single line: p, q, r, s, t and u (where 0 ≤ p, r ≤ 20 and −20 ≤ q, s, t ≤ 0). There will be maximum
2100 lines in the input file.
Output
For each set of input, there should be a line containing the value of x, correct up to 4 decimal places,
or the string ‘No solution’, whichever is applicable.
Sample Input
0 0 0 0 -2 1
1 0 0 0 -1 2
1 -1 1 -1 -1 1
Sample Output
0.7071
No solution
0.7554
二分枚举x
#include<stdio.h>#include<math.h>int p,q,r,s,t,u;double check(double x){ return p*exp(-x)+q*sin(x)+r*cos(x)+s*tan(x)+t*x*x+u;}int main(){ while(~scanf("%d%d%d%d%d%d",&p,&q,&r,&s,&t,&u)) { double high=1,low=0,mid; while(high-low>1e-8) { mid=(high+low)/2; if(check(mid) > 0) low=mid; else high=mid; } if(fabs(check(mid)-0.0)<1e-6) printf("%.4f\n",mid); else printf("No solution\n"); } return 0;}
阅读全文
0 0
- UVa 10341-Solve It
- UVa 10341 - Solve It
- uva 10341 - Solve It
- uva 10341 - Solve It
- UVA - 10341 Solve It
- UVa 10341 - Solve It
- UVA 10341 - Solve It
- Uva 10341 Solve It
- UVa:10341 Solve It
- UVA 10341 Solve It
- UVa 10341 Solve It
- uva 10341 Solve It
- uva 10341 Solve It
- UVa 10341 - Solve It
- UVa 10341 - Solve It
- UVa 10341 - Solve It
- UVA 10341 Solve It
- UVa-10341-Solve It
- 数据结构实验之查找六:顺序查找
- POJ 2251 Dungeon Master
- 使用Hexo+github搭建个人博客
- Cormen — The Best Friend Of a Man (贪心)
- Java, JDBC and MySQL类型对应关系
- Solve It UVA
- R语言核密度估计(转)
- Python3 列表自定义排序
- 欢迎使用CSDN-markdown编辑器
- Asp.Net Core轻松入门之WebHost的配置
- mysql
- Java代码块
- 手把手教学java微信公众号模版消息开发
- Deep哈希算法介绍