TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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?

Submission attempts (in order):
x = list(input().split())
if x[0] / x[2] <= x[3]:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())
 
if a <= b * c:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())
if a / b <= c:
  print("Yes")
else:
  print("No")

x = list(map(int, input().split()))
if x[0] / x[2] <= x[3]:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())

if a <= b * c:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())
if (a / b) <= c:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())
if (a / c) <= b:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())

if a <= b * c:
  print("Yes")
else:
  print("No")

x = list(map(int, input().split()))
if x[0] / x[2] <= x[3]:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())
if a / c <= b:
  print('Yes')
else:
  print('No')

a, b, c = map(int, input().spulit())
if (a / c <= b):
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())
 
if a <= b * c:
  	print("Yes")
else:
  	print("No")

a, b, c = map(int, input().spulit())
if a / c = b:
  print("Yes")
else:
  print("No")

a, b, c = input().split()
if a / c <= b:
  print("Yes")
else:
  print("No")


x = list(input().split())
if x[0] / x[2] <= x[3]:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())

if a <= b*c:
  print("Yes")
else:
  print("No")

a=input()
b=input()
c=input()

if a/c<b:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().spulit())
if a / c <= b:
  print("Yes")
else:
  print("No")

a, b, c = map(int, input().split())
 
if a <= b * c:
  	print("Yes")
else:
  	print("No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
from collections import Counter

class UnionFind:
    def __init__(self,num:int):
        self.r = [-1 for i in range(num)]
    def root(self,x:int):
        if(self.r[x] < 0):
            return x
        self.r[x] = self.root(self.r[x])
        return self.r[x]
    def unite(self,x:int,y:int):
        rx = self.root(x)
        ry = self.root(y)
        if(rx == ry):
            return False
        if(self.r[rx] > self.r[ry]):
            rx,ry = ry,rx
        self.r[rx] += self.r[ry]
        self.r[ry] = rx
        return True
    def size(self,x:int):
        return -self.r[self.root(x)]

N,M = map(int,input().split())
group = UnionFind(N)
for i in range(M):
    A,B = map(int,input().split())
    group.unite(A-1,B-1)
ans = 0
for i in range(N):
    ans = max(ans,group.size(i))
print(group.r)
print(ans)


from collections import Counter

class UnionFind:
    def __init__(self,num:int):
        self.r = [-1 for i in range(num)]
    def root(self,x:int):
        if(self.r[x] < 0):
            return x
        self.r[x] = self.root(self.r[x])
        return self.r[x]
    def unite(self,x:int,y:int):
        rx = self.root(x)
        ry = self.root(y)
        if(rx == ry):
            return False
        if(self.r[rx] > self.r[ry]):
            rx,ry = ry,rx
        self.r[rx] += self.r[ry]
        self.r[ry] = rx
        return True
    def size(self,x:int):
        return -self.r[self.root(x)]

N,M = map(int,input().split())
group = UnionFind(N)
for i in range(M):
    A,B = map(int,input().split())
    group.unite(A-1,B-1)
ans = 0
for i in range(N):
    ans = max(ans,group.size(i))
print(ans)


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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
inp_list = input().spilt()
if inp_list[0] / inp_list[1] <= 80:
    print("Yes") 
else:
    print("No")

inp_list = input().spilt()
if (inp_list[0] / inp_list[1]) <= 80:
    print("Yes") 
else:
    print("No")

inp_ = input()
imp_list = imp_.spilt()
if inp_list[0] / inp_list[1] <= 80:
    print("Yes") 
else:
    print("No")

inp = input()
inp_list = inp.split()
inp_list = [int(i) for i in inp_list] 
if inp_list[0] / inp_list[1] <= inp_list[2]:
    print("Yes") 
else:
    print("No")


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
AllInput = input("Enter Distance,Time Taken and Speed Separated by Space")
Para = AllInput.split()

if (int (Para[0])/int (Para[1])) <= int (Para[2]):
    print("Yes")
else:
    print("NO")

AllInput = input("Enter Distance,Time Taken and Speed Separated by Space")
D,T,S= map(int,AllInput.split())

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

AllInput = input("Enter Distance,Time Taken and Speed Separated by Space")
D,T,S= map(int,AllInput.split())
print("Distance Needed =", D)
print("Distance Covered =", (S*T))

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

AllInput = input("Enter Distance,Time Taken and Speed Separated by Space")
Para = AllInput.split()

if ((float(Para[0])/float(Para[1])) <= float(Para[2]):
    print("Yes")
else:
    print("NO")


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

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

AllInput = input("Enter Distance,Time Taken and Speed Separated by Space")
Para = AllInput.split()

if (float(Para[0])/float(Para[1])) <= float(Para[2]):
    print("Yes")
else:
    print("NO")


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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = input()
a_list = input().split(" ")

b = [int(a) for a in a_list]
max = 10**9 + 7

sum = 0
for i in range(0, len(b)-1):
  for j in range(i+1, len(b)):
    sum += b[i] * b[j]
    sum = sum % max
print(sum)



import sys

d = sys.argv[1]
t = sys.argv[2]
s = sys.argv[3]

if s * t < d:
  return 'No'
else:
  return 'Yes'


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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D, T, S = tuple(int(x) for x in input().split())
if S*T <= D:
  print('Yes')
else:
  print('No')

D, T, S = tuple(int(x) for x in input().split())
if S*T >= D:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
a = list(map(int, input().split()))

total = 0
for i in range(n - 1):
  temp = []
  for j in range(i + 1, n):
    temp.append((a[i]*a[j]) % (10**9 + 7))
  total += sum(temp) % (10**9 + 7)

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

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

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s = map(int,input().split())
if d//t ==s:
  print('Yes')
else:
  print('No')

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
d, t, s=list(map(int,input().split()))

x=s*t

if x>=d:

	print('Yes')else:

	print('No')

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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))

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
input()

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
d=int(input())
t=int(input())
s=int(input())


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



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

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

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=map(int,input().split())
if d//s==t:
  print('Yes')
else: print('No')


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

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
  GNU nano 4.8                                                                a.py                                                                 変更済み  
def read():
    D, T, S = map(int, input().split(' '))
    return D, T, S

def func(D, T, S):
    return D / S <= T


if __name__ == '__main__':
    D, T, S = read()
    print('Yes' if func(D, T, S) else 'No')


def read():
    D, T, S = map(int, input().split(' '))
    return D, T, S

def func(D, T, S):
    return D / S <= T


if __name__ == '__main__':
    D, T, S = read()
    print('Yes' if func(D, T, S) else 'No')


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
#!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param

# N = int(sys.stdin.readline())
# INF = float("inf")
import math,sys

n = int(sys.stdin.readline())
a = tuple(map(int,sys.stdin.readline().split()))
#n = int(input())
#a = list(map(int,input().split()))
g = math.gcd(a[0],a[1])
for i in range(2,n):
    g = math.gcd(g,a[i])
M = max(a)
acc = a[0]
for i in range(n):
    acc = math.gcd(acc,a[i])
if acc != 1:
    print("not coprime")
    exit()

LIMIT=max(a)
minPrime = [0]*(LIMIT+1)
minPrime[1] = 1
def make():
    for i in range(2,LIMIT+1):
        if minPrime[i] == 0:
            minPrime[i] = i
            #print(i)
            for j in range(i+i,LIMIT+1,i):
                #print(i,j)
                if minPrime[j] == 0:
                    minPrime[j] = i
make()
def factrial(N):
     ret = []
     while minPrime[N] != N:
         ret.append(minPrime[N])
         N = N//minPrime[N]
     if N != 1:
         ret.append(N)
     return ret

judge = set([])

for e in a:
    asf = set(factrial(e))
    if judge & asf != set():
        print("setwise coprime")
        exit()
    #judge |= asf
    judge = judge | asf #too slow
print("pairwise coprime")

#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param

# N = int(sys.stdin.readline())
# INF = float("inf")
import sys,collections

D,T,S = map(int,sys.stdin.readline().split())

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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
#!/usr/bin/python3
 
cmdvar_numlist=input()
cmdvar_spritd=cmdvar_numlist.split()
D,T,S=list(map(int,cmdvar_spritd))

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

#!/usr/bin/python3
 
cmdvar_numlist=input()
cmdvar_spritd=cmdvar_numlist.split()
D,T,S=list(map(int,cmdvar_spritd))

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

#!/usr/bin/python3
 
cmdvar_numlist=input()
cmdvar_spritd=cmdvar_numlist.split()
D,T,S=list(map(int,cmdvar_spritd))

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):


r = 0

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

# print(r)



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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s = map(int, input().split())  
time = d/s
if time >= t:
    print("Yes")
else:
    print("No")

d,t,s = map(int, input().split())  
time = d/s
if time > t:
    print("Yes")
else:
    print("No")

d,t,s = map(double, input().split())  
time = d/s
if time > t:
    print("Yes")
else:
    print("No")

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

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
num = map(lambda x: int(x), input().split())

if num[0]/num[2]<=num[1]: print('Yes')
else: print('No')

num = list(map(lambda x: int(x), input().split()))

if num[0]/num[2]<=num[1]: print('Yes')
else: print('No')

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d, t, s = map(int, input().split())
if d / s > t:
  print('Yes')
else:
  print('No')

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= T:
    print("Yes")
else:
    print("No")

#template
def inputlist(): return [int(j) for j in input().split()]
#template
"""
H,W = inputlist()
st = inputlist()
gl = inputlist()
maze = ['0']*H
for i in range(H):
    maze[i] = list(input())
table = [[10**9+7]*W for _ in range(H)]

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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
data=list(map(int,input().split()))
if data[0]/data[1]<=data[2]:
    print('yes')
else:
    print('No')

data=list(map(int,input().split()))
if data[0]/data[1]<=data[2]:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import sys
import numpy as np

readline = sys.stdin.readline
read = sys.stdin.read
MOD = 10**9 + 7

n = int(input())
a = np.array(readline().split(), dtype=np.uint64)
r = np.cumsum(a[::-1])[::-1]
r &= MOD
x = a[:-1] * r[1:]
x %= MOD
ans = int(np.sum(x) % MOD)
print(ans)


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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N=int(input())
A=list(map(int,input().split()))
mod=10**9+7
S=0
M=0
for i in A:
    S+=i
for i in A:
    S-=i
    M+=(S*i)%mod
print(M%mod)

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
class Solution:
  def solve(self, D, T, S):
    time = D/S
    if time <= T:
      return True
    else:
      return False

A = Solution()
D,T,S = map(int, input().split())
print(A.solve(D,T,S)
    

class Solution:
    def solve(self, D, T, S):
        time = D/S
        if time <= T:
            return 'Yes'
        else:
            return 'No'

if __name__ == '__main__':
    D, T, S = map(int, input().split())
    A = Solution()
    print(A.solve(D, T, S))

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d, t, s = map(int, input().split(" "))
ans = "yes" if d < t*s else "no"
print(ans)

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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
a = [input().split() for l in range(2)]
count = 0
N = int(a[0][0])
 
for i in range(N):
    for j in range(i):
        if i != j:
            count = (int(a[1][i])*int(a[1][j])) % 1000000007 + count
count = count % 1000000007
print(count)


D,T,S=(int(x) for x in input().split())
if D >S*T:
  print('no')
elif:
  print('yes')

D,T,S=(int(x) for x in input().split())
if D >S*T:
  print('no')
else:
  print('yes')


D,T,S=(int(x) for x in input().split())
if D >S*T:
  print('no')
else:
  print('yes')


D,T,S=(int(x) for x in input().split())
if D >S*T:
  print('No')
else:
  print('Yes')


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
data = input()
n = [int(x) for x in data]
if n[1] * n[2] < n[0]: print("No")
else print("Yes")


data = input()
n = [int(x) for x in data.split()]
if n[1] * n[2] < n[0]: print("No")
else: print("Yes")


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):

str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))  
#print(num) #D,T,S


if num[1] > (num[0]/num[2]):
    print("Yes\n\nIt takes",num[0]/num[2],"minutes to go",num[0],"meters to the place at a speed of",num[2],
    "meters per minute. They have planned to meet in",num[1],"minutes so he will arrive in time.")
elif num[1] == (num[0]/num[2]):
    print("Yes\n\nIt takes",num[0]/num[2],"minutes to go ",num[0],"meters to the place at a speed of",num[2],
    "meters per minute. They have planned to meet in",num[1],"minutes so he will arrive just on time.")
else:
    print("No\n\nHe will be late.")




d=float(input())
t=float(input())
s=float(input())


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



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

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

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




str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))  
#print(num) #D,T,S


if num[1] > (num[0]/num[2]):
    print("Yes")
elif num[1] == (num[0]/num[2]):
    print("Yes")
else:
    print("No")




Verdicts: Wrong Answer

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,x,t=map(int,input().split())
if n%x!=0:
    print((n//x+1)*t)
else:
    print((n//x)*t)

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
A = list(map(int ,input().split()))
MOD = 10**9+7

sum = 0
for i in range (N):
    sum += A[i]

ans = 0
for i in range(N):
    sum -= A[i]
    ans += (A[i] * sum) % MOD

ans = ans % MOD
print(ans)

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

TS = T * S

if D <= TS:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
for testcase in range(int(input())):
	D,T,S=map(int,input().split())
	speed=D/T
	if speed>=S:
		print('Yes')
	else:
		print('No')	

import math,sys,os,collections,functools
if(os.path.exists('input.txt')):
	sys.stdin=open('input.txt','r')
	sys.stdout=open('output.txt','w')
for testcase in range(int(input())):
	D,T,S=map(int,input().split())
	t=D/S
	if t<=T:
		print('Yes')
	else:
		print('No')	
		                                         

for testcase in range(int(input())):
	D,T,S=map(int,input().split())
	d=S*T
	if d>=D:
		print('Yes')
	else:
		print('No')	
		                                         

D,T,S=map(int,input().split())
t=D/S
if t<=T:
  print('Yes')
else:
  print('No')	

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d = int(input())
t = int(input())
s = int(input())
if(d <= t*s):
    print("Yes")
else:
    print("No")    


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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D, T, S = input().split()
d = float(D)
t = float(T)
s = float(S)

a = float(d / s)
print(a)


if a > t:
    print("No")
else:
    print("Yes")


D, T, S = input1().split()
D=int(D)
T=int(T)
S=int(S)

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

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
import numpy as np

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

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

import numpy as np

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

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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)

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N=int(input())
lst=list(map(int,input().split()))
A=0
for i in range(N-1):
  for j in range(i+1,N):
    A+=(lst[i]%(10**9+7))*(lst[j]%(10**9+7))
print(A%(10**9+7))

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D,T,S = map(int,input().split())
result = D / S
if T <= result :
  print('Yes')
else:
  print('No') 

D,T,S = map(input().split())
result = D / S
if T <= result :
  print('Yes')
else:
  print('No')  

D,T,S = map(int,input().split())
result = D / S
if T >= result:
  print('Yes')
else:
  print('No')

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=[int(x) for x in input().split(' ')]
if s*t<=d:
    print("Yes")
else:
    print("No")

d,t,s=[int(x) for x in input().split(' ')]
if s*t>=d:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=list(map(int,input().split()))
if d<=s*t:
  print("YES")
else:
  print("NO")

d,t,s=list(map(int,input()))
if d <= (s*t):
  print("YES")
elif:
  print("NO")

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
S = input()
T = input()

min_count = len(T)
for s in range(len(S) - len(T) + 1):  # T cannot exceed the length of S
    matched = 0
    for i in range(len(T)):
        # print(f'S[{s + i}] == T[{i}]')
        if S[s + i] == T[i]:
            matched += 1
    count = len(T) - matched
    if count < min_count:
        min_count = count
print(min_count)

inputs = input().split()
D = int(inputs[0])
T = int(inputs[1])
S = int(inputs[2])

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
S = str(input())
T = str(input())
ans = 10000
for i in range(len(S)-len(T)+1):
    c = S[i:] 
    cnt = 0
    for j in range(len(T)):
        if str(T[j]) != str(c[j]):
            cnt += 1
    if cnt = 0:
        ans = 0
    elif  ans > cnt and cnt >=1:
        ans = cnt
print (ans)

S = str(input())
T = str(input())
ans = 10000
for i in range(len(S)-len(T)+1):
    c = S[i:] 
    cnt = 0
    for j in range(len(T)):
        if str(T[j]) != str(c[j]):
            cnt += 1
    if cnt = 0:
        ans = 0
    if  ans > cnt and cnt >=1:
        ans = cnt
print (ans)

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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D,T,S = map(float,raw_input().split())
def intime(D,T,S):
  if D<=T*S:
    print('Yes')
  else:
    print('No')

def InTimeFunc(D, T, S):
  if D <= T*S:
    print('Yes')
  else:
    print('No')
    

A, B, C = map(int, input().split())
if A <= B*C:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=intput().split()
d=int(d)
t=int(t)
s=int(s)
d1=s*t
if d<=d1:
  print("Yes")
else:
  print("No)


d,t,s=intput().split()
d=int(d)
t=int(t)
s=int(s)
d1=s*t
if d<=d1:
  print("Yes")
else:
  print("No")


d,t,s=intput().split()
d1=s*t
if d<=d1:
  print("Yes")
else:
  print("No)

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=(int(i) for i in input().split())
if(s*t==d):
  print("Yes")
else:
  print("No")

d,t,s=(int(i) for i in input().split())
if(s*t>=d):
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
list1 = list(map(int,input().split()))

mod = 10 ** 9 + 7
total = 0
y = sum(list1)

for i in range(0,n-1):
    x = y- sum(list1[:i+1])
    total += list1[i] * x % mod

total = total % mod
print(total)


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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D,T,S = input(int()),input(int()), input(int())

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

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

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

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

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

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

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

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

D = int(D)
T = int(T)
S = int(S)


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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=map(int,input().split())
if( t >=  d//s ):
  print("YES")
else:
  print("NO")

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
import numpy
n=input()
l=list(map(int, input().split()))
res=0
#print(f"le{len(l)}")
l.append(0)
l.reverse()
for i in range(len(l)): 
    print(l[len(l)-1-i],numpy.cumsum(l)[len(l)-i-2])
    res+=l[len(l)-1-i]*numpy.cumsum(l)[len(l)-i-2]
    
print(res%(10**9+7))
#print(res)

n=input()
l=list(map(int, input().split()))
res=0
#print(f"le{len(l)}")
for i in range(len(l)):
    for j in range(i+1,len(l)):
        res+=l[i]*l[j]
        #print(res)
print(res%(10**9+7))

d,t,s=map(int, input().split())
if d/s<=t:
  print("Yes")
elif:
  print("No")

import numpy
n=int(input())
l=list(map(int, input().split()))
res=0
l.append(0)
l.reverse()
cum=numpy.cumsum(l)
for i in range(n+1):
    res+=l[n-i]*cum[n-i-1]
print(res%(10**9+7))

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
import math

d, t, s = list(map(int, input().split()))

a = math.ceil(d / s)

if (a <= t):
    print("yes")
else:
    print("No")


import math

d, t, s = list(map(int, input().split()))

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


d, t, s = list(map(int, input().split()))

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=map(int,input().split())
if t*s<=d:
    print("Yes")
else:
    print("No")

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
from sys import stdin


stdin = io.StringIO(__INPUT)

D,T,S = [ int(x) for x in stdin.readline().rstrip().split()]

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

from sys import stdin


D,T,S = [ int(x) for x in stdin.readline().rstrip().split()]

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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D, T, S = map(int, input().split())

if D <= T * S:
  print("YES")
else:
  print("NO")

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
D,T,S=map(int,input())
if D*S>T :
 print("No")
else:
 print("Yes")

S=input()
T=input()
ans=[]
count=0
for i1 in range(len(S)-len(T)):
	for i2 in range(len(T)):
  		if S[i1+i2]==T[i2]:
          count++
    else:
    ans=ans.append(count)
    count=0
else:
	print(ans.max())

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

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D, T, S = map(int, input())
if D <= T * S:
  print('Yes')
else:
  print('No')

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
def probB():
    S = input()
    T = input()

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


def main():
    probB()


if __name__ == '__main__':
    main()


def probA():
    D, T, S = map(int, input().split())

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


def main():
    probA()


if __name__ == '__main__':
    main()


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
if S * T >= D:
  print('Yes')
else:
  print('No')

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

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
d, t, s = map(int, input().split())
if t >= d / s:
    print('yes')
else:
    print('no')

d, t, s = map(int, input().split())
if t >= d / s:
    print('yes')
else:
    print('no')

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
d,t,s=map(int,input().split())
if d<=t*s:
  print('Yes')
 e;se:
  print('No')

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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
# import sys

def main():
    # input = sys.stdin.readline
    s = input()
    t = input()

    res = len(t)
    
    for i in range(len(s)-len(t)+1):
        diff = 0
        for j in range(len(t)):
            if s[i + j] != t[j]:
                diff += 1
        res = min(res, diff)
    print(res)
if __name__ == '__main__':
    main()

import sys

def main():
    # input = sys.stdin.readline
    s = input()
    t = input()

    res = len(t)
    
    for i in range(len(s)-len(t)+1):
        diff = 0
        for j in range(len(t)):
            if s[i + j] != t[j]:
                diff += 1
        res = min(res, diff)
    print(res)
if __name__ == '__main__':
    main()

import sys

def main():
    input = sys.stdin.readline
    d, t, s = map(int, input().split(" "))

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


if __name__ == "__main__":
    main()

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
D,T,S=map(int,input().split)
if D/S<=T:
  print("Yes")
else:
  print("No")

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


Verdicts: Runtime Error

Accepted