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.
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 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.
500 1000 20 30
Vasya
1000 1000 1 1
Tie
1500 1000 176 177
Misha
题意:
带入公式试一下。
问题卡在 —> 如图
不知道是不是第四次经历了!!!求解!
AC CODE:
#include<stdio.h>
#include<cstring>
#include<algorithm>
#define AC main()
using namespace std;
const int MYDD = 1103;
double GetPoints(int p, int t) {
return max(0.3*p, (p - p*t/250.0)*1.0);
}
int AC {
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
if(GetPoints(a, c) > GetPoints(b, d)) {
puts("Misha");
}
else if(GetPoints(a, c) < GetPoints(b, d)) {
puts("Vasya");
}
else if(GetPoints(a, c) == GetPoints(b, d)) {
puts("Tie");
}
return 0;
}///

本文介绍了一个简单的Codeforces竞赛得分比较问题。通过给定的公式计算两位参赛者Misha和Vasya各自解决的问题得分,并根据得分判断谁的分数更高或者是否平局。
511

被折叠的 条评论
为什么被折叠?



