题目链接:http://codeforces.com/problemset/problem/215/B

Description

The World Programming Olympics Medal is a metal disk, consisting of two parts: the first part is a ring with outer radius of r1 cm, inner radius of r2 cm, (0 < r2 < r1) made
of metal with density p1 g/cm3. The second part is an inner disk with radius r2 cm,
it is made of metal with density p2 g/cm3. The disk is nested inside the
ring.

The Olympic jury decided that r1 will take one of possible values of x1, x2, ..., xn.
It is up to jury to decide which particular value r1 will take. Similarly, the Olympic jury decided that p1 will
take one of possible value of y1, y2, ..., ym, and p2 will
take a value from listz1, z2, ..., zk.

According to most ancient traditions the ratio between the outer ring mass mout and the inner disk mass min must
equal , where A, B are constants taken from ancient books.
Now, to start making medals, the jury needs to take values for r1p1p2 and
calculate the suitable value of r2.

The jury wants to choose the value that would maximize radius r2. Help the jury find the sought value of r2.
Value r2 doesn't have to be an integer.

Medal has a uniform thickness throughout the area, the thickness of the inner disk is the same as the thickness of the outer ring.

Input

The first input line contains an integer n and a sequence of integers x1, x2, ..., xn.
The second input line contains an integer m and a sequence of integers y1, y2, ..., ym.
The third input line contains an integer k and a sequence of integers z1, z2, ..., zk.
The last line contains two integers A and B.

All numbers given in the input are positive and do not exceed 5000. Each of the three sequences contains distinct numbers. The numbers in the lines are separated by spaces.

Output

Print a single real number — the sought value r2 with absolute or relative error of at most 10 - 6.
It is guaranteed that the solution that meets the problem requirements exists.

Sample Input

Input
3 1 2 3
1 2
3 3 2 1
1 2
Output
2.683281573000
Input
4 2 3 6 4
2 1 2
3 10 6 8
2 1
Output
2.267786838055

Hint

In the first sample the jury should choose the following values: r1 = 3, p1 = 2, p2 = 1.

题意:

一种奖牌由内圆和外环组成,外环的半径为r1, 密度为p1。内圆的半径为r2,密度为p2;给出一种外环和内圆的质量比(A/B)!

给出一系列的r1,p1,p2!分别从中选出r1,p1,p2;要求最大的r2是多少!

PS:

内圆和外环的高度都是一样的,公式!化简后得:

((r1^2 - r2^2)*p1)/ (r1^2*p2)  = A/B。

直接找最大的r1,p1,和最小的p2;

代码例如以下:

#include <cstdio>
#include <cmath>
int main()
{
int n, m, k;
double r1, r2, p1, p2;
while(~scanf("%d",&n))
{
double tt;
r1 = 0;
for(int i = 0; i < n; i++)
{
scanf("%lf",&tt);
if(tt > r1)
r1 = tt;
}
scanf("%d",&m);
p1 = 0;
for(int i = 0; i < m; i++)
{
scanf("%lf",&tt);
if(tt > p1)
p1 = tt;
}
scanf("%d",&k);
p2 = 5000+47;
for(int i = 0; i < k; i++)
{
scanf("%lf",&tt);
if(tt < p2)
p2 = tt;
}
int A, B;
scanf("%d%d",&A,&B);
double ans = sqrt((r1*r1*p1*B)/(p1*B+p2*A));
printf("%lf\n",ans);
}
return 0;
}

CodeForces 215B Olympic Medal(数学啊)的更多相关文章

  1. CodeForces 534C Polycarpus' Dice (数学)

    题意:第一行给两个数,n 和 A,n 表示有n 个骰子,A表示 n 个骰子掷出的数的和.第二行给出n个数,表示第n个骰子所能掷出的最大的数,这些骰子都有问题, 可能或多或少的掷不出几个数,输出n个骰子 ...

  2. codeforces 687B - Remainders Game 数学相关(互质中国剩余定理)

    题意:给你x%ci=bi(x未知),是否能确定x%k的值(k已知) ——数学相关知识: 首先:我们知道一些事情,对于k,假设有ci%k==0,那么一定能确定x%k的值,比如k=5和ci=20,知道x% ...

  3. Codeforces Gym 100269G Garage 数学

    Garage 题目连接: http://codeforces.com/gym/100269/attachments Description Wow! What a lucky day! Your co ...

  4. Codeforces C. Almost Equal (数学规律)

    题目链接:http://codeforces.com/contest/1206/problem/C 题解 : 观察可以发现当n为偶数时,1 - 2n是不满足题意的,可以举例n = 2,n = 4试一试 ...

  5. codeforces 101C C. Vectors(数学)

    题目链接: C. Vectors time limit per test 1 second memory limit per test 256 megabytes input standard inp ...

  6. Educational Codeforces Round 15 D 数学推公式

    D. Road to Post Office time limit per test 1 second memory limit per test 256 megabytes input standa ...

  7. CodeForces 589D Boulevard (数学,相遇)

    题意:给定 n 个的在 x 轴上的坐标,和开始时间,结束坐标,从起点向终点走,如果和其他人相遇,就互相打招乎,问你每人打招乎的次数. 析:其实这一个数学题,由于 n 比较小,我们就可以两两暴力,这两个 ...

  8. Codeforces 311D Interval Cubing 数学 + 线段树 (看题解)

    Interval Cubing 这种数学题谁顶得住啊. 因为 (3 ^ 48) % (mod - 1)为 1 , 所以48个一个循环节, 用线段树直接维护. #include<bits/stdc ...

  9. Codeforces 932E Team Work 数学

    Team Work 发现网上没有我这种写法.. i ^ k我们可以理解为对于每个子集我们k个for套在一起数有多少个. 那么我们问题就变成了 任意可重复位置的k个物品属于多少个子集. 然后我们枚举k个 ...

随机推荐

  1. cocoa pods 升级遇到的问题

    1. cocoa pods 升级遇到的问题 运行 sudo gem update --system 报错 Updating rubygems-update ERROR: While executing ...

  2. 无语的Filezilla

    之前也一直用filezilla,今天遇到个奇葩问题:在2008R2上装完filezilla server,本打算生成个证书用于SSL加密,没想到一直报错"Failed to initiali ...

  3. mongdb复制集搭建

    可参考官网教程 复制集增加了数据的冗余同时也提高了mongodb的可靠性,相比传统的主从架构,mongodb具有自动容灾的特性,即主库挂掉后会自动从剩下的从库中选举出一个节点做为主库(不需要人工干预) ...

  4. IPC之SystemV

    svipc - System V interprocess communication mechanisms linux实现的System V interprocess communication ( ...

  5. How to convert from BufferedImage to JavaFX 2.2 Image

    http://blog.idrsolutions.com/2012/11/convert-bufferedimage-to-javafx-image/ ———————————————————————— ...

  6. input取值

    ----------------------------1------------------------------ <span class="lv-a-right" id ...

  7. 请写出一段表单提交的HTML代码,表单名称为form1,提交方式为post,提交地址为submit.asp

    请写出一段表单提交的HTML代码,表单名称为form1,提交方式为post,提交地址为submit.asp 解答: <form name=”form1” method=”post” action ...

  8. 使用JSR验证

    1.spring mvc配置文件中添加:         <mvc:annotation-driven /> 2.pom.xml中添加        <dependency > ...

  9. ARM汇编语言(1)(基本概念)

    1.***.s文件为汇编语言文件格式: 2.ARM寄存器(以Samsung芯片为例) 2.1.要介绍arm寄存器之前我们要先了解一下arm处理器的工作模式: Arm处理器有七种工作模式,为的是形成不同 ...

  10. (转)Apache Mina网络框架

    转自1:整体结构分析 http://www.cnblogs.com/xuekyo/archive/2013/03/06/2945826.html 转自2:详细源码分析 http://www.cnblo ...