Codeforces Solution 501A Contest 

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    long long int a,b,c,d,ma,mb;
    cin>>a>>b>>c>>d;
    ma=max(((3*a)/10),a-((a/250)*c));
    mb=max(((3*b)/10),b-((b/250)*d));

    if(ma==mb)
        cout<<"Tie"<<endl;
    else if(ma>mb)
        cout<<"Misha"<<endl;
    else
        cout<<"Vasya"<<endl;

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Uri Solution 2747 Output 1

#include<stdio.h> int main() {     printf("---------------------------------------\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("|                                     |\n");     printf("---------------------------------------\n");     return 0; }
Read more

Codeforces Solution 230B T-primes

Image
#include < bits / stdc ++. h > using namespace std ; int arr [ 10000000 ]; int main () { int i , j ; arr [ 0 ]= arr [ 1 ]= 1 ; for ( i = 2 ; i * i <= 10000000 ; i ++) { if ( arr [ i ]== 0 ) { for ( j = 2 ; i * j <= 10000000 ; j ++) { arr [ i * j ]= 1 ; } } } int n , t ; cin >> n ; long long int in ; for ( int i = 0 ; i < n ; i ++) { cin >> in ; t = sqrt ( in ); if ( t == sqrt ( in )&& arr [ t ]== 0 ) { cout << "YES" << endl ; } else cout << "NO" << endl ; } return 0 ; }
Read more