Key races

题目链接  http://codeforces.com/problemset/problem/835/A

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 s characters. The first participant types one character in v1 milliseconds and has ping t1 milliseconds. The second participant types one character in v2milliseconds and has ping t2 milliseconds.

If connection ping (delay) is t milliseconds, the competition passes for a participant as follows:

  1. Exactly after t milliseconds after the start of the competition the participant receives the text to be entered.
  2. Right after that he starts to type it.
  3. 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 sv1v2t1t2 (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

题目大意:

有两个人比赛打字,总共n个字符,第一个人需要花费t1连接系统获得想要打字的内容,第一个人打字的速度是v1/秒,完成n个字符够还需要花费t1秒提交;第二个人和以此类推。题目问,如果第一个人所用时间少的话,输出“First”,第二个人所用时间少的话,输出“Second”,如果花费时间一样的话,输出“Friendship”。

解题思路:

这道题不会做的人一定是题意没有看懂,思路的话没什么。

代码:

#include<iostream>
using namespace std;
int main()
{
    int s,v1,v2,t1,t2,sum1,sum2;
    while(cin>>s>>v1>>v2>>t1>>t2)
    {
        sum1=v1*s+t1*2;
        sum2=v2*s+t2*2;
        if(sum1<sum2)
            cout<<"First"<<endl;
        else if(sum1>sum2)
            cout<<"Second"<<endl;
        else
            cout<<"Friendship"<<endl;
    }
    return 0;
}


  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值