码迷,mamicode.com
首页 > 其他好文 > 详细

Codeforces Round #427 A

时间:2017-08-02 00:24:40      阅读:124      评论:0      收藏:0      [点我收藏+]

标签:ack   algo   map   eof   fine   first   out   for   cto   

Key races

题意:

思路:xjb写

AC代码:

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define ll long long
#define endl ("\n")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ft (frist)
#define sd (second)
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

///AAAA

ll s,v1,v2,t1,t2;
int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>s>>v1>>v2>>t1>>t2;
    ll k1=t1*2,k2=t2*2;
    k1+=s*v1;
    k2+=s*v2;
    if(k1<k2) cout<<"First\n";
    else if(k1>k2) cout<<"Second\n";
    else cout<<"Friendship\n";
    return 0;
}

 

Codeforces Round #427 A

标签:ack   algo   map   eof   fine   first   out   for   cto   

原文地址:http://www.cnblogs.com/max88888888/p/7271477.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!