【水】Codeforces-501A Contests

版权声明:本文为博主原创文章,转载请留言通知。 https://blog.csdn.net/silent0001/article/details/52589819

这题只要能看懂题就没问题。。

【题目】

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 abcd (250 ≤ a, b ≤ 35000 ≤ 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.

Examples
Input
500 1000 20 30
Output
Vasya
Input
1000 1000 1 1
Output
Tie
Input
1500 1000 176 177
Output
Misha

【题意】

      就是有两个人要比谁的分高,无脑公式带入计算。

      输入:a,b,c,d;(分别代表两个人的分和用时)

      输出:谁的分高把那个人的名字输出来,一样的话就输出Tie


【思路】

      计算公式题目里有,第一个人的p是a,t是c,第二个人的p是b,t是d,代入公式比较就行了。

【代码】

#include<cstdio>
#include<algorithm>
using namespace std;

int main()
{
	double a,b,c,d;
	while(scanf("%lf%lf%lf%lf",&a,&b,&c,&d)!=EOF)
	{
		double m,v;
		m=max(3*a/10,a-a/250*c);
		v=max(3*b/10,b-b/250*d);
		if(m>v)
			printf("Misha\n");
		else if(m<v)
			printf("Vasya\n");
		else
			printf("Tie\n");
	}
}


[Fin]

猜你喜欢

转载自blog.csdn.net/silent0001/article/details/52589819