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:
N = int(input())
A = input()

a = list(map(int, A.split(" ")))

cur_ans = 0
for i in range(N-1):
    for j in range(i+1,N):
        #print(str(i) + " " + str(j))
        cur_ans += a[i]*a[j]
        cur_ans = cur_ans % (1000000000 + 7)

print(cur_ans)

Submission status: Runtime Error

Solution code:
if d<t*s:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
if d<t*s:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
if d < t*s:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
if d < t*s:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
if d <= t*s :
  print("Yes")
print("No")

Submission status: Runtime Error

Solution code:
d <= t*s

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if d > t * s :
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

Solution code:

d,t,s = map(int, input().split())
print('Yes' if d <= t*s else 'No")

Submission status: Runtime Error

Solution code:
D,T,S = map(int,input().split)

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

Submission status: Runtime Error

Solution code:
d = float(input())
t = float(input())
s = float(input())
 
if d / s < t:
  print('yes')
 
else:
  print('no')

Submission status: Runtime Error

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

if d / s < t:
  return 'yes'

else:
  return '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*T >= D:
  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:
D = int(input())
T = int(input())
S = int(input())

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

Submission status: Runtime Error

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

print("Yes" if s*t >= d else "No)

Submission status: Runtime Error

Solution code:
D=int(input())
T=int(input())
S=int(input())
print("YNeos"[D/S>=T::2])

Submission status: Runtime Error

Solution code:
D,T,S = map(int, input().split())

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
D,T,S = map(float,raw_input().split())
def intime(D,T,S):
  if D<=T*S:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:
D,T,S = map(int, input().split())


if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x,y,z = int(input().split())
D=x
T=y
S=z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x,y,z = int(input().split())
int D=int x
int T=int y
int S=int z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
input().split()

x,y,z = input().split()
D=int x
T=int y
S=int z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x,y,z = map(int, input().split())
D=int x
T=int y
S=int z

if T-D/S>= 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x,y,z = input()

D=int x
T=int y
S=int z

if T-D/S>= 0
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
x,y,z = input()

D=int x
T=int y
S=int z

if T-D/S>= 0
    print("Yes")
  else print("No")

Submission status: Runtime Error

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


if T-D/S >= 0
	print("Yes")
  
  else print("No")

Submission status: Runtime Error

Solution code:
D,T,S = map(int , input().split().split())

if D > S * T:
  print("no")
  
else:
  print("yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy
N=int(input())
A=input()
A=A.split()
B=[]
for i in range(N):
  A[i]=int(A[i])

  
a=numpy.cumsum(A)
b=0
for j in range(N):
  b+=A[j]*(a[N-1]-a[j])
 
  
MOD=1000000007  
print(b%MOD)

Submission status: Runtime Error

Solution code:
num = int(input())
input_line = input().split()

num_list = [int(input_line[i]) for i in range(num)]
law = 10 ** 9 + 7
sigma = 0
for i in range(num):
	num_a = num_list[i]
	temp_sum = 0
	for j in range(i+1,num):
		temp_sum += num_list[j]
    	
    
	sigma += num_a * temp_sum

sigma %= law
print(sigma)

Submission status: Runtime Error

Solution code:
from collections import defaultdict

N, M = map(int, input().split())
friend_info = [list(map(int, input().split())) for _ in range(M)]

relation_dict = {}
for person1, person2 in friend_info:
    add_flag = False
    for k, v in relation_dict.items():
        if((person1 in v) or (person2 in v)):
            relation_dict[k].add(person1)
            relation_dict[k].add(person2)
            add_flag = True
            break
    if(add_flag == False):
        new_key = str(len(relation_dict)+1)
        relation_dict[new_key] = {person1, person2}

max_group = max([len(relation) for relation in relation_dict.values()])

print(max_group)

Submission status: Runtime Error

Solution code:
from collections import defaultdict

N, M = map(int, input().split())
friend_info = [list(map(int, input().split())) for _ in range(M)]

relation_dict = {}
for person1, person2 in friend_info:
    add_flag = False
    for k, v in relation_dict.items():
        if((person1 in v) or (person2 in v)):
            relation_dict[k].add(person1)
            relation_dict[k].add(person2)
            add_flag = True
            break
    if(add_flag == False):
        new_key = str(len(relation_dict)+1)
        relation_dict[new_key] = {person1, person2}

max_group = max([len(relation) for relation in relation_dict.values()])
print(max_group)

Submission status: Runtime Error

Solution code:
long_str = input()
short_str = input()
short_list = list(short_str)
 
long_len = len(long_str)
short_len = len(short_str)
iter_num = long_len - short_len + 1
 
max_count = 0
for i in range(iter_num):
  tmp = 0
  obj_list = list(long_str[i:(short_len+i)])
  for s, o in zip(short_list, obj_list):
    tmp += int(s == o)
  max_count = max(max_count, tmp)

print(short_len - max_count)

Submission status: Runtime Error

Solution code:
S, T = input(), input()
ans = len(T)
for i in range(len(S)-len(T)+1):
    tmp = 0
    for j in range(len(T)):
        if S[i+j] != T[j]:
            tmp += 1
    ans = min(ans, tmp)
print(ans)

Submission status: Runtime Error

Solution code:
D,T,S=map(int,input().split())
if S*T<=D :
    print("Yes")
    elif :
        print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
d, t, s = map(int, inport().split())

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

Submission status: Runtime Error

Solution code:
d, t, s = map(int, inport().split())

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:
int=D,T,S

D=input()
T=input()
S=input()

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

else:
   print("No")

Submission status: Runtime Error

Solution code:
int=D,T,S

D=input()
T=input()
S=input()

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

else:
   print("No")

Submission status: Runtime Error

Solution code:
int=D,T,S

D=input()
T=input()
S=input()

if D < T * S:
   print(Yes)

else:
   print(No)

Submission status: Runtime Error

Solution code:
int=D,T,S

D=input()
T=input()
S=input()

if(D < T*S)
   print(Yes)

if(D > T*S)
   print(No)

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
a = (sum(A)**2)
b =  sum([(a**2) for a in A])
print(((a-b)%(10**9+7))//2)

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())
print("Yes" if D/S<=T else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

travel_time = D * S
if travel_time <= T:
  print "yes"
  else: print "no"

Submission status: Runtime Error

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

travel_time = D * S
if travel_time <= T:
  print "yes"
  else: print "no"

Submission status: Runtime Error

Solution code:
D = int(input())
T = int(input())
S = int(input())
if D/S - T >0:
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
re = 0
re2 = 0

for i in range(n):
    re += a[i]*sum(a[i+1:])
    #for m in range(n-i-1):
        #re = a[i]*a[i+m+1]
        #re2 += re

ans = re %1000000007
print(ans)

Submission status: Runtime Error

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

ans = D / S

if ans < T:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

if (D/S <= T):
  print("OK")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
a, b, c = split(int(input()))
if a / c <= b:
  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:
d = int(input())
t = int(input())
s = int(input())

if d/s <= s:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
re = 0
re2 = 0

for i in range(n):
    for m in range(n-i-1):
        re = a[i]*a[i+m+1]
        re2 += re

ans = re2 %1000000007
print(ans)

Submission status: Runtime Error

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


for i in range(tlen, 1):
    for k in range(0, tlen+1-i):
        Tinclude = T[k:i]
        print(tlen-i)
        break

Submission status: Runtime Error

Solution code:
import sys

try:
    d = int(input('D: '))
    t = int(input('T: '))
    s = int(input('S: '))
except ValueError:
    print('エラー：整数以外を入力しないでください')
    sys.exit(1)

if 1 <= d <= 10000 and 1 <= t <= 10000 and 1 <= s <= 10000:
    take_time = d / s
    if take_time <= t:
        print("Yes")
    else:
        print("No")
else:
    print('エラー：各入力は1～10000までの整数です')

Submission status: Runtime Error

Solution code:
a = input()
b = input()
ind = []
for i in range(len(a)-len(b)):
  if a[i] == b[0]:
    ind.append(i)

ans = len(b)
for i in range(len(ind)):
  count = 0
  for j in range(len(b)):
    if a[ind[i]+j]!=b[j]:
      count += 1
  ans = min(ans,count)

print(ans)

Submission status: Runtime Error

Solution code:
s=list(input())
t=list(input())
result=0
#count=0
for i in range(len(s)-len(t)+1) :
    count=0
    for n in range(len(t)):
        if s[i+n]==t[n]:
            count += 1
        #s[i:i+len(t)] == t
    
    if count>result:
        result=count


print(len(t)-result)

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:
def ans():
    if t==0:
        return "N0"
    if d/s < = t:
        return "Yes"
    else:
        return "No"
        
d, t, s = map(int, input().split())
print(ans())

Submission status: Runtime Error

Solution code:
d, t, s = map(int, input())
t_d = t * d
if td >= d:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
string_list = split(input())
D = int(string_list[0])
T = int(string_list[1])
S = int(string_list[2])
kyori = T * S
if D<=kyori:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

if (D/S)<=T:
    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:
D = int(input())
T = int(input())
S = int(input())
if D / S <= T:
    print(Yes)
else:
    print(No)

Submission status: Runtime Error

Solution code:
import sys

N=int(input())
A = list(map(int,input().split()))
 
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

if gcd_list(A) > 1:
    print("not coprime")
    sys.exit()

D = [i for i in range(max(A)+1)] #iを割り切る最小の素数を格納
p = 2
 
while(p*p<=max(A)):
    if D[p]==p:
        for i in range(2*p,max(A)+1,p):
            if D[i]==i:
                D[i]=p
 
    p+=1
    
prime = set()
for a in A:
    tmp=D[a]
    L=set()
    while(a>1):
        a=a//tmp
        L.add(tmp)
        tmp=D[a]

    for l in L:
        if l in prime:
            print("setwise coprime")
            sys.exit()
        else:
            prime.add(l)

print("pairwise coprime")

Submission status: Runtime Error

Solution code:
import sys

N=int(input())
A = list(map(int,input().split()))
 
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

if gcd_list(A) > 1:
    print("not coprime")
    sys.exit()

D = [i for i in range(max(A)+1)] #iを割り切る最小の素数を格納
p = 2
 
while(p*p<=max(A)):
    if D[p]==p:
        for i in range(p*p,max(A)+1,p):
            if D[i]==i:
                D[i]=p
 
    p+=1
    
prime = set()
for a in A:
    tmp=D[a]
    L=set()
    while(a>1):
        a=a//tmp
        L.add(tmp)
        tmp=D[a]

    for l in L:
        if l in prime:
            print("setwise coprime")
            sys.exit()
        else:
            prime.add(l)

print("pairwise coprime")

Submission status: Runtime Error

Solution code:
m = 10**9 + 7
n = input()
a = list(map(int,input().split()))
ans = 0

for i in range (len(a)):
  for j in range (i+1,len(a)):
    ans += a[i]*a[j]

ans = ans%m

print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

if d == 0:
    print ('error')
    
elif t == 0:
    print ('error')
        
elif s == 0:
    print ('error')

else:
    
    if (s*t) >= d :
        print ('Yes')
    
    else:
        print ('No')

Submission status: Runtime Error

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

    
    if (s*t >= d):
        print ('Yes')
    
    else:
        print ('No')

Submission status: Runtime Error

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

    
    if s*t >= d:
        print ('Yes')
    
    else:
        print ('No')

Submission status: Runtime Error

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

    
    if s*t >= d:
        print ('Yes')
    
    else:
        print ('No')

Submission status: Runtime Error

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

if d == 0:
    print ('error')
    
elif t == 0:
    print ('error')
        
elif s == 0:
    print ('error')

else:
    
    if s*t >= d:
        print ('Yes')
    
    else:
        print ('No')

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
 
############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))#might need to remove the -1
def invr():
    return(map(int,input().split()))

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

Submission status: Runtime Error

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

if d == 0:
    print ('error')
    
elif t == 0:
    print ('error')
        
elif s == 0:
    print ('error')

else:
    
    if (s*t) >= d :
        print ('Yes')
    
    else:
        print ('No')

Submission status: Runtime Error

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


if (s*t) >= d :
    print ('Yes')
    
else:
    print ('No')

Submission status: Runtime Error

Solution code:
d=float(input())
t=float(input())
s=float(input())
    
if (int(d/t)) <= s:
    print ('Yes')
    
else:
    print ('No')

Submission status: Runtime Error

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


if (d/t) <= s:
    print ('Yes')
    
else:
    print ('No')

Submission status: Runtime Error

Solution code:
x = int(input())
if x >= 30:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
D=input()
T=input()
S=input()
y=int(T)*int(S)
if(int(D)<=int(y)):
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
def compare(a,b):
  res = 0
  for x,y in zip(a,b):
    if x == y:
      res += 1
  return res

s,t = map(int, input().split())
len_t = len(t)
ans = 0
for i in range(len(s)-len(t)+1):
  ans = max(ans,compare(s[i:i+len_t],t))
print(ans)

Submission status: Runtime Error

Solution code:
D, T, S = map(input().split())

print('Yes' if D <T*S else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D,T,S=map(int,input().split())
if D<T*S:
  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:
D,T,S map(int,input().split())
if D<S*T
 print(Yes)
else
 print(No)

Submission status: Runtime Error

Solution code:
strS = input()
strT = input()

maxRange = 0
l = 0
while l <= (len(strS)-len(strT)):
    m = 0
    count = 0
    while m < (len(strT)):
        if strS[l+m] != strT[m]:
            count += 1
        m += 1
    if maxRange > count:
        maxRange = count
    l += 1

print(maxRange)

Submission status: Runtime Error

Solution code:
strings = input().splitlines()

# 一致している数の最大値を取得する。
# そして、その一致している数と、Tの数を比較する。足りない文字数を補うと良い

strS = list(strings[0])
strT = list(strings[1])

maxRange = 0
l = 0
while l < (len(strS)-len(strT)):
    m = 0
    count = 0
    while m < (len(strT)):
        if strS[l+m] == strT[m]:
            count += 1
        m += 1
    if maxRange < count:
        maxRange = count
    l += 1
print(len(strT)-maxRange)

Submission status: Runtime Error

Solution code:
D T S = map(int, input().split(" "))

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

Submission status: Runtime Error

Solution code:
n = int(input())  # nは入力回数
num_list = [int(input()) for _ in range(n)]
 
a = num_list[0] / num_list[2]

if a <= num_list[1]:
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
n = int(input())  # nは入力回数
num_list = [int(input()) for _ in range(n)]
 
arriving_tm = num_list[0] / num_list[2]
if arriving_tm <= num_list[1]:
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
待ち合わせ場所は高橋君の家から 
D
 メートル離れた地点であり、待ち合わせの時刻は 
T
 分後です。

高橋君は今から家を出発し、分速 
S
 メートルで待ち合わせ場所までまっすぐ移動します。

待ち合わせに間に合うでしょうか？

n = int(input())  # nは入力回数
num_list = [int(input()) for _ in range(n)]

arriving_tm = num_list[0] / num_list[2]
if arriving_tm <= num_list[1]:
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
args = sys.argv
D = args[1]
T = args[2]
S = args[3]

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

Submission status: Runtime Error

Solution code:
import collections
n, m = map(int, input().split())
par = [i for i in range(0, n + 1)]
# print(par)
s = list()
"""
# union find(parには0も入れているので、par[1]=1になる)
def find(x):
    if par[x] == x:
        return x
    else:
        par[x] = find(par[x])
        return par[x]
"""


def find(x):

    while par[x] != x:
        tmp = par[x]
        par[x] = par[par[x]]
        x = par[x]

    return x


def union(x, y):
    x = find(x)
    y = find(y)
    if x == y:
        return 0
    else:
        par[x] = y


# 各要素をunionする
for j in range(m):
    a, b = map(int, input().split())
    union(a, b)

# 1～nの親を探してsに入れていき、一番多い親を答えにする
for k in range(1, n + 1):
    s.append(find(k))
# print(s)
c = collections.Counter(s)
print(max(c.values()))

Submission status: Runtime Error

Solution code:
m, t, s = input().split()
if m // s <= t:
  print('YES')
else:
  print('No')

Submission status: Runtime Error

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

arrival = d/s

if arrival > t:
  print('no')
 else:
   print('yes')

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
if b*c>=a:
  print ("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s=input()
t=input()
a = len(s)
b = len(t)
l = []
for i in range(a-b+1):
    cnt = 0
    c = s[i,i+t]
    for x, y in zip(c, t):
        if x != y:
            cnt +=1
    l.append(cnt)
print(min(l))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

tmp = d/s

if tmp <= t:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
# -*- coding:utf-8 -*-

def prime_factor(n):
    """因数分解して因数のみを取得する"""
    if n <= 1: return set()

    ans = set()
    i = 2
    while i*i <= n:
        while n%i == 0:
            if not i in ans:
                ans.add(i)
            n //= i
        i += 1

    if n != 1:
        ans.add(n)
    return ans

def solve():
    import sys
    N = int(sys.stdin.readline())
    As = list(map(int, sys.stdin.readline().split()))

    pf_sets = []
    for a in As:
        pf_set = prime_factor(a)
        pf_sets.append(pf_set)


    # pairwiseにできる
    is_pairwise = True
    a_set = set()
    for pf_set in pf_sets:
        if len(a_set & pf_set) != 0:
            # すでに因数が存在するならpairwiseになれない
            is_pairwise = False
            break
        a_set |= pf_set

    if is_pairwise:
        print("pairwise coprime")
        return

    # setwiseにできるかを調べる
    is_setwise = False
    base_pf_set = pf_sets[0]
    for pf_set in pf_sets[1:]:
        base_pf_set &= pf_set

        if len(base_pf_set) == 0:
            is_setwise = True
            break

    if is_setwise:
        print("setwise coprime")
        return

    print("not coprime")

if __name__ == "__main__":
    solve()

Submission status: Runtime Error

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

if s*t<d:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
D, T, S = list(map(input().split()))

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

Submission status: Runtime Error

Solution code:
# input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq  # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprint
import itertools

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""

def factorization(n):
    arr = []
    temp = n
    if n == 1:
        return arr

    for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


# a^n
def power(a, n, mod):
    x = 1
    while n:
        if n & 1:
            x *= a % mod
        n >>= 1
        a *= a % mod
    return x % mod


# n*(n-1)*...*(l+1)*l
def kaijo(n, l, mod):
    if n == 0:
        return 1
    a = n
    tmp = n - 1
    while (tmp >= l):
        a = a * tmp % mod
        tmp -= 1
    return a

# Union Find
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# 約数生成
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors

inf = 10 ** 18
mod = 10 ** 9 + 7

_INPUT = """\
1000 15 80
"""

def main(*, input=input):
    sr = lambda: input()
    ir = lambda: int(sr())
    lr = lambda: list(map(int, sr().split()))

    d,t,s = lr()
    if s*t >= d:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    import io, sys

    sys.stdin = io.StringIO()

    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a=str(input())
b=str(input())

ans=[]
ans.append(len(b))
for i in range(len(a)-len(b)+1):
    dif=0
    k=a.find(b[i])
    for j in range(len(b)):
        if a[i+j]!=b[j]:
            dif+=1
            ans.append(dif)
print(min(ans))

Submission status: Runtime Error

Solution code:
import math
n = int(input())
lst = list(map(int,input().split()))

l = lst[0]
g = lst[0]
pair_coprime = True
set_coprime = False
for i in range(1,n):
  if set_coprime == False:
    g = math.gcd(g,lst[i])
    if g == 1:
      set_coprime = True
      
  if pair_coprime == True:
    g_l = math.gcd(l,lst[i])
    if g_l == 1:
      l = l*lst[i]//g_l
    else:
      pair_coprime = False
    
if set_coprime == False:
  print('not coprime')
  
elif pair_coprime == False:
  print('setwize coprime')
else:
  print('pairwize coprime')

Submission status: Runtime Error

Solution code:
nums=input().split()
t=int(nums[1])/int(nums[3])
if t<=int(nums[2]):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
nums=input().split()
t=int(nums[1])/int(nums[3])
if t<int(nums[2]):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
nums=input().split()
t=int(nums[1])/int(nums[2])
if t<int(nums[3]):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
D, T, S = map(int, input().split())

if not __debug__:
	print("Yes" if D < T * S else "No")
else:
    1/0

Submission status: Runtime Error

Solution code:
import sys

assert sys.argv[1] == "ONLINE_JUDGE"

Submission status: Runtime Error

Solution code:
import sys

print(sys.argv[2])

Submission status: Runtime Error

Solution code:
import sys

print(sys.argv[3])

Submission status: Runtime Error

Solution code:
#from sys import stdin

#input = stdin.readline
#inputRstrip = stdin.readline().rstrip

#x = input().rstrip()
#n = int(input())

#a,b,c = input().split()
#a,b,c = map(int, input().split())

ST = [input() for i in range(2)]
S = ST[0]
T = ST[1]
ans = len(T)

for i in range(len(S) - len(T) + 1):
	count = len(T)
	for j in range(len(T)):
		if(T[j] == S[i + j]):
			count -= 1
	if(ans > count):
		ans = count
print(ans)

Submission status: Runtime Error

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

x = sum(A)
y = sum([A[i] ** 2 for i in range(N)])

print(((x ** 2 - y) // 2) % (10 ** 9 + 7))

Submission status: Runtime Error

Solution code:

from sys import stdin

input = stdin.readline().rstrip

#x = input().rstrip()
#n = int(input())

#a,b,c = input().split()
#a,b,c = map(int, input().split())

D,T,S = input().split()

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