Codeforces Round #327 (Div. 2) A. Wizards' Duel
来源:互联网 发布:淘宝达人如何大v认证 编辑:程序博客网 时间:2024/05/19 20:19
解题报告:Codeforces Round #327 problems analysis
Harry Potter and He-Who-Must-Not-Be-Named engaged in a fight to the death once again. This time they are located at opposite ends of the corridor of length l. Two opponents simultaneously charge a deadly spell in the enemy. We know that the impulse of Harry's magic spell flies at a speed of p meters per second, and the impulse of You-Know-Who's magic spell flies at a speed of q meters per second.
The impulses are moving through the corridor toward each other, and at the time of the collision they turn round and fly back to those who cast them without changing their original speeds. Then, as soon as the impulse gets back to it's caster, the wizard reflects it and sends again towards the enemy, without changing the original speed of the impulse.
Since Harry has perfectly mastered the basics of magic, he knows that after the second collision both impulses will disappear, and a powerful explosion will occur exactly in the place of their collision. However, the young wizard isn't good at math, so he asks you to calculate the distance from his position to the place of the second meeting of the spell impulses, provided that the opponents do not change positions during the whole fight.
The first line of the input contains a single integer l (1 ≤ l ≤ 1 000) — the length of the corridor where the fight takes place.
The second line contains integer p, the third line contains integer q (1 ≤ p, q ≤ 500) — the speeds of magical impulses for Harry Potter and He-Who-Must-Not-Be-Named, respectively.
Print a single real number — the distance from the end of the corridor, where Harry is located, to the place of the second meeting of the spell impulses. Your answer will be considered correct if its absolute or relative error will not exceed 10 - 4.
Namely: let's assume that your answer equals a, and the answer of the jury is b. The checker program will consider your answer correct if .
1005050
50
1996040
119.4
In the first sample the speeds of the impulses are equal, so both of their meetings occur exactly in the middle of the corridor.
- Codeforces Round #327 (Div. 2)A. Wizards' Duel
- Codeforces Round #327 (Div. 2) A. Wizards' Duel 反思
- Codeforces Round #327 (Div. 2) (A. Wizards' Duel 简单数学)
- Codeforces Round #327 (Div. 2) A. Wizards' Duel
- Codeforces Round #327 (Div. 2)A. Wizards' Duel
- Codeforces Round #327 (Div. 2) A. Wizards' Duel(水)
- Codeforces Round #327 (Div. 2)A. Wizards' Duel
- cf #327 Div.2 Problem A Wizards' Duel
- CodeForces-591A Wizards' Duel
- Codeforces 591A Wizards' Duel
- Codeforces 591A Wizards' Duel
- codeforces 591A Wizards' Duel
- 大水题--CodeForces - 591A Wizards' Duel
- A. Wizards' Duel
- Code Forces 591 A. Wizards' Duel(水~)
- Codeforces Round #327 (div.2)(A B C D)
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #174 (Div. 2) Problem A
- http状态码详解
- iphone数据存储之-- Core Data的使用(一)
- C++,JAVA之间相互调用学习
- Delphi 中TWebBrowser的扩展控件TExWebBrowser
- leetcode 297 : Serialize and Deserialize Binary Tree
- Codeforces Round #327 (Div. 2) A. Wizards' Duel
- 有关UIView、subview的几个基础知识点-IOS开发 (实例)
- Virtual 下安装CentOs6.4
- 详解JDBC与Hibernate区别
- 最大值栈和最大值队列(Tsinghua OJ,PA2)
- 大数能否被小数整除 ACM
- uvaoj 1030 - Image Is Everything
- 源码阅读----网络请求
- 解决vim 中文乱码