Codeforces 1186A Vus the Cossack and a Contest Solution

Solve in C:

#include<stdio.h>
int main()
{
    int n,m,k,r=0,t=0;
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        r=m/n;
        t=k/n;
        if(r>=1&&t>=1)
            printf("YES\n");
        else
            printf("NO\n");
    }

}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.