func_code_string: #include <bits/stdc++.h>   using namespace std;   int gcd(int a, int b) { return (b != 0 ? gcd(b, a % b) : a); }   int lcm(int a, int b) { return (a / gcd(a, b) * b); }   int R[] = {1, -1, 0, 0, 1, -1, -1, 1};   int C[] = {0, 0, 1, -1, 1, -1, 1, -1};   int KR[] = {-2, -2, -1, 1, 2, 2, -1, 1};   int KC[] = {1, -1, 2, 2, 1, -1, -2, -2};   struct P {     double x, y;     P(double x = 0.0, double y = 0.0) {       this->x = x;       this->y = y;     }   };   P mkv(P ae, P be) { return P(be.x - ae.x, be.y - ae.y); }   double dtp(P ae, P be) { return (ae.x * be.x + ae.y * be.y); }   double crp(P ae, P be) { return (ae.x * be.y - ae.y * be.x); }   double val(P ae) { return sqrt(dtp(ae, ae)); }   P vresize(P ae, double llen) {     double v = val(ae);     return P(ae.x * llen / v, ae.y * llen / v);   }   double ART(P ae, P be) { return crp(ae, be) / 2.0; }   P rot(P ae, double ang) {     return P(ae.x * cos(ang) - ae.y * sin(ang),              ae.y * cos(ang) + ae.x * sin(ang));   }   int main() {     int a, b, c, d, h, m, n, p, x, y, i, j, k, l, q, r, t, cnt, sm, tmp;     scanf( %d %d %d %d , &a, &b, &c, &d);     sm = max((3.0 * a) / 10.0, a - (a * c / 250.0));     cnt = max((3.0 * b) / 10.0, b - (b * d / 250.0));     if (sm > cnt)       printf( Misha n );     else if (cnt > sm)       printf( Vasya n );     else       printf( Tie n );     return 0;   }   