codeforces 501A Contest

本文介绍了一个简单的编程问题,即比较两位参赛者在Codeforces比赛中因解决不同难度的问题及提交时间差异而获得的实际分数。文章提供了完整的代码实现,用于计算并输出谁获得了更高的分数。

点击打开链接

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


水题

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    int m=max(3*a/10,a-a/250*c);
    int n=max(3*b/10,b-b/250*d);
    if(m>n)
    	printf("Misha\n");
    else if(n>m)
    	printf("Vasya\n");
    else
    	printf("Tie\n");
    return 0;
}


### Codeforces Problem Set or Contest Information for 898 For the specific query regarding Codeforces contest numbered 898, detailed information can be provided based on typical structure and available data from similar contests mentioned in references. The format of such competitions usually includes multiple problems with varying difficulty levels designed to test different aspects of algorithmic thinking and coding skills. Each problem typically starts with an input section that defines constraints and expected inputs followed by output requirements specifying what needs to be computed or determined[^2]. For instance, some contests specify details like "the first line contains two integers n and k," indicating parameters relevant to solving the challenge at hand. In terms of accessing direct information about contest 898 specifically, one would normally visit the official Codeforces website where all past contests including their respective problems, statements, and solutions after the competition period are archived and accessible via URLs structured similarly to those provided as examples here[^3]. To explore this particular contest further, navigating directly through the platform's archive using its search functionality or browsing tools is recommended since not every individual contest detail might have been explicitly referenced within these citations. ```python import webbrowser def open_codeforces_contest(contest_id): url = f"https://codeforces.com/contest/{contest_id}" webbrowser.open(url) open_codeforces_contest(898) ``` --related questions-- 1. What types of algorithms are commonly tested in Codeforces contests? 2. How does one prepare effectively for participating in competitive programming events like those hosted on Codeforces? 3. Can you provide tips for improving performance during timed coding challenges? 4. Are there any notable differences between various divisions offered in Codeforces rounds?
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值