Problem:


Score : 100 points

Problem Statement

In order to pass the entrance examination tomorrow, Taro has to study for T more hours.

Fortunately, he can leap to World B where time passes X times as fast as it does in our world (World A).

While (X \times t) hours pass in World B, t hours pass in World A.

How many hours will pass in World A while Taro studies for T hours in World B?

Constraints

All values in input are integers.

1 \leq T \leq 100

1 \leq X \leq 100

Input

Input is given from Standard Input in the following format:

T X

Output

Print the number of hours that will pass in World A.

The output will be regarded as correct when its absolute or relative error from the judge's output is at most 10^{-3}.

Sample Input 1

8 3

Sample Output 1

2.6666666667

While Taro studies for eight hours in World B where time passes three times as fast, 2.6666... hours will pass in World A.

Note that an absolute or relative error of at most 10^{-3} is allowed.

Sample Input 2

99 1

Sample Output 2

99.0000000000

Sample Input 3

1 100

Sample Output 3

0.0100000000



Sample input:
8 3


Sample output:
2.6666666667

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

t,x = I()
print(t/x)

Submission status: Accepted

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

print(x/t)

Submission status: Accepted

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

print(T/X)

Submission status: Accepted

Solution code:
def main():
 t,x = map(int,input().split())
 print(t / x)
main()

Submission status: Accepted

Solution code:
t, x = map(int ,input().split())
print(t/x)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print("%.10lf"%(a/b))

Submission status: Accepted

Solution code:
# coding: utf-8

# https://atcoder.jp/contests/abc117
# 10:10-


def main():
    T, X = map(int, input().split())

    return T / X


print(main())

Submission status: Accepted

Solution code:
import sys
T,X = map(int,input().split())
if not ( 1 <= T <= 100 and 1 <= X <= 100 ): sys.exit()

print(T/X)

Submission status: Accepted

Solution code:
t,x = map(float,input().split())
print(t/x)

Submission status: Accepted

Solution code:
T,X = (int(X) for X in input().split())
print(T/X)

Submission status: Accepted

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

print(float(t/x))

Submission status: Accepted

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

print(T/X)

Submission status: Accepted

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

print(t / x)

Submission status: Accepted

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

T,X = list(map(int,input().split()))
print(T/X)

Submission status: Accepted

Solution code:
x,t=map(int,input().split())
print(x/t)

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
print(a/b)

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rm()
print(a/b)

Submission status: Accepted

Solution code:
t,x=map(int,input().split());print(t/x)

Submission status: Accepted

Solution code:
def main():
    a,b=map(int,input().split(' '))
    print("%.4f"%(a/b))

main()

Submission status: Accepted

Solution code:
t,x = map(int,input().split())
print(t / x)

Submission status: Accepted

Solution code:
a,b = map(float, raw_input().split(' '))
print a/b

Submission status: Accepted

Solution code:
t,x=map(int,input().split())
a=float(t/x)
print('{:.10f}'.format(a))

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
T,X = (int(i) for i in input().split())
ans =T/X
print(ans)

Submission status: Accepted

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

ans = T/X

print(ans)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
print(A / B)

Submission status: Accepted

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

num = (T/X)
print("{:.10f}".format(num))

Submission status: Accepted

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

t = T / X

print(t)

Submission status: Accepted

Solution code:
t,x=map(float, input().split())
print("{:.4f}".format(t/x))

Submission status: Accepted

Solution code:
print(eval(input().replace(*' /')))

Submission status: Accepted

Solution code:
a,b = map(float,input().split())
print(a/b)

Submission status: Accepted

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

ans=t/x

print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import deque,Counter
from decimal import Decimal
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    t,x = SL()
    t = Decimal(t)
    x = Decimal(x)
    ans = t/x
    print(ans)
    return

if __name__=='__main__':
    Main()

Submission status: Accepted

Solution code:
t,x=map(int,input().split())
T = t/x
print(T)

Submission status: Accepted

Solution code:
T,X = map(int,input().split())
print(T/X)

Submission status: Accepted

Solution code:
t,x = map(int, input().split())
print(t/x)

Submission status: Accepted

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

t, x = map(int, input().split())

print(t / x)

Submission status: Accepted

Solution code:

import itertools

def solve(T,X):
    """
    >>> solve(8,3)
    2.6666666667
    """
    print(T/X)


def main():
    T,X = map(int,input().split())
    solve(T,X)


def _test():
    import doctest
    doctest.testmod()


if __name__ == "__main__":
    import sys
    argv = sys.argv
    if len(sys.argv) == 1:
        # no option
        main()
    elif sys.argv[1] == "-t":
        _test()
    else:
        input = open(sys.argv[1]).buffer.readline

Submission status: Accepted

Solution code:
def main():
    t,x=map(int,input().split())
    print(t/x)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#import itertools
#from fractions import Fraction
#import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions  import gcd
#input=sys.stdin.readline
#import bisect
t,x=map(int,input().split())
print(t/x)

Submission status: Accepted

Solution code:
t,x = map(float,input().split())
print(t / x)

Submission status: Accepted

Solution code:
from decimal import *

def main():
    t, x = map(int, input().split())
    print(Decimal(t) / Decimal(x))

main()

Submission status: Accepted

Solution code:
def solve():
    t, x = map(int, input().split())
    print(t / x)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
t , x = map(int,input().split())
print(t / x)

Submission status: Accepted

Solution code:
T,X = map(int,input().split())
print('{:.10f}'.format(T/X))

Submission status: Accepted

Solution code:
a,b = input().split()
print(int(a) / int(b) )

Submission status: Accepted

Solution code:
print(eval(input().replace(' ','/')))

Submission status: Accepted

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

print(t/x)

Submission status: Accepted

Solution code:
nums = input().split(" ")
print(int(nums[0])/int(nums[1]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
t, s = map(int, input().split())
print(t/s)

Submission status: Accepted

Solution code:
T, X = map(int, input().split())
print('{:5f}'.format(T / X))

Submission status: Accepted

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

print(t/x)

Submission status: Accepted

Solution code:
t,x  = map(float,input().split())
print(t/x)

Submission status: Accepted

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

print(t/x)

Submission status: Accepted

Solution code:
def inp():return map(int,input().split())

t,x=inp()
print(t/x)

Submission status: Accepted

Solution code:
t,x = map(int,input().split())
print("{:.4f}".format(t/x))

Submission status: Accepted

Solution code:
n = input()
n_ls = n.split()
t = int(n_ls[0])
x = int(n_ls[1])

print(t / x)

Submission status: Accepted

Solution code:
t,x =map(int, input().split())
print(t/x)

Submission status: Accepted

Solution code:
T, X = map(int,input().split())
print(T / X)

Submission status: Accepted

Solution code:
T,X =map(int,input().split())
print(T/X)

Submission status: Accepted

Solution code:
t, x = map(int, input().split())
print(t/x)

Submission status: Accepted

Solution code:
T, X = map(int,input().rstrip().split())
print(T/X)

Submission status: Accepted

Solution code:
A,B = list(map(int, input().split()))
print(A/B)

Submission status: Accepted

Solution code:
t,x=map(float,input().split())
print(t/x)

Submission status: Accepted

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

print(T/X)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


t, x = list(map(int, input().split()))

print(t/x)

Submission status: Accepted

Solution code:
import sys
T, X = map(int, sys.stdin.readline().rstrip().split())
print(T / X)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print(x/y)

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    print(a/b)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
t, x= map(int, input().split())
print(t / x)

Submission status: Accepted

Solution code:
t,x=map(int, input().split())
print(t/x)

Submission status: Accepted

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

print(t/x)

Submission status: Accepted

Solution code:

t,x=map(int,input().split())

print(t/x)

Submission status: Accepted

Solution code:
t, x = map(int, input().split())
print(t /x)

Submission status: Accepted

Solution code:
def main():
  num = list(map(int,input().split()))
  print( num[0]/num[1] )
  
main()

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
t, x = M()
print(t/x)

Submission status: Accepted

Solution code:
[T,X] = list(map(int,input().split()))

print(T/X)

Submission status: Accepted

Solution code:
t, x = map(float, input().split())
print(t/x)

Submission status: Accepted

Solution code:
T,X = [int(x) for x in input().split()]

print(T/X)

Submission status: Accepted

Solution code:
tmp = input().split(" ")
t = float(tmp[0])
x = float(tmp[1])

print(t/x)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print(A/B)

Submission status: Accepted

Solution code:
T,X = map(float,input().split())
print(T/X)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print(round(x/y, 10))

Submission status: Accepted

Solution code:
# input
T, X = map(int, input().split()) 

print(T / X)

Submission status: Accepted

Solution code:
T,X=map(int, input().split())
print(T/X)

Submission status: Accepted

Solution code:
t_b, x = map(int, input().split())

ans = t_b / x
print('{:.5f}'.format(ans))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
print(A/B)

Submission status: Accepted

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

print(T/X)

Submission status: Accepted

Solution code:
T,X=map(int,input().split())
ans=T/X
print(ans)

Submission status: Accepted

Solution code:
T,X=map(int,input().split())
t=T/X
print(t)

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-
'''
T, X = int(input())
print(T / X)
'''
T, X = map(int, input().split())
print(T / X)

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
T,X = map(int,input().split())

print(T/X)

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy
t, x = map(int, input().split())
print(t/x)

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
def input(): return sys.stdin.readline().strip()


def main():
    T, X = map(int, input().split())
    print(T / X)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
T,X = map(int,input().split())
a = T/X
print(a)

Submission status: Accepted

Solution code:
t, x = list(map(int, input().split()))
print(t / x)

Submission status: Accepted

Solution code:
T, X = map( int, input().split() )
print( T / X )

Submission status: Accepted

Solution code:
t, x = map(int, input().split())
print('{:.10f}'.format(t / x))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
print(A/B)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(a/b)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

t, x = Is()
print(t/x)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed May 13 14:11:41 2020

@author: shinba
"""

t,x = map(int,input().split())

print(t/x)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    t, x = mi()
    print(t / x)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
t, x = map(int, input().split())
print('{:.10f}'.format(t/x))

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    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

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

#############
# Main Code #
#############

T,X = inputIL()
print(T/X)

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter
import itertools
import fractions
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

# ###########################################
 
T,X=MI()
print(T/X)

Submission status: Accepted

Solution code:
print(eval(input().replace(" ", "/")))

Submission status: Accepted

Solution code:
T, X = map(int, input().split(' '))

print(T / X)

Submission status: Accepted

Solution code:
# A - Entrance Examination

T, X = map(int, input().split())

print(T/X)

Submission status: Accepted

Solution code:
T,X = map(int, input().split())
print(T / X)

Submission status: Accepted

Solution code:
def ABC_117_A():
    T,X = map(int, input().split())
    print(T/X)

if __name__ == '__main__':

    ABC_117_A()

Submission status: Accepted

Solution code:
import itertools
import math

t, x = map(int, input().split())
print(t/x)

Submission status: Accepted

Solution code:
T, X = list(map(int, input().split()))
print(T/X)

Submission status: Accepted

Solution code:
T, X = map(int, input().split())
print(T*(1/X))

Submission status: Accepted

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

print(t / x)

Submission status: Accepted

Solution code:
T, X = list(map(int,input().split()))
print(T/X)

Submission status: Accepted

Solution code:
t, x = [int(n) for n in input().split()]
print(t / x)

Submission status: Accepted

Solution code:
ii = lambda:int(input())
mi = lambda:list(map(int,input().split()))
ix = lambda x:list(input() for _ in range(x))
mix = lambda x:list(mi() for _ in range(x))
iix = lambda x:list(int(input()) for _ in range(x))
##########

t,x = mi()
print(t/x)

Submission status: Accepted

Solution code:
t,x = map(int,input().split())
print(float(t) / x)

Submission status: Accepted

Solution code:
print(eval(input().replace(' ', '/')))

Submission status: Accepted

Solution code:
t,x = map(int,input().split())
print(float(t/x))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

T, X = map(int, input().split())
print(T/X)

Submission status: Accepted

Solution code:
# ABC117A

t, x = map(int, input().split())
print(t/x)

Submission status: Accepted

Solution code:
# ABC117A
t, x = map(int, input().split())
print(t/x)

Submission status: Accepted

Solution code:
t, x = map(int, (input().split()))
print(t / x)

Submission status: Accepted

Solution code:
t, x = [int(x) for x in input().split()]
print(t / x)

Submission status: Accepted

Solution code:
T, X = map(float, input().split())
print(T / X)

Submission status: Accepted

Solution code:
a = list(map(float,input().split()))
print(a[0] / a[1]);

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
t, x = map(int, input().split())
print(t/x)

Submission status: Accepted

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

Time_A = T/X
print(Time_A)

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
print(x/y)

Submission status: Accepted

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

t = T / X

print(t)

Submission status: Accepted

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

lis = list(map(int, input().split()))
print(lis[0]/lis[1])

Submission status: Accepted

Solution code:
import math
y = input().split()
t = int(y[0])
x = int(y[1])
a = math.floor((t/x) * 1000)
print(a / 1000)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(float(a / b))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
T, X = map(int, input().split())
print(T / X)

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(k) for k in input().split()]
#template
T,X = inputlist()
print(T/X)

Submission status: Accepted

Solution code:


def solve():

    T, X = map(int, input().split())
    print(T/X)


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
def main():
    T, X = map(int, input().split())
    print(T/X)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
t,x = [int(x) for x in input().split()]
print(t/x)

Submission status: Accepted

Solution code:
T,X=[int(i)for i in input().split()]
print(T/X)

Submission status: Accepted

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

ans = T/X

print('{:.10g}'.format(ans))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

T, X = MAP()
print(T/X)

Submission status: Accepted

Solution code:
t,x = map(int,input().split())
print (t/x)

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
print(a[0]/a[1])

Submission status: Accepted

Solution code:
def resolve():
    t,x=map(int, input().split())
    print(t/x)
resolve()

Submission status: Accepted

Solution code:
def Entrance_Examination(t, x):

    return t/x
def main():
    t, x = map(int, input().split())
    print(Entrance_Examination(t, x))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

T, X = lr()
print(T/X)

Submission status: Accepted

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

answer = T / X

print(answer)

Submission status: Accepted

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

print(format(t/x, '.10f'))

Submission status: Accepted

Solution code:
t,x=map(int,input().split());print('{:.04f}'.format(t/x))

Submission status: Accepted

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

print(t/x)

Submission status: Accepted

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

print(t/x)

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
print(H/W)

Submission status: Accepted

Solution code:
T,X = map(int,input().split(' '))
print(T/X)

Submission status: Accepted

Solution code:
t,x=list(map(int,input().split()))
print(t/x)

Submission status: Accepted

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

print(t/x)

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    t,x=map(int,input().split())
    print(t/x)

Submission status: Accepted

Solution code:
T, X = map(int,input().split())
print(float(T)/float(X))

Submission status: Accepted

Solution code:
import numpy as np
import sys

t, x = map(float, input().split())
print(t / x)

Submission status: Accepted

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

print(T/X)

Submission status: Accepted

Solution code:
t, k = map(int, input().split())
print(t/k)

Submission status: Accepted

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

T,X=MI()
print(T/X)

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix

# strlist = "abcdefghijklmnopqrstuvwxyz"
t,x = map(int,input().split())

ans = t/x

print(ans)
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

Solution code:
a,b =map(int,input().split())
print(a / b)

Submission status: Accepted

Solution code:
t,x  = list(map(int,input().split()))
print(t/x)

Submission status: Accepted

Solution code:

t,x = map(int,input().split())

print(t/x)

Submission status: Accepted

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

ans = t/x
print('%.10f' % ans)

Submission status: Accepted

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

ans = round(t/x, 10)
print('%.10f' % ans)

Submission status: Accepted

Solution code:
x, t = map(int, input().split())
print(x/t)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

T,X = map(int, input().split())

print(T/X)

Submission status: Accepted

Solution code:
t, x, = map(int, input().split())
print(t/x)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
print(n/m*1.0)

Submission status: Accepted

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

print(a/b)

Submission status: Accepted

Solution code:
T = list(map(int,input().split()))
print(T[0]/T[1])

Submission status: Accepted

Solution code:
T,X = map(int,input().split())
print(str(T / X))

Submission status: Accepted

Solution code:
t,x=[int(i) for i in input().split()]

print(t/x)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
print(x / y)

Submission status: Accepted

Solution code:
T, X = map(int, input().split())
print('{:.10f}'.format(T/X))

Submission status: Accepted

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

print(a/b)

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    T, X = il()
    print(T/X)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#ABC-118-A
T, X = map(int, input().split())
print(T/X)