Problem:
Score : 100 points

Problem Statement

Takahashi is meeting up with Aoki.

They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.

Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.

Will he arrive in time?

Constraints

1 \leq D \leq 10000

1 \leq T \leq 10000

1 \leq S \leq 10000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

D T S

Output

If Takahashi will reach the place in time, print Yes; otherwise, print No.

Sample Input 1

1000 15 80

Sample Output 1

Yes

It takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.

Sample Input 2

2000 20 100

Sample Output 2

Yes

It takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.

Sample Input 3

10000 1 1

Sample Output 3

No

He will be late.

Solution in C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<stdio.h>

int main(void){
    char s[1001],t[1001];
    int n=0,max_n=0,max_s,max_t,start;
    scanf("%s%s",s,t);
    for(int a=0;;a++)if(s[a]=='\0'){
        max_s=a;
        break;
    }
    for(int a=0;;a++)if(t[a]=='\0'){
        max_t=a;
        break;
    }
    
    for(int i=0;i<max_s;i++){
        n=0;
        for(int j=0;j<max_t&&max_s-max_t>=i;j++){
            if(s[i+j]==t[j])n++;
        }
        if(n>max_n)max_n=n;
    }
    printf("%d",max_t-max_n);
    return 0;
}