CodeForces 501A Contest(最大得分)
2016-09-21 17:37
232 查看
Contest
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Misha and Vasya participated in a Codeforces contest. Unfortunately, each of them solved only one problem, though successfully submitted it at the first attempt. Misha solved the problem that costs a points
and Vasya solved the problem that costs b points. Besides, Misha submitted the problem c minutes after the contest started and
Vasya submitted the problem d minutes after the contest started. As you know, on Codeforces the cost of a problem reduces as a round continues. That is, if you submit a problem that costs p points tminutes
after the contest started, you get
points.
Misha and Vasya are having an argument trying to find out who got more points. Help them to find out the truth.
Input
The first line contains four integers a, b, c, d (250 ≤ a, b ≤ 3500, 0 ≤ c, d ≤ 180).
It is guaranteed that numbers a and b are divisible by 250 (just like
on any real Codeforces round).
Output
Output on a single line:
"Misha" (without the quotes), if Misha got more points than Vasya.
"Vasya" (without the quotes), if Vasya got more points than Misha.
"Tie" (without the quotes), if both of them got the same number of points.
Sample Input
Input
Output
Input
Output
Input
Output
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
Misha and Vasya participated in a Codeforces contest. Unfortunately, each of them solved only one problem, though successfully submitted it at the first attempt. Misha solved the problem that costs a points
and Vasya solved the problem that costs b points. Besides, Misha submitted the problem c minutes after the contest started and
Vasya submitted the problem d minutes after the contest started. As you know, on Codeforces the cost of a problem reduces as a round continues. That is, if you submit a problem that costs p points tminutes
after the contest started, you get
points.
Misha and Vasya are having an argument trying to find out who got more points. Help them to find out the truth.
Input
The first line contains four integers a, b, c, d (250 ≤ a, b ≤ 3500, 0 ≤ c, d ≤ 180).
It is guaranteed that numbers a and b are divisible by 250 (just like
on any real Codeforces round).
Output
Output on a single line:
"Misha" (without the quotes), if Misha got more points than Vasya.
"Vasya" (without the quotes), if Vasya got more points than Misha.
"Tie" (without the quotes), if both of them got the same number of points.
Sample Input
Input
500 1000 20 30
Output
Vasya
Input
1000 1000 1 1
Output
Tie
Input
1500 1000 176 177
Output
Misha
给出分数计算公式,判断谁赢;
#include <cstdio> #include <cstring> #include <algorithm> using namespace std ; int main() { int a ,b,c,d, k1 , k2 ; scanf("%d %d %d %d", &a, &b, &c, &d) ; k1 = max( 3*a/10,a-a*c/250 ) ; k2 = max( 3*b/10,b-b*d/250 ) ; if( k1 > k2 ) printf("Misha\n") ; else if( k2 > k1 ) printf("Vasya\n") ; else printf("Tie\n"); return 0 ; }
相关文章推荐
- CodeForces 346A Alice and Bob (数学最大公约数)
- CodeForces 501A Contest
- CodeForces 722C Destroying Array(数组删除区间最大值)
- Codeforces 498C Array and Operations(最大流)
- 【codeforces 691 D】【并查集 或者 dfs】aps in Permutation【给一个1到N的排列,M个操作,每次可以交换X Y位置上的数字,求可以得到的最大字典序的数列】
- Codeforces 633 F The Chocolate Spree(树形dp,两条不相交链节点权值和最大)
- CodeForces - 839E Mother of Dragons (最大团)
- Codeforces_427B_Prison Transfer(一维RMQ区间查询最大值)
- CodeForces 337C Quiz(二分,快速幂,答题得分最小值)
- Codeforces 546 E:士兵的旅行 最大网络流
- 【2016杭电女生赛1010】【旅行商问题DP + 贪心】Ingress 最多走L距离 最多hackK次 的最大得分
- 51NOD 1421 最大MOD值&&Codeforces 484 B. Maximum Value(筛法 + 二分)
- 【codeforces】-#610B-Vika and Squares(一串数循环一圈后递减,遇0结束,求最大)
- CodeForces 484B 求最大余数
- Codeforces 818G. Four Melodies 最大费用最大流
- Codeforces 734E. Anton and Tree By Assassin 缩点+树的最大直径
- Codeforces 706D Vasiliy's Multiset (字典树求异或最大值)
- CodeForces 498C Array and Operations 最大流
- 【codeforces 722C】【逆向思维 离线+并查集】C. Destroying Array 【给你n个数,每次摧毁一个,求每摧毁一个的最大连续和(被摧毁的点的两边不连续)】
- Codeforces 389A (最大公约数)