Codeforces 285 div2 a
2015-01-12 00:00
666 查看
摘要: Codeforces 285 div2 a
/** * @brief Codeforces Round #285 (Div. 2) a * @file a.cpp * @author mianma * @created 2015/01/12 11:51 * @edited 2014/01/12 11:51 * @type * @note */ #include <fstream> #include <iostream> #include <cstring> using namespace std; #define max(a, b) ((a) > (b) ? (a) : (b)) #define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a))) #define CLR(vec) memset(vec, 0, sizeof(vec)) #ifdef DEBUG ifstream in; ofstream out; #define CIN in #define COUT out #else #define CIN cin #define COUT cout #endif #define MAXN 50 #define MAXV 1e5 int n, x; int p1, p2, t1, t2, tot1, tot2; int main(void){ ios_base::sync_with_stdio(0); #ifdef DEBUG CIN.open("./in", ios::in); COUT.open("./out", ios::out); #endif CIN >> p1 >> p2 >> t1 >> t2; tot1 = max(3*p1/10, p1 - (p1/250)*t1); tot2 = max(3*p2/10, p2 - (p2/250)*t2); if(tot1 == tot2){ COUT << "Tie\n"; }else if(tot1 > tot2){ COUT << "Misha\n"; }else{ COUT <<"Vasya\n"; } return 0; }
相关文章推荐
- 第二十五次codeforces竞技结束 #285 Div 2
- codeforces-div1-285-D
- Codeforces 285 div2 c
- Codeforces 285 div2 b
- codeforces 338(Div 2) B. Longtail Hedgehog 解题报告
- Codeforces 615C Running Track (Round #338 (Div. 2) C题) Trie + dp
- Codeforces - 337B(div2) - Vika and Squares
- codeforces 782B Round #403 Div. 2B
- codeforces div2 round#231 B
- codeforces 354 div2 C Vasya and String 前缀和
- codeforces div2 round#230 D
- 【每日一题(6)】Div. 64 CodeForces - 887A
- 思路题 codeforces div2 C Replacement
- Codeforces Beta Round #27 (Codeforces format, Div. 2) E. Number With The Given Amount Of Divisors 反素数
- 【Codeforces】【#268 Div.1】
- CodeForces 525D Arthur and Walls(DIV2 D) (DFS+YY)
- AIM Tech Round 3 (Div. 2) (B C D E) (codeforces 709B 709C 709D 709E)
- Codeforces Round #434 (Div. 2, based on Technocup 2018 Elimination Round 1)&&Codeforces 861B Which floor?【枚举,暴力】
- 【Codeforces Round #368 (Div. 2)】Codeforces 707A Brain's Photos
- Codeforces 238 div2 A. Gravity Flip