当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3975:Easy Fruit Ninja

题目描述
YY is a clever boy . Recently he bought a new mobile phone .he is addicted in a game named Fruit Ninja . In the game . The fruit will fly from the bottom of the screen in a parabolic curve(g = 10.0 m/s^2). Your aim is cutting the fruit before the fruit fall down and disappear but you can't cut it at time 0.0 . And YY is a lazy boy. He just want to cut the fruit use the least times . Every time he cut .all the fruit in the same line will be cut. To simple this problem .we regard the fruit as a point . The mobile phone is a Two dimensional coordinate department There are only three Fruit fly into the air. YY want to know if exist a time that three fruit are in a same line and what the time it is.
输入解释
In the first line . Only a number T (1 <= T <= 1000) indicate the test case

each test case the first line contain three real number x1, x2, x3, indicate the coordinate of the fruit (x1, 0) (x2, 0), (x3, 0) ( - 10000 <= x1, x2, x3 <= 10000)

the second line contain three real number v1, v2, v3, indicate the speed of the fruit (0 <= v1, v2, v3 <= 10000)

the third line contain three real number a, b, c, indicate the radian of the fruit's direction to the x coordinate ( 0 <= a, b, c <= pi )
输出解释
For each case , output the number of case and the time (round to 4 decimal places), if there are more than one solution , just output "Multiply answer", if there is no answer ,

just output “-1”, .(as shown in the sample output)
输入样例
3 
150 35 250 
80 200 220 
2.00 2.17 2.27

0 1 2 
1 1 1 
1 1 1

0 0 0 
1 2 3 
1 1 1
输出样例
Case #1: 8.4151 
Case #2: Multiply answer 
Case #3: Multiply answer
来自杭电HDUOJ的附加信息
Author mhl
Recommend

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-3975

最后修改于 2020-10-25T23:08:54+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)