Back
Close

Fuel up

Statement

 Goal

You need to calculate if it is possible to fuel up a spaceship within the number of seconds allowed(t), given the capacity of the tank (c) in litres, and the number of litres of fuel that can be pumped into its tank per second (r).

The tank starts empty.
The maximum amount of litres per second (r) is constantly pumped into the tank until it is full.
Input
Line 1: Three space seperated integers t, c, and r.
Output
Line 1: An string "yes" or "no". "yes" if it is possible to fill up the spaceship in the time allowed, "no" if it is not possible.
Constraints
0 < t ≤ 10,000
0 < c ≤ 10,000
0 < r ≤ 1000
Example
Input
5 3 1
Output
yes

Game modes
Fastest, Shortest

Test cases
Simple Test
Input
5 3 1
Output
yes

Validator 1 Validator
Input
5 3 2
Output
yes

A bit bigger Test
Input
60 500 10
Output
yes

Validator 2 Validator
Input
65 400 11
Output
yes

add an extra digit Test
Input
3333 10000 3
Output
no

Validator 3 Validator
Input
3444 10200 4
Output
yes

Fun with big numbers Test
Input
7 7373 1000
Output
no

Validator 4 Validator
Input
3 8989 2020
Output
no

This'll be interesting Test
Input
1 30 500
Output
yes

Validator 5 Validator
Input
1 31 3000
Output
yes

Can you handle it? Test
Input
00001 0000000000006 000000000019
Output
yes

Validator 6 Validator
Input
0003 000000000000003 0000000000000000000000000000000014
Output
yes

Just in time Test
Input
10 100 10
Output
yes

Validator 7 Validator
Input
28 725 25
Output
no

Solution language

Solution

Stub generator input