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:
N,K=map(int,input().split())
A=list(map(int,input().split()))
lk=len(bin(K))-2
C=[0]*lk
for j in range(N):
  a=A[j]
  for i in range(lk):
    if a%2==1:
      C[i]+=1
    a=(a-a%2)//2

X="0b"
for i in reversed(range(lk)):
  if C[i]>=N-C[i]:
    X+="0"
  else:
    X+="1"
    
if int(X,0)<=K:
  X=int(X,0)
  ans=0
  for i in range(N):
    ans+=X^A[i]
  print(ans)
else:
  ans=-1
  for i in range(2,lk+2):
    x=int(bin(K)[:i]+"0"+X[i+1:],0)
    if x<=K:
      a=0
      for i in range(N):
        a+=x^A[i]
      ans=max(ans,a)
  print(ans)

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
X = sorted(list(map(int,input().split())))
 
interval = []
 
 
 
for i in range(1,M):
	interval.append(X[i] - X[i - 1])
 
interval.sort()
 
if M - N < 0:
	print(0)
else:print(sum(interval[:M - N]))

Submission status: Runtime Error

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

interval = []



for i in range(1,M):
	interval.append(X[i] - X[i - 1])

interval.sort()

print(sum(interval[:-N + 1]))

Submission status: Runtime Error

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

interval = []



for i in range(1,M):
	interval.append(X[i] - X[i - 1])

interval.sort()

print(sum(interval[:M-N]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(int(input())/int(input()))

Submission status: Runtime Error

Solution code:
print(int(input())/int(input())

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
lst = list(map(int, input().split()))
lst.sort()
lst2 = []
for i in range(1, M):
    lst2.append(lst[i] - lst[i-1])
lst2.sort()
print(sum(lst2[0:(M-N)]))

Submission status: Runtime Error

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

longest = max(x)
x.remove(longest)

if longest < sum(x):
    print("Yes")
else:
    print("No")

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:
T = int(input())
X = int(input())
#世界Bで　X * t = 世界Aで　t ⇒　T = X * t  t = T / X
print(T / X)

Submission status: Runtime Error

Solution code:
n = int(input())
l = sorted(list(map(int,input().split())))
s = 0

for i in l[:-1]:
  s += i
  
if l[0] < s:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
l = list(map(int, input().split()))
maxi = max(l)
l[l.index(max(l))]=0
tmp=0
for x in l:
    tmp+=x

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
N, M = map(int, input().split())
X = sorted(list(map(int,input().split())))
A = []
if M == 1:
    print(0)
    sys.exit()
for i in range(M - 1):
    dif = X[i + 1] - X[i]
    A.append(dif)
for i in range(N - 1):
    A.remove(max(A))
print(sum(A))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

c = int(a)
d = int(b) 

time = (1/c) * d

return(time)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
x = list(map(int,input().split()))
x.sort()
y = []
for i in range(1,m):
  y.append(x[i] - x[i-1])
y.sort()
print(sum(y[:max(0,m-n)]))

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
xs = list(map(int, input().split(' ')))
xs.sort()

diff = [(i, b-a) for i, (a, b) in enumerate(zip(xs, xs[1:]))]
diff.sort(key=lambda x: x[1])

start_indexes = [0] + list(map(lambda x:x[0] + 1, diff[-n+1:]))
start_indexes.sort()

steps = 0
for i_start, i_end in zip(start_indexes, start_indexes[1:] + [m]):
    steps += xs[i_end - 1] - xs[i_start]
print(steps)

Submission status: Runtime Error

Solution code:
numN = int(input())
args = input()
 
lines = list()
 
 
for i in range(numN):
    list.append(int(args[0:args.find(" ")]))
 
list_sorted = sorted(list)
max_line = list_sorted[0]
 
for m in range(numN - 1) :
    max_line = max_line - list_sorted[m+1]
 
if max_line < 0 :
    print(yes)
else
    print(no)

Submission status: Runtime Error

Solution code:
numN = int(input())
args = input()
 
lines = list()
 
 
for i in range(numN):
    list.append(int(args[0:args.find(" ")]))
 
list_sorted = sorted(list)
max_line = list_sorted[0]
 
for m in range(numN - 1)
    max_line = max_line - list_sorted[m+1]
 
if max_line < 0 :
    print(yes)
else
    print(no)

Submission status: Runtime Error

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

ps=sorted(int(i) for i in input().split())

if n>=m:
    print(0)
    exit()

dis2=sorted(ps[i+1]-ps[i] for i in range(m-1))


print(sum(dis2[:m-n]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
c = list(map(int, input
s = 0
for i in range(44, -1, -1):
    if 2 ** i + s <= b
        if a > d[i] * 2:
            s += 2 ** i
for i in c:
    ans += i ^ s
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
_ = input()
nums = [int(x) for x in input().split()]
max_ = max(nums)
pop(nums.index(max_))
rest = sum(nums)
if rest > max_:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
1 100

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, M = (int(i) for i in input().split())  
X = [int(i) for i in input().split()] 
lg_bw_x = [] 
s= 0
if N >= M:
    print(0)
else
    X.sort()
    for i in range(M-1):
        lg_bw_x.append(X[i+1] - X[i])
    lg_bw_x.sort()
    for j in range(M-N-1):
        s = s+lg_bw_x[j]
    print(s)

Submission status: Runtime Error

Solution code:
import sys

n, m = map(int, input().split())

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

gap = []


if( n >= m):
    print(0)
    sys.exit()
else:
    x = sorted(x)
    for i in range(m-1):
        gap.append(x[i+1] - x[i])
    gaps = sorted(gap)

print(sum(gaps[:m-n]))

Submission status: Runtime Error

Solution code:
N=int(input())
A=[int(x)for x in input().split()]

s=sum(A)
a=max(A)

answer="NO" if a>=s-a else"yes"
print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
X,xt = map(int,input().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:
a, b = map(int, input().split())
print({:.10f}.format(a/b))

Submission status: Runtime Error

Solution code:

#!/usr/bin/env python3
import sys


def solve(T: int, X: int):
    print(T / Xl)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    T = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(T, X)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a = [list(input().split()) for i in range(1)]
b=0
b = float(a[0]/a[1])
print(b)

Submission status: Runtime Error

Solution code:
a = [list(input().split()) for i in range(1)]
b=0
a = float(a[0]/a[1])
print(b)

Submission status: Runtime Error

Solution code:
import numpy as np

N, K = map(int,input().split())
A = list(map(int,input().split()))
zero_padding = len(bin(max(A))[2:])
add = np.array([0]*zero_padding)
for i in range(len(A)):
    n = i
    n =bin(n)[2:]
    num = list(map(int, str(n)))
    num = [0]*(zero_padding-len(n)) +num
    add = add + np.array(num)
result = [1]*len(bin(9)[2:])
length = min(len(result),len(add))
for j in range (1,length+1):
    if add[-j] <= N//2:
        result[-j] =0 
best = int(''.join(map(str, result)),2)
ans = 0
for i in range (len(A)):
    ans +=int(bin(best ^ A[i]),2)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: utf-8
N = int(input())
Ls = sorted(list(map(int,input().split())))
print("Yes" if max(Ls) < sum(Ls) - max(Ls) else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

num = t / x

print(float(num))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int( input() )
b = int( inout() )
print(a/b)

Submission status: Runtime Error

Solution code:
a = input()
b = input()
print( a / b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

N = int(input())
L = input().split()
L_num = []

for i in range(len(L)):
    L_num.append(int(L[i]))

L_num.sort()

total = 0
for j in range(len(L) - 1):
    total += L_num[j]

if total <= L_num[N-1]:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
import numpy as np
import math

N, K = map(int, input().split(" "))
As = map(int, input().split(" "))
if K == 0:
  print(sum([A for A in As]))
else:
  lim = int(math.log2(K)) + 1
  A_array = np.array([[int(A / 2**i) % 2 for i in range(lim)] for A in As])
  num1 = [np.sum(keta) for keta in A_array.T]
  ans = 0
  X = 0
  for i in range(lim)[::-1]:
    if (num1[i] < (N / 2.0)) and (X + 2**i <= K):
      ans += (N - num1[i]) * 2**i
      X += 2**i
    else:
      ans += num1[i] * 2**i
  print(ans)

Submission status: Runtime Error

Solution code:
#include <iostream>

float T;
float X;

int main(){
  std::cin >> T >> X;
  std::cout << T/X;
  return (0);
}

Submission status: Runtime Error

Solution code:
#ABC117 A
T, X = input(split())
print(T/X)

Submission status: Runtime Error

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

try:
	assert 3 <= n <= 10
	assert len(ar) == n
	assert (1 <= min(ar)) and (max(ar) <= 100)
    
	if max(ar) < sum(ar) - max(ar):
		print("Yes")
	else:
		print("No")
except:
  print("No")

Submission status: Runtime Error

Solution code:
a,b = (int(x) for x in input.split())
 
print(round((a/b),10))

Submission status: Runtime Error

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

print(round((a/b),10))

Submission status: Runtime Error

Solution code:
N=int(input())
l=list(map(int,input().split()))
if max(l)<sum(l)-max(l):
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
N=int(input())
l=list(map(int,input().split()))
if max(l)<sum(l)-max(l):
	print("Yes")
else:
	print("NO")

Submission status: Runtime Error

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

t=int(T)
x=int(X)

print(t/x)

Submission status: Runtime Error

Solution code:
n = int(input())
su = [ int(i) for i in input().split() ]
su.sort()
lastn = su.pop(n-1)

if sum(su) < lastn:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

assert 3 <= n <= 10
assert len(ar) == n
assert (1 <= min(ar)) and (max(ar) <= 100)

if max(ar) < sum(ar) - max(ar):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import numpy as np
T,X = map(int, input().split())
print(T/x*1.00000)

Submission status: Runtime Error

Solution code:
T = int(input())
X = int(input())
t = float(T)
x = float(X)
k = t/x
print(k)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
T = int(input())
X = int(input())
print(T/x)

Submission status: Runtime Error

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

s = []

for i in range(n):
    s.append(sum(a[:i+1]))
s.append(0)

Submission status: Runtime Error

Solution code:
N,K = [int(i) for i in input().split()]
num = list(map(int, input().split()))
k = K
ans = 0
count = 0
print(K)
if K == 0:
    print(sum(num))
else:
    K2 = []
    while K>0:
        K2.append(K % 2)
        K //= 2
    data = []
    for i in num:
        num2 = []
        while i > 0:
            num2.append(i % 2)
            i //= 2
        while len(num2) < len(K2):
            num2.append(0)
        data.append(list(reversed(num2)))
    for i in range(len(K2)):
        t = 0
        b = 2**(len(K2) - i - 1) #べき乗
        for j in range(N):
            t += data[j][i]
        if t >= N-t:
            ans += b * t
        else:
            count += b
            if count <= k:
                ans += b * (N-t)
            else:
                ans += b * t
    print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
t = list(map(int, input().split()))
if max(t) * 2 < sum(t):
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
import sys
N, M = (int(i) for i in input().split())
X = [int(i) for i in input().split()]
X.sort()

pos = [[0] * 2 for i in range(N)]
total = 0

if M <= N:
    print(0)
    sys.exit()

for i in range(N):
    pos[i][0] = i
    pos[i][1] = abs(X[i+1] - X[i])
    total = total + pos[i][1]

pos = sorted(pos, key=lambda x:(x[1]))

for j in range(N, M-1):
    dim = abs(X[j+1]-X[j])
    total = total + dim
    if pos[0][1] < dim:
        pos[0][0] = j
        pos[0][1] = dim
        pos = sorted(pos, key=lambda x:(x[1]))



pos = sorted(pos, key=lambda x:(x[1]), reverse = True)
for i in range(N-1):
    total = total - pos[i][1]

print(total)

Submission status: Runtime Error

Solution code:
trash = input()
input_1 = map(int,input().split(' '))
if max(input_1) < (sum(input_1) - max(input_1)):
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, M = map(int,input().split())
a = list(map(int, input().split()))
a.sort()
#print(a)
if N > M:
    ans = 0
else:
    distance = [abs(a[i+1] - a[i]) for i in range(M-1)]
    #print(distance)
    distance.sort()
    #print(distance)
    del distance[M-N:]
    ans = 0 
    for j in distance:
        ans += j
print(ans)

Submission status: Runtime Error

Solution code:
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

int main()
{
int t;
int x;
cin >>t>>x;
cout<<t/x<<endl;


    return 0;
}

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
X = list(map(int, input().split()))
ans = 0
diff = []
 
X.sort()
 
for i in range(M-1):
  dif = X[i+1] -X[i]
  diff.append(dif)
  
diff.sort()
 
for n in range(N):
  diff.pop(-1)
 
for i in range(len(diff)):
  ans += diff[i]

print(ans)

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
x = sorted(list(map(int,input().split())))
gap = [x[i+1]-x[i] for i in range(m-1)]
def dp(n):
    if n == 1:
        return max(x) - min(x)
    else:
        if len(gap) > 0:
            maxGap = max(gap)
            gap.remove(maxGap)
        else:
            maxGap = 0
        return dp(n-1) - maxGap
if n < m:
    print(dp(n))
else:
    print(0)

Submission status: Runtime Error

Solution code:
N=int(input())
l_list = list(map(int,input().split()))
max_l=max(l_list)
if sum(l_list)-max_l>max_l:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
T, X = map(int, raw_input().strip().split())
print '%.10d' % T*1./X

Submission status: Runtime Error

Solution code:
import sys

def solve(T,X):
    return T/X

def readQuestion():
    ws = sys.stdin.readline().strip().split()
    T = int(ws[0])
    X = int(ws[1])
    return (T, X,)

def main():
    solve(*readQuestion())

# Uncomment before submission
 main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

def solve(T,X):
    return T/X
    pass


def readQuestion():
    ws = sys.stdin.readline().strip().split()
    T = int(ws[0])
    X = int(ws[1])
    return (T, X,)

def main():
    solve(*readQuestion())

# Uncomment before submission
 main()

Submission status: Runtime Error

Solution code:
import sys

def solve(T,X):
    return T/X



def readQuestion():
    ws = sys.stdin.readline().strip().split()
    T = int(ws[0])
    X = int(ws[1])
    return (T, X,)

def main():
    solve(*readQuestion())

# Uncomment before submission
 main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
list = input().split()

print(list[0]/list[1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
t = T/X
print(t)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split(" "))
A=list(sorted(map(int,input().split(" "))))
L=sorted([A[s]-A[s+1] for s in range(M-1)])
print(abs(sum(L[N-1:])))

Submission status: Runtime Error

Solution code:
a=int(input().split())
b=a[0]/a[1]
print(round(-5,b))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
X=sorted(list(map(int,input().split())))
if N<M:
    D=sorted([X[i+1]-X[i] for i in range(M-1)])
    print(sum(D[i] for i in range(M-N)))
else:
    print(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a

Submission status: Runtime Error

Solution code:
S = input().split("/")
N = S[0] + S[1] + S[2]
if int(N) <= 20190430: print("Heisei")
else: print("TBD")

Submission status: Runtime Error

Solution code:
S = input().split("/")
N = S[0] + S[1] + S[2]
if int(N) <= 20190430: print("Heisei")
else: print("TBD")

Submission status: Runtime Error

Solution code:
import numpy as np

N, K = (int(x) for x in input().split())
A = np.array(list(int(x) for x in input().split()), dtype='uint64')

fmax = 0
for x in range(K+1):
    i = np.arange(N, dtype='uint64')
    fx = np.sum(np.bitwise_xor(A, i, dtype='uint64'), dtype='uint64')
    if fmax < fx:
        fmax = fx
print(fmax)

Submission status: Runtime Error

Solution code:
a = int(input())
b, c = map(int, input().split())
s = input()
print(a+b+c, end = ' ')
print(s)

Submission status: Runtime Error

Solution code:
import numpy as np
N, M = map(int,input().split())
P = list(map(int,input().split()))
P.sort()
Q = [0] + P[:len(P)-1]
P = np.array(P)
Q = np.array(Q)
R = P-Q
R[0] = 0
for i in range(1,N):
    index = np.argmax(R)
    R[index] = 0
print(sum(R))

Submission status: Runtime Error

Solution code:
N = input().split()

l = list(map(int,input().split()))

c = 0

for i in l:
	if i >= (sum(l) - i):
		c += 1
    
if c == 0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
t = float(input())
x = float(input())

print(t / x)

Submission status: Runtime Error

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

k = [(K+1)&(1<<i) for i in range(40)]

c = [0]*40
for a in A:
	for i in range(40):
		if a&(1<<i):
			c[i] += 1

m = [0]*40
for i in range(40):
	if 2*c[i]<N:
		m[i] = (1<<i)*(N-c[i])
	else:
		m[i] = (1<<i)*c[i]

x = sum(A)
for i in reversed(range(40)):
	if k[i] != 0:
		x = max(x, sum(m[:i]+[(1<<i)*(N-c[i])]+k[i+1:]))

print(x)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = sorted(X)

if len(X) >= 2:
    diff = list()
    for i in range(len(X)-1):
        diff.append(abs(X[i+1]-X[i]))
    diff = sorted(diff)[:-(N-1)]

    print(sum(diff))
else:
    print(0)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(n) for n in input().split()]
maxA = max(A)
if maxA < sum(A) - maxA:
	print("yes")
else:
	print("no")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
T = input('Tの入力')
X = input('Xの入力')
t = int(T) / int(X)
print(t)

Submission status: Runtime Error

Solution code:
'''T, Xの入力'''
T = input('Tの入力')
X = input('Xの入力')
t = T / X
print(t):

Submission status: Runtime Error

Solution code:
a=input()
c=list(map(int, input().split()))
 
#from statistics import mean, median,variance,stdev
 
if sum(c)-max(c)< max(c):
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
a=input()
c=list(map(int, input().split(" ")))
 
from statistics import mean, median,variance,stdev
 
if sum(list1)-max(list1)< max(list1):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
# M: the number of KOMA
# N: the number of Xs
M, N = map(int, input().split())
# each length of edges
Xs= list(map(int, input().split()))

# searching largest one
largestX = -10**5

# searching smallest one
smallestX = 10**5

# straightforward searching way
for i in range(N):
  if Xs[i] > largestX:
    largestX = Xs[i]
  if Xs[i] < smallestX:
    smallestX = Xs[i]


if M > N:
    print(0)
elif (largestX - smallestX) % M == 0:
    print( int((largestX - smallestX) / M) )
else:
    print( int((largestX - smallestX) / M )+ 1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(f'{T/X/1.0}000')

Submission status: Runtime Error

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

input(T/X)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from copy import deepcopy
N, K = map(int, input().split())
positiveD = [[] for _ in range(N+1)]
negativeD = [[] for _ in range(N+1)]
Const = []
for _ in range(K):
    inputList = [int(i) for i in input().split()]
    if inputList[0] == 0:
        Const = inputList
    elif inputList[1] > 0:
        positiveD[inputList[0]].append(inputList)
    else:
        negativeD[inputList[0]].append(inputList)

def ChooseGroup(DList): #i次項の中でxjを共通に持つ項を選ぶ
    Group = []
    if len(DList) == 1:
        Group.append(DList.pop())
        commonfact = Group[0][2]
    else:
        for a in range(len(DList)):
            for b in range(len(DList)):
                if a != b and set(DList[a][2:]) & set(DList[b][2:]):
                    commonfact = list(set(DList[a][2:]) & set(DList[b][2:]))[0]
                    break

        for items in DList:
            if commonfact in items[2:]:
                Group.append(items)
        for items in Group:
            DList.remove(items)
    return (Group, commonfact)

def PositiveDegrade(i, x, DList): #i次の項を下げる
    while DList[i]:
        CommonGroup, CommonFactor = ChooseGroup(DList[i])
        next = i - 1
        totalaH = 0
        for items in CommonGroup:
            newList = [next, items[1]]
            for d in items[2:]:
                if d != CommonFactor: newList.append(d)
            totalaH += items[1]
            negativeTerm = deepcopy(items)
            negativeTerm.append(N+x)
            negativeTerm[1] *= -1
            for j in DList[next]: #次数を落とした項を、該当するリストに格納
                if set(j[2:]) == set(newList[2:]):
                    j[1] += newList[1]
                    break
            else: DList[next].append(newList)
            negativeD[i].append(negativeTerm)
        for j in DList[2]:
            if j[2:] == [CommonFactor, N+x]:
                j[1] += totalaH
                break
        else: DList[2].append([2, totalaH, CommonFactor, N+x])
        x += 1

def NegativeDegrade(i, x, DList):
    while DList[i]:
        item = DList[i].pop()
        for j in positiveD[1]:
            if j[2] == N+x:
                j[1] += -item[1] * (i-1)
                break
        else: positiveD[1].append([1, -item[1] * (i-1), N + x])
        for d in item[2:]:
            DList[2].append([2, item[1], d, N + x])
        x += 1
    return x
        
x = 1
for i in reversed(range(3, N+1)):
    PositiveDegrade(i, x, positiveD)

for i in range(3, N+1):
    x = NegativeDegrade(i, x, negativeD)

Merged = [deepcopy(positiveD[1]), deepcopy(positiveD[2])]
for item in negativeD[1]:
    for compare in Merged[0]:
        if item[2:] == compare[2:]:
            compare[1] += item[1]
            if compare[1] == 0:
                Merged[0].remove(compare)
            break
    else: Merged[0].append(item)
for item in negativeD[2]:
    for compare in Merged[1]:
        if item[2:] == compare[2:]:
            compare[1] += item[1]
            if compare[1] == 0:
                Merged[1].remove(compare)
            break
    else: Merged[1].append(item)

L = len(Const) + len(Merged[0]) + len(Merged[1])
print(N+x-1, L)
if Const:
    print(" ".join(map(str, Const[0])))
for item in Merged[0]:
    print(" ".join(map(str, item)))
for item in Merged[1]:
    print(" ".join(map(str, item)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

T, X = sys.argv[1], sys.argv[2]
T, X = int(T), int(X)
time = T/X
print(time)

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
x = list(map(int,input().split()))
x.sort()
a = []
ans = 0
for i in range(m-1):
  a.append(x[i+1]-x[i])
a.sort()
if n >= m:
  print(0)
else:
  for i in range(m-n):
    ans += a[i]
  print(ans)

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
x = list(map(int,input().split()))
x.sort()
a = []
ans = 0
for i in range(m-1):
  a.append(x[i+1]-x[i])
a.sort()
if n >= m:
  print(0)
else:
  for i in range(m-n+1):
    ans += a[i]
  print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

N, K = [int(a) for a in input().split()]
A = [int(a) for a in input().split()]

K_str = format(K, 'b')
max_order = len(K_str)

B = np.array([list(format(a, '0{}b'.format(max_order)))
              for a in A]
             ).astype('i')[:, :max_order]
B = B.sum(axis=0)
B = np.where(B < N/2, 1, 0)

X_str = ''.join(map(str, B))
X = int(X_str, 2)

print(sum(map(lambda a: X ^ a, A)))

Submission status: Runtime Error

Solution code:
def calc(X,ls):
    _sum = 0
    for i in ls:
        _sum +=  int(bin(X^i), 0)
    return _sum


N, K = map(int, input().split())
A_ls = [int(i) for i in input().split()]
if len(A_ls) == 1:
    print(A_ls[0])
else:
    _max = 0
    for i in range(K):
        result = calc(i, A_ls)
        if _max < result:
            _max = result
    print(_max)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
num = input()

line = map(int, input().split())

line.sort(reverse=True)

if line[0] < sum(line):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
print("入力してね")
x=input()
t=input()
X = int(x)
T = int(t)

print(t/x)