codeforces 835A Key races
2017-08-18 15:10
405 查看
点击打开链接
A. Key races
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of scharacters.
The first participant types one character in v1 milliseconds
and has ping t1 milliseconds.
The second participant types one character in v2 milliseconds
and has ping t2 milliseconds.
If connection ping (delay) is t milliseconds, the competition passes for a participant as follows:
Exactly afte
4000
r t milliseconds after the start of the competition the participant receives the text to be entered.
Right after that he starts to type it.
Exactly t milliseconds after he ends typing all the text, the site receives information about it.
The winner is the participant whose information on the success comes earlier. If the information comes from both participants at the same time, it is considered that there is a draw.
Given the length of the text and the information about participants, determine the result of the game.
Input
The first line contains five integers s, v1, v2, t1, t2 (1 ≤ s, v1, v2, t1, t2 ≤ 1000) —
the number of characters in the text, the time of typing one character for the first participant, the time of typing one character for the the second participant, the ping of the first participant and the ping of the second participant.
Output
If the first participant wins, print "First". If the second participant wins, print "Second".
In case of a draw print "Friendship".
Examples
input
output
input
output
input
output
Note
In the first example, information on the success of the first participant comes in 7 milliseconds, of the second participant — in 14milliseconds.
So, the first wins.
In the second example, information on the success of the first participant comes in 11 milliseconds, of the second participant — in 5milliseconds.
So, the second wins.
In the third example, information on the success of the first participant comes in 22 milliseconds, of the second participant — in 22milliseconds.
So, it is be a draw.
没什么思路,就是看出来了时间=s*v+2*t
A. Key races
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of scharacters.
The first participant types one character in v1 milliseconds
and has ping t1 milliseconds.
The second participant types one character in v2 milliseconds
and has ping t2 milliseconds.
If connection ping (delay) is t milliseconds, the competition passes for a participant as follows:
Exactly afte
4000
r t milliseconds after the start of the competition the participant receives the text to be entered.
Right after that he starts to type it.
Exactly t milliseconds after he ends typing all the text, the site receives information about it.
The winner is the participant whose information on the success comes earlier. If the information comes from both participants at the same time, it is considered that there is a draw.
Given the length of the text and the information about participants, determine the result of the game.
Input
The first line contains five integers s, v1, v2, t1, t2 (1 ≤ s, v1, v2, t1, t2 ≤ 1000) —
the number of characters in the text, the time of typing one character for the first participant, the time of typing one character for the the second participant, the ping of the first participant and the ping of the second participant.
Output
If the first participant wins, print "First". If the second participant wins, print "Second".
In case of a draw print "Friendship".
Examples
input
5 1 2 1 2
output
First
input
3 3 1 1 1
output
Second
input
4 5 3 1 5
output
Friendship
Note
In the first example, information on the success of the first participant comes in 7 milliseconds, of the second participant — in 14milliseconds.
So, the first wins.
In the second example, information on the success of the first participant comes in 11 milliseconds, of the second participant — in 5milliseconds.
So, the second wins.
In the third example, information on the success of the first participant comes in 22 milliseconds, of the second participant — in 22milliseconds.
So, it is be a draw.
没什么思路,就是看出来了时间=s*v+2*t
#include<cstdio> #include<algorithm> using namespace std; int main() { int s,v1,v2,t1,t2; scanf("%d%d%d%d%d",&s,&v1,&v2,&t1,&t2); int m=v1*s+2*t1; int n=v2*s+2*t2; if(m<n) printf("First\n"); else if(m>n) printf("Second\n"); else printf("Friendship\n"); return 0; }
相关文章推荐
- codeforces 835a 之 Key races
- Codeforces 835A-Key races
- CodeForces 835A Key races
- CodeForces - 835A Key races(阅读题)
- Codeforces 835A Key races (水题)
- Codeforces Round #427 (Div. 2) Problem A Key races (Codeforces 835 A)
- CodeForces 835 A.Key races(水~)
- CodeForces 820B Mister B and Angle in Polygon
- codeforces 377A Maze
- CodeForces - 803C(GCD+思维)
- 【CODEFORCES】 A. Expression
- Codeforces Good Bye 2015 A. New Year and Days
- Codeforces 755C 【并查集】【思维】
- codeforces 707-C. Pythagorean Triples(数学)
- codeforces-379B. New Year Present
- CodeForces - 894B Ralph And His Magic Field 快速幂
- 周赛2-CodeForces 445B-E 题
- 【codeforces】-610A-Pasha and Stick(水)
- Problem--1A--Codeforces--TheatreSquare
- Codeforces 193B