CodeForces 501A Contest

A. Contest

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

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 t minutes 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 test(s)

Input

500 1000 20 30

Output

Vasya

Input

1000 1000 1 1

Output

Tie

Input

1500 1000 176 177

Output

Misha

水题，水到不能再水.

#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int a,b,c,d;
scanf("%d%d%d%d",&a,&b,&c,&d);
double m=max(3*a/10,a-a*c/250);
double v=max(3*b/10,b-b*d/250);
if(m>v)
printf("Misha\n");
else if(m<v)
printf("Vasya\n");
else
printf("Tie\n");
return 0;
}