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: Runtime Error

Solution code:
var1 = T
var2 = X

T = input()
X = input()

print(float(T)/float(X))

Submission status: Runtime Error

Solution code:
n = int(input())
l = list(map(int, input().split()))
max_num = 0
max_index = 0
total = 0

for i in range(n):
  if max_num < l[i]:
    max_num = l[i]
    max_index = i


l.pop(max_index)


for i in range(n - 1):
  total += l[i]

if total > max_num: print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
data = input().split()  
n = int(data[0])
m = int(data[1])
x = [int(s) for s in input().split()]

x.sort()

y=[]
tmp=0
for i in x:
    y.append(i-tmp)
    tmp=i
y.pop(0)

y.sort()
y.reverse()

res=x[-1]-x[0]

if(len(y)+1 < n):
    n = len(y)+1

for i in range(n-1):
    res-=y[i]

print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
data = input().split()  
n = int(data[0])
m = int(data[1])
x = [int(s) for s in input().split()]

x.sort()

y=[]
tmp=0
for i in x:
    y.append(i-tmp)
    tmp=i
y.pop(0)

y.sort()
y.reverse()

res=x[-1]-x[0]

print(x)
print(y)

if(len(y)+1 < n):
    n = len(y)+1

for i in range(n-1):
    res-=y[i]

print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
L = list(map(int, input().split()))
nagai = max(L)

Submission status: Runtime Error

Solution code:
s = int(input())
n = "1"
string_list = [input() for i in range(n)]
int_list = (int(s) for s in string_list)
m = max(int_list)
if sum(int_list) - int(m) > int(m):
    print("Yes")
else:
    print("NO")

Submission status: Runtime Error

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

x_list.sort()
ans = 0

margin = [0] * (M - 1)
f = x_list[0]
for i in range(1, M):
    margin[i - 1] = x_list[i] - f
    f = x_list[i]
margin = sorted(enumerate(margin), key=lambda x: (-x[1], x[0]))
cnt = [0]
for i, v in margin:
    cnt.append(i + 1)
    if len(cnt) == N:
        break

start = 0
prev = x_list[0]
for i, c in enumerate(cnt[1:]):
    for j in range(start, c):
        ans += x_list[j] - prev
        prev = x_list[j]
    start = c
    prev = x_list[c]
last = cnt[-1]
for i in range(last, M):
    if i == last:
        prev = x_list[i]
    else:
        ans += x_list[i] - prev
        prev = x_list[i]
print(ans)

Submission status: Runtime Error

Solution code:

T = stdin.readline().rstrip()
X = stdin.readline().rstrip()

print(float(T)/float(X))

Submission status: Runtime Error

Solution code:
import sys

T = stdin.readline().rstrip()
X = stdin.readline().rstrip()

print(float(T)/float(X))

Submission status: Runtime Error

Solution code:
n = int(input())
p = list(map(int, input().split(' ')))
#p = [list(map(int, input().split())) for _ in range(n)]
p = sorted(p, reverse=True)
if len(p) != n or n < 4:
  raise ValueError

#print(p[0], p[1:])
if p[0] < sum(p[1:]):
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

Solution code:
N = int(input())
L = list(map(int,input().split()))
L_max = max(L)

L_sum = sum(L)

if L_sum - L_max > L_max:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
p = list(map(int, input().split(' ')))
#p = [list(map(int, input().split())) for _ in range(n)]
p = sorted(p, reverse=True)
if len(p) != n:
  raise ValueError

#print(p[0], p[1:])
if p[0] < sum(p[1:]):
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

Solution code:
from sys import stdin

T = stdin.readline().rstrip()
X = stdin.readline().rstrip()

print(float(T)/float(X))

Submission status: Runtime Error

Solution code:
n = int(input())
s = [int(i) for i in input().split()]
print("Yes" if max(s) < (sum(s) -max(s)) else "No")

Submission status: Runtime Error

Solution code:
t = int(input())
x = int(input())
ans = 0.0

if 1 <= t and t <= 100:
  if 1 <= x and x <= 100:
    answer = t / x
    print(ans)

Submission status: Runtime Error

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

print(float(T) / float(X))

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
X_list = list(map(int, input().split()))
X_list.sort()
err_list = [X_list[i+1] - X_list[i] for i in range(len(X_list)-1)]
err_list.sort()

if N == 1:
    print(sum(err_list))
else:
    print(sum(err_list[:-(N-1)]))

Submission status: Runtime Error

Solution code:
t = int(input())
x = int(input())
answer = 0.0

if 1 <= t and t <= 100:
  if 1 <= x and x <= 100:
    answer = t / x
    print(answer)

Submission status: Runtime Error

Solution code:
n = int(input())
p = list(map(int, input().split(' ')))
p = sorted(p, reverse=True)

if p[0] < sum(p[1:]):
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

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

p = sorted(p)
if p[0] < sum(p[1:]):
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

Solution code:
time = input('time')
xtimes = input('xtimes')

A = int(time) / int(xtimes)

print(A)

Submission status: Runtime Error

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

L_max = max(L)
L_sum = sum(L)

if L_max < L_sum - L_max:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
T = int()
X = int()

print( T / X )

Submission status: Runtime Error

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

max_num = max(num_li)
other_num = 0

for n in num_li:
  if n == max_num:
    continue
  other_num += n

if max_num < other_num:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

print(T / X)

Submission status: Runtime Error

Solution code:
T = []
X = []

print(T / X)

Submission status: Runtime Error

Solution code:
N = int(input())
L = list(map(int, input().split()))
t = 0
for l in L :
    t += l
t = t - max(L)

    
if max(L) < t:
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:
T=int(input())
X=int(input())

t=(1/X)*T
print(t)

Submission status: Runtime Error

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

print(T/X)

Submission status: Runtime Error

Solution code:
s = input().split( )
print(s[0]/s[1])

Submission status: Runtime Error

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

print(T/X)

Submission status: Runtime Error

Solution code:
all=input().split()
T=all[0]
X=all[1]
round(T/X,10)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

R = X/T

print(R)

Submission status: Runtime Error

Solution code:
import sys

T = int(sys.argv[1])
X = int(sys.argv[2])

print(T/X)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
T = int(input())
X = int(input())

print(T / X)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ist = [int(i) for i in input().split()]
print(list[0]/list[1])

Submission status: Runtime Error

Solution code:
t = int(input())
x = int(input())
ans = t / x
print(ans)

Submission status: Runtime Error

Solution code:
package main

import "fmt"

func main() {
	var T, X int

	fmt.Scan(&T)
	fmt.Scan(&X)

	fmt.Println(float64(T) / float64(X))
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def solve(N):
  A, B = map(int, input().split())
  return A / B

print(solve())

Submission status: Runtime Error

Solution code:
x = int(input())
t = int(input())
print(x/t)

Submission status: Runtime Error

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

 print(T / X)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
using ll=long long;using ull=unsigned ll;
using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;
using P=pair<int,int>;using PL=pair<ll,ll>;
const int INF=1<<30,MOD=1000000007;const ll LINF=1ll<<60;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) _repi(i,0,n)
#define _repi(i,a,b) for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...) _overload3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define REPARR(i,v) for(int i=0;i<v.size();++i)
#define all(v) (v).begin(),(v).end()
#define uniq(v) sort(all(v));v.erase(unique(all(v)),v.end())
#define bit(n) (1ll<<(n))
template<class T>bool chmax(T&a,const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,const T&b){if(a>b){a=b;return 1;}return 0;}
#define YES(n) cout<<((n)?"YES":"NO")<<endl
#define Yes(n) cout<<((n)?"Yes":"No")<<endl
#define yes(n) cout<<((n)?"yes":"no")<<endl
#define poss(n) cout<<((n)?"":"im")<<"possible"<<endl
#define Poss(n) cout<<((n)?"P":"Imp")<<"ossible"<<endl
template<typename T>ostream&operator<<(ostream&o,const vector<T>&v){for(T i:v)o<<i<<' ';return o;}
template<typename T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>>j;return i;}
template<typename T>ostream&operator<<(ostream&o,const set<T>&v){for(T i:v)o<<i<<' ';return o;}
template<typename T,typename U>ostream&operator<<(ostream&o,const pair<T,U>&v){o<<v.first<<' '<<v.second;return o;}

int main(){
    int t,x;
    cin>>t>>x;
    cout<<(double)t/x<<endl;
    return 0;
}