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.



Sample input:
1000 15 80


Sample output:
Yes

Submission status: Runtime Error

Solution code:
D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= T:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
d = int(input())
t = int(input())
s = int(input())
if (t*s >= d):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
d = int(input())
t = int(input())
s = int(input())
if t*s >= d:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
D=int(input())
T=int(input())
S=int(input())

if T*S>=D:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
input(D)
input(T)
input(S)

if T*S>=D:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a = [input() for i in range(3)]
D = int(a[0])
T = int(a[1])
S = int(a[2])
if T*S <= D:
  print("Yes")
if T*S > D:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int, input())
if a <= b*c :
  print('Yes')
elif a > b*c :
   print('No')

Submission status: Runtime Error

Solution code:
D, T, S = map(int, input())
if D <= T * S:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a = [input() for i in range(3)]
D = int(a[0])
T = int(a[1])
S = int(a[2])
if T*S <= S:
  print("Yes")
if T*S > S:
  print("No")

Submission status: Runtime Error

Solution code:
D, T, S = map(int, input())
if D >= T * S:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
#include<stdio.h>
int main(void){
    int d, s, t;

    scanf("%d",&d);
    scanf("%d",&s);
    scanf("%d",&t);

    if(d/s<=t){
        printf("Yes");
    }
    else if(d/s>=t){
        printf("No");
    }
    return 0;
}






/*
d=input(int(''))
t=input(int(''))
s=input(int(''))

if d*s<=t:
    print("Yes")
elif d*s>=t:
    print("No")
    */

Submission status: Runtime Error

Solution code:
a = input()
a = [int(a)]
b = a[1]*a[2]
if b >= a[0]:
  print('Yes')
elif b < a[0]:
  print('No')

Submission status: Runtime Error

Solution code:
a = int([input()])
b = a[1]*a[2]
if b >= a[0]:
  print('Yes')
elif b < a[0]:
  print('No')

Submission status: Runtime Error

Solution code:
d=input(int(''))
t=input(int(''))
s=input(int(''))

if d*s<=t:
    print("Yes")
elif d*s>=t:
    print("No")

Submission status: Runtime Error

Solution code:
D = int(input())
T = int(input())
S = int(input())
if D*S <= T:
  print("Yes")
if D*S > T:
  print("No")

Submission status: Runtime Error

Solution code:

d=input(int())
t=input(int())
s=input(int())

if d*s<=t:
    print("Yes")
elif d*s>=t:
    print("No")

Submission status: Runtime Error

Solution code:
int d,t,s
d=input()
t=input()
s=input()

if d*s<=t:
    print("Yes")
elif d*s>=t:
    print("No")

Submission status: Runtime Error

Solution code:
a = int[input()]
b = a[1]*a[2]
if b >= a[0]:
  print('Yes')
elif b < a[0]:
  print('No')

Submission status: Runtime Error

Solution code:
D = int(input())
T = int(input())
S = int(input())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
  if D*S <= T:
  print("Yes")
  if D*S > T:
  print("No")

Submission status: Runtime Error

Solution code:
input('{} {} {}'.format(a,b,c))

if int(a/c)<=int(b):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a = [input()]
b = a[1]*a[2]
if b >= a[0]:
  print('Yes')
elif b < a[0]:
  print('No')

Submission status: Runtime Error

Solution code:
d=input()
t=input()
s=input()

if d*s<=t:
    print("Yes")
elif d*s>=t:
    print("No")

Submission status: Runtime Error

Solution code:
x=input('{} {} {}'.format(a,b,c))

if int(a/c)<=b:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
D = input()
T = input()
S = input()
1<=D<=10000
1<=T<=10000
1<=S<=10000
if D<=T*S:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
d = input()
D = int("d")
t = input()
T = int("t")
s = input()
S = int("s")
if T*S>=D:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
d = input()
t = input()
s = input()
if t*s>=d:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
D = input()
T = input()
S = input()
1 <= D <= 10000
1 <= T <= 10000
1 <= S <= 10000
if D <= T*S:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
d = int(input())
t = int(input())
s = int(input())
if t * s >= d:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
D = int(input())
T = int(input())
S = int(input())

if D <= T*S:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
D = int(input())
T = int(input())
S = int(input())

if D/S <= T:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
S = input()
T = input()

res = len(T)
for i in range(len(S)) :
    for j in range(i,len(S)) :
        if (S[i:j] in T) and (i>=T.index(S[i:j])) :
            diff = len(T) - len(S[i:j])
        if res>=diff :
            res = diff

print(res)

Submission status: Runtime Error

Solution code:
S = input()
T = input()

min = 100000
for i in range(len(S)) :
    for j in range(len(S),i-1,-1) :
        if (S[i:j] in T) :
            if (min > len(T) - len(S[i:j])) and (i >= T.index(S[i:j]) and j<=len(T)-T.index(S[i:j]) ) :
                min = len(T) - len(S[i:j])

print(min)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))

result= 0

for j in range(0,n):
  result += a[j]*sum(a[j+1:n])

print(result%(10**9+7))

Submission status: Runtime Error

Solution code:
d, t, s = map(int, input().split())
if d > t * s:
　print('no')
if d <= t * s:
　print('yes')

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
V=[]
for _ in range(M):
    a,b=map(int,input().split())
    f=True
    for t in V:
        if a in t and b not in t:
            f=False
            t.append(a)
            break
        if a in t and b not in t:
            f=False
            t.append(b)
            break
    if f:
        V.append((a,b))
if M == 0:
    print(1)
else:
    print(max(map(len,V)))

Submission status: Runtime Error

Solution code:
[D T S] = [int(i) for i in input().split()]
if D <= T * S:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
d=input()
arr = [int(d) for i in d.split()]

t1 = arr[0]/arr[-1]
if t1<= arr[1]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
d,t,s =int(input()),int(input()),int(input())
t1 = d/s
if t1<= t:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
d,t,s =int(input()),(input()),int(input())
t1 = d/s
if t1<= t:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
d,t,s = input().split(" ")

if d <= int(t)*int(s):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
d,t,s=int(input())
if S*t >= d:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N=input()
A=map(int,input().split(' '))
summed=0
for i in range(0,N):
	for j in range(i+1,N):
		sumed+=A[i]*A[j]
MOD=10**9+7
print(sumed%MOD)

Submission status: Runtime Error

Solution code:
def get_primes(n):
    max_p = int(n ** 0.5)
    p = 0 # 素数
    pl = []  # 素数リスト
    el = [i for i in range(2, n + 1)]  # 探索リスト
    while p <= max_p:
        nxt = []
        p = el[0]
        pl.append(p)
        for e in el:
            if e % p == 0:
                # D[e] = p
                pass
            else:
                nxt.append(e)
        el = nxt
    return pl


N = int(input())
a = list(map(int, input().split()))

is_pc = True
is_sc = True

p_list = get_primes(N)
for p in p_list:
    t = [int(x % p == 0) for x in a]
    s = sum(t)
    if s >= 2:
        is_pc = False
    if s == N:
        is_sc = False
        break
if is_pc:
    print('pairwise coprime')
elif is_sc:
    print('setwise coprime')
else:
    print('not coprime')

Submission status: Runtime Error

Solution code:
n = list(map(int,input().split(" "))
if (n[0]/n[2])<n[1]:
         print('YES')
else:
         print('NO)

Submission status: Runtime Error

Solution code:
D, T, S = map(int(),input().split())
print('YES') if T * S >= D else print('No')

Submission status: Runtime Error

Solution code:
d,t,s = map(int,input().split())
if d/s<=t:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
d,t,s = map(int,input().split())
if d/s<=t:
  print(Yes)
else:
  print(no)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7
D,T,E = input().split()
n= int(D)

print(a)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)
print(5)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in np.arange(3,n+1):
    arr[0,i] = 1

for i in np.arange(1,n+1):
    sum_ = 0
    for j in np.arange(3*i,n+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= n + 1:
            break
        arr[i,j+3] = sum_

ans = 0
for i in range(n+1):
    ans += arr[i,n]
    ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0
    if 3*i > n+1: 
        break
    for j in range(3*i,n+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= n + 1:
            break
        arr[i,j+3] = sum_

ans = 0
for i in range(n+1):
    ans += arr[i,n]
    ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0
    for j in range(3*i,n+1):
        sum_ += arr[i-1,j]

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0
    for j in range(3*i,n+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= n + 1:
            break

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0
    for j in range(3*i,n+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= n + 1:
            break
        arr[i,j+3] = sum_

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = input().split()
n= int(D)

arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0
    for j in range(3*i,n+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= n + 1:
            break
        arr[i,j+3] = sum_

ans = 0
for i in range(n+1):
    ans += arr[i,n]
    ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np
 
MOD = 10**9+7
 
D,T,E = int(input().split())
n= int(D)
arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

D,T,E = int(input().split())
n= int(D)
arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0
    for j in range(3*i,n+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= n + 1:
            break
        arr[i,j+3] = sum_

ans = 0
for i in range(n+1):
    ans += arr[i,n]
    ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

n = int(input())
arr = np.zeros((n+1,n+1),dtype=np.int16)
for i in range(3,n+1):
    arr[0,i] = 1

for i in range(1,n+1):
    sum_ = 0
    for j in range(3*i,n+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= n + 1:
            break
        arr[i,j+3] = sum_

ans = 0
for i in range(n+1):
    ans += arr[i,n]
    ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np

MOD = 10**9+7

N = int(input())
arr = np.zeros((N+1,N+1),dtype=int)
for i in range(3,N+1):
    arr[0,i] = 1

for i in range(1,N+1):
    sum_ = 0
    for j in range(3*i,N+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= N + 1:
            break
        arr[i,j+3] = sum_

ans = 0
for i in range(N+1):
    ans += arr[i,N]
    ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
import sys
import numpy as np

def dump(x):
    print(x, file=sys.stderr)


MOD = 10**9+7

N = int(input())
arr = np.zeros((N+1,N+1),dtype=int)
for i in range(3,N+1):
    arr[0,i] = 1

for i in range(1,N+1):
    sum_ = 0
    for j in range(3*i,N+1):
        sum_ += arr[i-1,j]
        sum_ %= MOD
        if j+3 >= N + 1:
            break
        arr[i,j+3] = sum_

# dump(arr)

ans = 0
for i in range(N+1):
    ans += arr[i,N]
    ans %= MOD
print(ans)

Submission status: Runtime Error

Solution code:
import sys,itertools,collections,bisect
from collections import deque,Counter,defaultdict
from heapq import heappush,heappop,heapify
read=sys.stdin.readline
sys.setrecursionlimit(10**6)

MOD=10**9+7
N=int(input())
A=list(map(int,input().split()))
cum=[0]*(N+1)
for i in range(N):
    cum[i+1]=(cum[i]+A[i])%MOD

ans=0
for i in range(N):
    res=(cum[N]-cum[i+1]+MOD)%MOD*A[i]%MOD
    ans=(ans+res)%MOD
print(ans)

Submission status: Runtime Error

Solution code:
//////// Don't_be_late 
// https://atcoder.jp/contests/abc177/tasks/abc177_a
// date: 2020-08-29T21:00:28.777315
// memo: 

//<editor-fold desc="my macro">

#include<bits/stdc++.h>
#ifdef LOCAL
    #include<my/dump.h>
#else
    #define dump(...) 42 
    #define dumpi(x) 42 
#endif

typedef long long ll;
using namespace std;

#define repe(x, a) for(auto& (x) : (a))
#define _overload3(_1, _2, _3, name, ...) name
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rep3(i, a, b) for(ll i=a, i##_len=(b);i<i##_len;i++)
#define _rep2(i, n) _rep3(i,0,n)
#define repd(...) _overload3(__VA_ARGS__,_repd3,_repd2,)(__VA_ARGS__)
#define _repd3(i, a, b) for(ll i=b-1, i##_len=(a);i>=i##_len;i--)
#define _repd2(i, n) _repd3(i,0,n)
#define loop(...) _overload3(__VA_ARGS__,,_loop2,_loop1)(__VA_ARGS__)
#define _loop2(i, a) for(ll i=a;; i++)
#define _loop1(i) _loop2(i,0)

#define all(x) x.begin(),x.end()
#define SIZE(x) ((ll)(x).size())

#define F first
#define S second
#define vec vector
#define umap unordered_map
#define uset unordered_set

ll dx[4]={1,0,-1,0};
ll dy[4]={0,1,0,-1};

#define bit(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

#define inrange(x,start,stop) ((start) <= (x) && (x) < (stop))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

template <typename Cont, typename Func>
Cont fmap(const Cont &container, Func functor) {
    Cont result(container.size());
    std::transform(container.begin(), container.end(), result.begin(), functor);// [](int x){return x * 2;}
    return result;
}
template <typename Cont, typename Pred>
Cont filter(const Cont &container, Pred predicate) {
    Cont result;
    std::copy_if(container.begin(), container.end(), std::back_inserter(result), predicate);// [](int x){return x == 2;}
    return result;
}   

template<typename T, typename ...Args>
void ci(T& first, Args&... args) {
    ((cin >> first), ..., (cin >> args)); //C++17
}

template<char Sep, typename T, typename ...Args>
void print_seq(const T& first, const Args&... args) {
    ((cout << first), ..., (cout << Sep << args)); //C++17
}

void co(){ cout << endl; }
template<typename... Words>
void co(Words... words) {
    print_seq<' '>(words...);
    cout << endl;
}
#define coi(x) cout<<(x)<<" "

#define YES(n) cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
#define sankou(n,a,b) cout << ((n) ? (a) : (b) ) << endl

#define asrt(expr...) assert((expr))
//</editor-fold>

#define INF 1e19
#define MOD 1e9+7
#define MAXR 1e5

int solve() {
    ll D,T,S;
    ci(D,T,S);
//    co(D <= T * S );
    Yes(D <= T * S );
    return 0;

}

int main(){
    //入力の高速化用のコード
    //ios::sync_with_stdio(false);
    //cin.tie(nullptr);
    
    solve();
    return 0;
}

Submission status: Runtime Error

Solution code:
test

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))

sum=0
for i in range(N-1):
    for j in range(i+1,N):
        sum+=(A[i]*A[j])%(10**9+7)

print(sum%(10**9+7))

Submission status: Runtime Error

Solution code:
d, t, s = map(int, input().split( ))
if d/s <= t:
    print(Yes)
else:
    print(No)

Submission status: Runtime Error

Solution code:
d, t, s = map(int, input().split())
if s * t => d
    print(Yes)
else:
    print(No)

Submission status: Runtime Error

Solution code:
d, t, s = map(int, input().split())
if s * d => t
    print(Yes)
else:
    print(No)

Submission status: Runtime Error

Solution code:
d, t, s = map(int, input().split())
if d/s <= t:
    print(Yes)
else:
    print(No)