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>
//#include<string.h>

int main(void){
  char a[1000],b[1000];
  int i=0;
  scanf("%s",a);
  scanf("%s",b);
  
  while(a[i]!='\0'){
    //printf("%c",a[i]);
    i=i+1;
  }
  int aleng=i;
  i=0;
  while(b[i]!='\0'){
    //printf("%c",b[i]);
    i=i+1;
  }
  int bleng=i;
  //printf("%d %d",aleng,bleng);
  
  int n;
  n=aleng-bleng+1;
  
  int t[n],j,k,count;
  for(i=0;i<n;i++){
    count=0;
	k=0;
    for(j=i;j<i+bleng;j++){
      if(a[j]!=b[k]) count+=1;
      //printf("a=%c b=%c\n",a[j],b[k]);
      k=k+1;
    }
   t[i]=count;
   //printf("%d",t[i]);
      
  }
  
  int min=t[0];
  for(i=1;i<n;i++){
    if(t[i]<min) min=t[i];
  }
  
  
  printf("%d",min);
  
  return 0;
}