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
500 1000 20 30
Vasya
1000 1000 1 1
Tie
1500 1000 176 177
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 ; }