codeforces 835A Key races
来源:互联网 发布:10大网络恐怖推理图 编辑:程序博客网 时间:2024/06/03 05:54
点击打开链接
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 after 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.
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.
If the first participant wins, print "First". If the second participant wins, print "Second". In case of a draw print "Friendship".
5 1 2 1 2
First
3 3 1 1 1
Second
4 5 3 1 5
Friendship
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.
#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 835 A Key races
- CodeForces 835A Key races
- codeforces 835 a Key races
- codeforces 835A Key races
- codeforces A. Key races
- Codeforces #835A: Key Races 题解
- CodeForces 835 A.Key races(水~)
- Codeforces 835A Key races (水题)
- codeforces 835a 之 Key races
- codeforces 835B Key races
- Codeforces Round #427 A. Key races
- A. Key races
- Codeforces Round #427 (Div. 2) A. Key races
- Codeforces Round #427 (Div. 2)-A. Key races
- Codeforces Round #427 (Div. 2) A. Key races
- cf427(2) A. Key races
- Key races
- Qt线程之moveToThread
- ios有关字符串的工具类
- io--读写数据
- Matrix Power Series
- spring data redis rg.springframework.core.serializer.support.DeserializingConverter.<init>(Ljava/lan
- codeforces 835A Key races
- Linux下安装jdk8步骤详述
- 在Swing和Swt中使用JavaFX
- 配置FTP虚拟登录
- 在vim中取消搜索的高亮
- 用深度学习(CNN RNN Attention)解决大规模文本分类问题
- BZOJ 3230 相似子串 后缀数组+二分+ST表
- Mybatis的一级缓存和二级缓存
- openwrt profile增加默认包及默认宏