ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Турниры > IMPC - 2013-2014 > задача:


2013-Nov-01. 50328 - How far away

IMPC - 2013-2014

Старт: 16.мар.2013 в 12:00:00
Финиш: 16.мар.2013 в 17:00:00
Турнир завершён!
• Турнирная таблица

Гость
• Вопросы к жюри (1)

Задачи турнира

• 2013-04-90. 50332 - Variance of a ...
• 2013-05-10. 50552 - Kepuce te perd...
• 2013-05-30. 50580 - Sa dite kane ka...
• 2013-05-40. 50553 - I pjestueshem...
• 2013-05-50. 50593 - Transportimi
• 2013-12-10. 50352 - Selling Cows
• 2013-12-40. 50342 - 100 Factorial
• 2013-12-50. 50674 - Collecting Eggs
• 2013-Nov-01. 50328 - How far ...
• 2013-Nov-02. 50347 - Selling Oranges
• 2013-Nov-05. 50354 - Intersecting ...

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Prepared by Ibrahim Mesecan.

How far away

Question: On a Cartesian coordinate system, your robot is given a series of directions: Up (U), Down (D), Right (R) or Left (L) followed by a positive integer. The robot starts from coordinate (x,y) and travels on the given direction with the given amount of steps. You are asked to find Euclidean distance from the origin (0,0).

Input specification
You are first given the starting coordinates (x,y). Starting from the next line you are given the direction (U, D, R, or L) and the number of steps (nsteps) on the given direction where 1 ≤ nsteps ≤ 100 There are at most 100000 lines in the data series and it ends with a '#' sign.

Output specification
Show a floating point number with 3 decimal place which represent the Euclidean distance from the origin.

Sample Input I
3 2
U 2
D 4
R 2
#
Sample Input II
4 6
D 5
L 7
D 2
R 2
#
Sample Output I
5
Sample Output II
1.414

Для отправки решений необходимо выполнить вход.

www.contester.ru