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 Java (OpenJDK 11.0.6) (judge verdict: Runtime Error)

import java.util.*;
import java.io.*;

/**
 * Made by egor https://github.com/chermehdi/egor.
 * 
 * @author Azuz
 * 
 */
public class Main {

    void solve(Scanner in, PrintWriter out) {
      int n = in.nextInt();
      int[] arr = new int[n];
      
      int gcd = 0;

      boolean setwise = false;
      boolean pairwise = false;
      for (int i = 0; i < n; ++i) {
        arr[i] = in.nextInt();
        gcd = gcd(gcd, arr[i]);
      }

      if (gcd == 1) setwise = true;
      HashSet<Integer> set = new HashSet<>();
      boolean flag = true;
      for (int i = 0; i < n && flag; ++i) {
        int x = arr[i];
        if (x % 2 == 0) {
          if (set.contains(2)) {
            flag = false;
            break;
          }
          set.add(2);
          while (x % 2 == 0) x >>= 1;
        }

        for (int j = 3; j * j <= x; j += 2) {
          if (x % j == 0) {
            if (set.contains(j)) {
              flag = false;
              break;
            }
            set.add(j);
            while (x % j == 0) x /= j;
          }
        }

        if (x > 2) {
          if (set.contains(x)) {
            flag = false;
            break;
          }
          set.add(x);
        }
      }

      pairwise = flag;


      if (pairwise) {
        out.println("pairwise coprime");
      } else if (setwise) {
        out.println("setwise coprime");
      } else {
        out.println("not coprime");
      }
    }

    private int gcd(int a, int b) {
      if (b == 0) return a;
      return gcd(b, a % b);
    }

    public static void main(String[] args) {
        try(Scanner in = new Scanner(System.in);
            PrintWriter out = new PrintWriter(System.out)) {
            new Main().solve(in, out);
        }
    }
}