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# (Mono-csc 3.5.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("5 3");
            WillReturn.Add("1 2");
            WillReturn.Add("3 4");
            WillReturn.Add("5 1");
            //3
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("4 10");
            WillReturn.Add("1 2");
            WillReturn.Add("2 1");
            WillReturn.Add("1 2");
            WillReturn.Add("2 1");
            WillReturn.Add("1 2");
            WillReturn.Add("1 3");
            WillReturn.Add("1 4");
            WillReturn.Add("2 3");
            WillReturn.Add("2 4");
            WillReturn.Add("3 4");
            //4
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("10 4");
            WillReturn.Add("3 1");
            WillReturn.Add("4 1");
            WillReturn.Add("5 9");
            WillReturn.Add("2 6");
            //3
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();

        int[] wkArr = { };
        Action<string> SplitAct = pStr =>
            wkArr = pStr.Split(' ').Select(X => int.Parse(X)).ToArray();

        foreach (string EachStr in InputList.Skip(1)) {
            SplitAct(EachStr);
            RenketuSyori(wkArr[0], wkArr[1]);
        }
        Console.WriteLine(UnionSetList.Max(pX => pX.Count));
    }

    //UnionFindのSetのList
    static List<HashSet<int>> UnionSetList = new List<HashSet<int>>();

    //連結処理を行う
    static void RenketuSyori(int p1, int p2)
    {
        //同じノードなら何もしない
        if (p1 == p2) return;

        int wkInd1 = UnionSetList.FindIndex(X => X.Contains(p1));
        int wkInd2 = UnionSetList.FindIndex(X => X.Contains(p2));

        //UnionFind木に両方とも存在しない場合
        if (wkInd1 < 0 && wkInd2 < 0) {
            UnionSetList.Add(new HashSet<int>() { p1, p2 });
        }
        //UnionFind木にp2のみが存在する場合
        else if (wkInd1 < 0 && wkInd2 >= 0) {
            UnionSetList[wkInd2].Add(p1);
        }
        //UnionFind木にp1のみが存在する場合
        else if (wkInd1 >= 0 && wkInd2 < 0) {
            UnionSetList[wkInd1].Add(p2);
        }
        //別々のUnionFind木なら木をマージ
        else if (wkInd1 != wkInd2) {
            UnionSetList[wkInd1].UnionWith(UnionSetList[wkInd2]);
            UnionSetList.RemoveAt(wkInd2);
        }
    }
}