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:
from itertools import combinations

def main():
    N = int(input())
    A = tuple(map(int, input().split()))
    answer = solve(N, A)
    print(answer)


def solve(N, A):
    return sum(x * y for x, y in combinations(A, 2)) % (10**9 + 7)


if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

if len(s)==len(t):
  num=0
  for i,j in zip(s,t):
    if i!=j:
      num+=1
else:
  for i in range(len(s)-len(t)+1):
    a=s[i:len(t)+i]
    num=0
    for i,j in zip(t,a):
      if i!=j:
        num+=1
    num=min(1000,num)

print(num)

Submission status: Runtime Error

Solution code:
d=int(input())
t=int(input())
s=int(input())
if t>=d/s:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
Sum = []
A = list(map(int, input().split()))
Sum = [A[i]*A[j] for j in range(N) for i in range(j)]
print(np.array(Sum).sum()%(1000000000+7))

Submission status: Runtime Error

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

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(input().split(''))
i = int(D/S)
if i > T:
  answer = "No"
else:
  answer = "Yes"
print answer

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
edge = []
for i in range(M):
    a,b = map(int,input().split())
    add = []
    for j in range(len(edge)):
        if a in edge[j] or b in edge[j]:
            edge[j].append(a)
            edge[j].append(b)
            add.append(j)
    if len(add) == 0:
        edge.append([a,b])
    elif len(add) >= 2:
        for j in range(1,len(add)):
            edge[add[0]].extend(edge[add[j]])
        for j in range(1,len(add)):
            edge.pop(add[j])
ans = 0
for i in range(len(edge)):
    x = list(set(edge[i]))
    if len(x) > ans:
        ans = len(x)
print(ans)

Submission status: Runtime Error

Solution code:
D, T, S =input().split('')
i = int(D/S)
if i > T:
  answer = "No"
else:
  answer = "Yes"
print answer

Submission status: Runtime Error

Solution code:
if(D<=S*T)
 Yes
else
 No

Submission status: Runtime Error

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

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


print(count%MOD)

Submission status: Runtime Error

Solution code:
allsets = []
n,t = list(map(int,input().split()))
for _ in range(t):
    a,b = list(map(int,input().split()))
    if a < b and [a,b] not in allsets:
        allsets.append([a,b])
    elif b < a and [b,a] not in allsets:
        allsets.append([b,a])
# print(allsets)
hmap = {}
visitedNode = {}
for a,b in allsets:
    if a in visitedNode:
        if b not in hmap[visitedNode[a]]:
            hmap[visitedNode[a]].append(b)
        del visitedNode[a]
        continue
    if a in hmap:
        hmap[a].append(b)
        visitedNode[b] = a
    else:
        hmap[a] = [b]
        visitedNode[b] = a
# print(hmap)
res = 0
for k,v in hmap.items():
    res = max(res,len(v)+1)
print(res)

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 itertools

n = int(input())
a = [int(x) for x in input().split()]
s = 0
for (i, j) in list(itertools.permutations(range(n), 2)):
    if i >= j:
        continue
    s += a[i] * a[j]
print(s % 1000000007)

Submission status: Runtime Error

Solution code:
D,T,S= [int(x) for x in input("Enter values in the range of 1 and 10000: ").split(",")] 5
if (D and T) and S <=10000 and D/S==T:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import math
import itertools
import functools

_ = input()
A = list(map(int, input().split()))

for a, b in itertools.combinations(A, 2):
    if math.gcd(a, b) != 1:
        if functools.reduce(math.gcd, A) == 1:
            print('setwise coprime')
        else:
            print('not coprime')
        break
else:
    print('pairwise coprime')

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
sum = 0
b = [i % (10**9+7) for i in a if i % (10**9+7) != 0]
# print(b)
for j in range(0,len(b)-1):
    for k in range(j+1,len(b)):
        c = b[j]*b[k]
        sum = sum + c
print(sum%(10**9+7))

Submission status: Runtime Error

Solution code:
N = int(input())
A = input().split()
B = [0]*N

for i in range(N):
  A[i] = int(A[i])
  B[i] = A[i]*A[i]

print( ( ( (sum(A)*sum(A)) - sum(B) ) // 2 ) % ( 10**9 + 7 ) // 2 )

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

Solution code:
# ===============================================================================================
# importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations as comb  # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl
# If the element is already present in the list,

# the left most position where element has to be inserted is returned.
from bisect import bisect_right as br
from bisect import bisect

# If the element is already present in the list,
# the right most position where element has to be inserted is returned

# ==============================================================================================
# fast I/O region

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None


    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

# inp = lambda: sys.stdin.readline().rstrip("\r\n")

# ===============================================================================================
### START ITERATE RECURSION ###
from types import GeneratorType


def iterative(f, stack=[]):
    def wrapped_func(*args, **kwargs):
        if stack: return f(*args, **kwargs)
        to = f(*args, **kwargs)
        while True:
            if type(to) is GeneratorType:
                stack.append(to)
                to = next(to)
                continue
            stack.pop()
            if not stack: break
            to = stack[-1].send(to)
        return to

    return wrapped_func


#### END ITERATE RECURSION ####

# ===============================================================================================
# some shortcuts

mod = 1000000007


def inp(): return sys.stdin.readline().rstrip("\r\n")  # for fast input

def out(var): sys.stdout.write(str(var))  # for fast output, always take string

def lis(): return list(map(int, inp().split()))

def stringlis(): return list(map(str, inp().split()))

def sep(): return map(int, inp().split())

def strsep(): return map(str, inp().split())


def zerolist(n): return [0] * n

def nextline(): out("\n")  # as stdout.write always print sring.

def testcase(t):
    for p in range(t):
        solve()

def printlist(a):
    for p in range(0, len(a)):
        out(str(a[p]) + ' ')

def lcm(a, b): return (a * b) // gcd(a, b)



def ncr(n, r): return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def power(x, y, p):
    res = 1  # Initialize result
    x = x % p  # Update x if it is more , than or equal to p
    if (x == 0):
        return 0
    while (y > 0):
        if ((y & 1) == 1):  # If y is odd, multiply, x with result
            res = (res * x) % p

        y = y >> 1  # y = y/2
        x = (x * x) % p
    return res

import random

def primesbelow(N):
    # http://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/3035188#3035188
    #""" Input N>=6, Returns a list of primes, 2 <= p < N """
    correction = N % 6 > 1
    N = {0:N, 1:N-1, 2:N+4, 3:N+3, 4:N+2, 5:N+1}[N%6]
    sieve = [True] * (N // 3)
    sieve[0] = False
    for i in range(int(N ** .5) // 3 + 1):
        if sieve[i]:
            k = (3 * i + 1) | 1
            sieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)
            sieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)
    return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]

smallprimeset = set(primesbelow(100000))
_smallprimeset = 100000
def isprime(n, precision=7):
    # http://en.wikipedia.org/wiki/Miller-Rabin_primality_test#Algorithm_and_running_time
    if n < 1:
        raise ValueError("Out of bounds, first argument must be > 0")
    elif n <= 3:
        return n >= 2
    elif n % 2 == 0:
        return False
    elif n < _smallprimeset:
        return n in smallprimeset


    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1

    for repeat in range(precision):
        a = random.randrange(2, n - 2)
        x = power(a, d, n)

        if x == 1 or x == n - 1: continue

        for r in range(s - 1):
            x = power(x, 2, n)
            if x == 1: return False
            if x == n - 1: break
        else: return False

    return True

# https://comeoncodeon.wordpress.com/2010/09/18/pollard-rho-brent-integer-factorization/
def pollard_brent(n):
    if n % 2 == 0: return 2
    if n % 3 == 0: return 3

    y, c, m = random.randint(1, n-1), random.randint(1, n-1), random.randint(1, n-1)
    g, r, q = 1, 1, 1
    while g == 1:
        x = y
        for i in range(r):
            y = (power(y, 2, n) + c) % n

        k = 0
        while k < r and g==1:
            ys = y
            for i in range(min(m, r-k)):
                y = (power(y, 2, n) + c) % n
                q = q * abs(x-y) % n
            g = gcd(q, n)
            k += m
        r *= 2
    if g == n:
        while True:
            ys = (power(ys, 2, n) + c) % n
            g = gcd(abs(x - ys), n)
            if g > 1:
                break

    return g

smallprimes = primesbelow(1000) # might seem low, but 1000*1000 = 1000000, so this will fully factor every composite < 1000000
def primefactors(n, sort=False):
    factors = []

    for checker in smallprimes:
        while n % checker == 0:
            factors.append(checker)
            n //= checker
        if checker > n: break

    if n < 2: return factors

    while n > 1:
        if isprime(n):
            factors.append(n)
            break
        factor = pollard_brent(n) # trial division did not fully factor, switch to pollard-brent
        factors.extend(primefactors(factor)) # recurse to factor the not necessarily prime factor returned by pollard-brent
        n //= factor

    if sort: factors.sort()

    return factors

def factorization(n):
    factors = {}
    for p1 in primefactors(n):
        try:
            factors[p1] += 1
        except KeyError:
            factors[p1] = 1
    return factors


from functools import reduce

n=int(inp())
ar=lis()
k=ar.count(1)
if n-k<=100000:
    temp=set()
    temps=0
    t=1
    for i in ar:
        k=factorization(i)
        s=set(k.keys())
        l=len(s)
        temp=temp.union(s)
        if len(temp)!=l+temps:
            t=-1
            break
        temps+=l
    if t==1:
        print("pairwise coprime")
    else:
        k=reduce(gcd,ar)
        if k==1:
            print("setwise coprime")
        else:
            print("not coprime")
else:
    k = reduce(gcd, ar)
    if k == 1:
        print("setwise coprime")
    else:
        print("not coprime")

Submission status: Runtime Error

Solution code:
n,m=list(map(int,input().split()))
par=[i for i in range(n)]
ro=dict(int)
for i in range(n):
    ro[i]=1
def root(i):
    if par[i]==i:
        return i
    else:
        return root(par[i])

def unite(x,y):
    rx=root(x)
    ry=root(y)
    if rx!=ry:
        par[rx]=ry
        ro[ry]+=ro[rx]
        ro[rx]=0

for i in range(m):
    a,b=list(map(int,input().split()))
    a-=1
    b-=1
    unite(a,b)


# for i in range(n):
#     ro[root(i)]+=1

print(max(ro.values()))

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:
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))

Submission status: Runtime Error

Solution code:
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))

Submission status: Runtime Error

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

def calc_primes(n):
    data = [i for i in range(2, n + 1)]
    for d in data:
        data = [x for x in data if (x == d or x % d != 0)]
    return data

# primes = calc_primes(int(math.sqrt(10**6)))                                                                                                                                                               

is_pairwise = False
prod = 1
all_gcd = A[0]
for a in A:
    all_gcd = math.gcd(all_gcd, a)
    if is_pairwise:
        g = math.gcd(prod, a)
        if g > 1:
            is_pairwise = False
        prod *= a

if is_pairwise:
    print('pairwise coprime')
elif all_gcd == 1:
    print('setwise coprime')
else:
    print('not coprime')

Submission status: Runtime Error

Solution code:
S = str(input())
T = str(input())
tempcount = 0
mincount = 0

if S in T:
    print("0")
    exit

for i in range(len(S) - len(T)+1):
    for j in range(len(T)):
        if S[i + j] != T[j]:
            tempcount += 1
    if i == 0:
        mincount = tempcount
    elif tempcount < mincount:
        mincount = tempcount
    tempcount = 0
    
print(mincount)

Submission status: Runtime Error

Solution code:
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()

Submission status: Runtime Error

Solution code:
import numpy as np
n=int(input())
t=np.array(input().split(' '))
num=np.zeros(n)
for a in range(n):
  num[a]=int(t[a])
a=np.sum(num)**2
b=np.sum(num**2)
x=int((a-b)/2)
x=(x-1)%(10**9+7)
print(x)

Submission status: Runtime Error

Solution code:
import numpy as np
from scipy.sparse.csgraph import connected_components
from scipy.sparse import csr_matrix
import collections

N, M = map(int, input().split())
edge = np.array([input().split() for _ in range(M)], dtype=np.int8).T

if M == 0:
    print(1)
else:

    tmp = np.ones(M, dtype=np.int8).T
    graph = csr_matrix((tmp, (edge[:] - 1)), (N, N))

    n, labels = connected_components(graph)

    c = collections.Counter(labels)

    print(max(c.values()))

Submission status: Runtime Error

Solution code:
def main():
    N = int(input())
    As = list(map(int, input().split()))

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

    sum_ %= 10 ** 9 + 7
    print(sum_)


if __name__ == '__main__':
    main()

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 java.util.*;

public class A
{
  public static void main(String[] args)
  {
  	Scanner sc = new Scanner(System.in);
    int d = sc.nextInt();
    int t = sc.nextInt();
    int s = sc.nextInt();
    
    float tdash = d/s;
    if (tdash > (float)t)
        System.out.println("No");
    else
        System.out.println("Yes");
  }

}

Submission status: Runtime Error

Solution code:
import numpy as np
n=int(input())
t=input().split(' ')
num=np.zeros(n)
for a in range(n):
  num[a]=int(t[a])
a=np.sum(num)**2
b=np.sum(num**2)
x=int((a-b)/2)
x=x%(10**9+7)-1
print(x)

Submission status: Runtime Error

Solution code:
i = input().split()
 
d = i[0]
t = i[1]
s = i[2]

dt = i[0] / i[2]
lt = i[1]

if dt <= lt:
  	print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

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

res = D/S

if(res<=T):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D=int(input("Enter a number in the range of 0 and 10000 10000: "))
T=int(input("Enter a number in the range of 0 and 10000: "))
S=int(input("Enter a number in the range of 0 and 10000: "))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

res = float(D/S)

if(res<=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:
info=input().split()

D=info[0]
S=info[1]
T=info[2]

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

Submission status: Runtime Error

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

    mod_value = 10**9 + 7
    sum_ = 0
    for i in range(len(A)-1):
        sum_ = sum_ + A[i]*sum(A[i+1:]) % mod_value
    print(sum_ % mod_value)
main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
D = 3000
T = 5
S = 600

print("T * S = D" + str(T * S = D))

Submission status: Runtime Error

Solution code:
d=int(input())
t=int(input())
s=int(input())
if s!=0:
  tm=d/s
else:
  tm=t+1
  

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

Submission status: Runtime Error

Solution code:
D = 3000
T = 5
S = 600

print("T * S = D" + str(T * S))

Yes

Submission status: Runtime Error

Solution code:
D = 3000
T = 5
S = 600

print("T * S = D" + str(T * S = D))

"Yes"

Submission status: Runtime Error

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

time = d/s

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
D=int(input("Enter a number in the range of 0 and 10000: "))
T=int(input("Enter a number in the range of 0 and 10000: "))
S=int(input("Enter a number in the range of 0 and 10000: "))
def DontBeLate(D,T,S):
    
    if (D and T) and S <=10000 and D/S==T:
        print("Yes")
    else:
        print("No")
(DontBeLate(D,T,S))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(input().split())
B = [int(a) for a in A]
x = 10**9+7
summation = 0
for i in range(N-1):
    for j in range(i+1,N):
        summation += (B[i] * B[j])
        summation % x
print(summation % x)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

ans=0
for i in range(n-1):
  for j in range(i+1, n):
    ans+= aas[i]*aas[j]
    if ans>(10**9+7):
      ans= ans% (10**9+7)

print(ans)

Submission status: Runtime Error

Solution code:
if D/S<=T:
  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 = input().split()
t,s = map(int,input().split())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
li = input().split()
print(li)
d = int(li[0])
t = int(li[1])
s = int(li[2])

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

Submission status: Runtime Error

Solution code:
import math

# input d:距離（メートル） , t:待ち合わせまで何分 , s:速度（分速sメートル）
d, t, s = map(int, input().split())

output = "";

if d/s >= s:
    if math.ceil(d/s) = s:
        output = "Yes"
    else:
        output = "No"
else:
    output = "Yes"

print(output)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline

num = int(input())
an = list(map(int, input().split()))

ans = 0

for i in range(len(an)):
  for j in range(len(an)):
    if i < j:
      kake = an[i] * an[j]
      kake %= ((10 ** 9) + 7)
      ans += kake
  
ans %= ((10 ** 9) + 7)

print(ans)

Submission status: Runtime Error

Solution code:
d=input
t=input
s=input
x=t*s
y=d-x
if y<=0:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
total_minute=D/S

if total_minute<=T:
  print("Yes")
else:
  print("No

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
N= int(input())
A= list(map(int,input().split(' ')))
 
ans = 0
for i in range(len(A)-1):
  for j in range(i+1, len(A)):
    ans += A[i]*A[j]
 
print(ans)

Submission status: Runtime Error

Solution code:
D = int(input())
T = int(input())
S = int(input())
if D <= 10000 or T <= 10000 or S <= 10000:
    A = D / S
    if A <= T:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
s = input()
D = float(s[0])
T = float(s[1])
S = float(s[2])
if (D > T * S):
	print("No")
else:
	print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

actualTime = int(D/S)

if(actualTime<=T):
    print ("Yes")
else:
    print ("No")

Submission status: Runtime Error

Solution code:
import sys
from math import gcd
input = sys.stdin.buffer.readline

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


def primes(n):
    ass = []
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    for i in range(len(is_prime)):
        if is_prime[i]:
            ass.append(i)
    return ass

p = primes(1003)

g = a[0]
for e in a:
    g = gcd(g,e)

if g != 1:
    print("not coprime")
else:
    a.sort()
    if a[0] == a[-1] and a[0] == 1:
        print("pairwise coprime")
    else:
        s = set()
        for e in a:
            for d in p:
                if e%d == 0:
                    if d in s:
                        print("setwise coprime")
                        exit()
                    s.add(d)
            s.add(e)
        print("pairwise coprime")

Submission status: Runtime Error

Solution code:
5000 1 1

No

Submission status: Runtime Error

Solution code:
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)

Submission status: Runtime Error

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

i[0] = d

i[1] = t

i[2] = s

sum = d / s

if sum < 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("Enter D : "))
t = int(input("Enter T : "))
s = int(input("Enter S : "))
if s * t >= d:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
d = input()
t = input()
s = 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())
a=float(T-D/S)
if a>0:
    print("Yes")
else :
    print("No")

Submission status: Runtime Error

Solution code:
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) ]))
def invr():
    return(map(int,input().split()))
  
i <- inlt()
D <- i[0]
T <- i[1]
S <- i[2]
 
if D > S*T:
  print("No")
else:
  print("Yes")

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:
n = int(input())
a = list(map(int, input().split()))
sum = 0
for each in range(1,n):
    for other in range(each):
        sum += (a[each] % (10**9 + 7)) * (a[other] % (10**9 + 7))
        sum = sum % (10**9 + 7)
print(sum)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) ]))
def invr():
    return(map(int,input().split()))
  
i <- inlt()
D <- i[0]
T <- i[1]
S <- i[2]

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

Submission status: Runtime Error

Solution code:
d=int(input())
t=int(input())
s=int(input())
if d/s<=t:
    print("YES")
else:
    print("NO")