Problem:


Score : 300 points

Problem Statement

Given is a positive integer L.
Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.

Constraints

1 ≤ L ≤ 1000

L is an integer.

Input

Input is given from Standard Input in the following format:

L

Output

Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.

Sample Input 1

3

Sample Output 1

1.000000000000

For example, a rectangular cuboid whose dimensions are 0.8, 1, and 1.2 has a volume of 0.96.

On the other hand, if the dimensions are 1, 1, and 1, the volume of the rectangular cuboid is 1, which is greater.

Sample Input 2

999

Sample Output 2

36926037.000000000000



Sample input:
3


Sample output:
1.000000000000

Submission status: Accepted

Solution code:
L = int(input())
print((L**3/3**3))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
N = int(input())

print((N / 3) ** 3)

Submission status: Accepted

Solution code:
L = int(input())
out = L**3/27
print(out)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
from decimal import Decimal, getcontext
getcontext().prec = 1000


def solve():
    L = int(input())
    a = Decimal(L/3)
    print(Decimal(a**3))


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
l = int(input())
print((l/3)**3)

Submission status: Accepted

Solution code:
L = int(input())

ans = L ** 3 / 3 ** 3

print(ans)

Submission status: Accepted

Solution code:
l=float(input())
a=l/3
b=l/3
c=l/3
a=a*b*c
print ('%.6f'%a) 
# print(a*b*c)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    from sys import stdin
    input = stdin.readline

    l = int(input())
    print((l**3)/27)

Submission status: Accepted

Solution code:
L = int(input())
print((L ** 3) / 27)

Submission status: Accepted

Solution code:
#C
x = int(input())


print((x/3)**3)

Submission status: Accepted

Solution code:
def main():
    l = int(input())
    print((l/3)**3)


main()

Submission status: Accepted

Solution code:
from sys import exit, setrecursionlimit
setrecursionlimit(10**6)

def array2D(row, col ,val=0):
    return [[val]*col for i in range(row)]

l = int(input())
print((l/3)**3)

Submission status: Accepted

Solution code:
def main():
    L = int(input())

    return (L / 3) ** 3

print(main())

Submission status: Accepted

Solution code:
from decimal import Decimal as D
s=D(input())
print(s**3/27)

Submission status: Accepted

Solution code:
L = int(input())

print((L**3) / 27)

Submission status: Accepted

Solution code:
def examA():
    N, M = LI()
    ans = N*(N-1)//2 + M*(M-1)//2
    print(ans)
    return

def examB():
    def judge(A):
        #print(A)
        n = len(A)
        for i in range(n//2):
            if A[i]!=A[n-i-1]:
                return False
        return True
    S = SI()
    N = len(S)
    if not judge(S):
        print("No")
        return
    if judge(S[:(N-1)//2]) and judge(S[(N+1)//2:]):
        print("Yes")
    else:
        print("No")
    return

def examC():
    L = I()
    ans = (L/3)**3
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**6)

if __name__ == '__main__':
    examC()

"""

"""

Submission status: Accepted

Solution code:
l = int(input()) 

print(l ** 3 / 27)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

L = int(input())
a = L/3
print(a**3)

Submission status: Accepted

Solution code:
n = int(input())
m = n / 3
print(m**3)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

l = int(input())
m = l / 3.0
print(m ** 3.0)

Submission status: Accepted

Solution code:
def main():
    l = int(input())
    x = l/3
    print(x**3)
    
main()

Submission status: Accepted

Solution code:
p = int(input())
print((p/3)**3)

Submission status: Accepted

Solution code:
import sys

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

L = ir()
V = (L/3) ** 3
print(V)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

ans = l ** 3 / 27
print(ans)

Submission status: Accepted

Solution code:
l = int(input())
#s = input()
#a,b = map(int,input().split())
#da = list(map(int,input().split()))
#a = [int(input()) for i in range(n)]

print((l/3)**3)

Submission status: Accepted

Solution code:
L = int(input())
print('%.20f' % ((L/3)**3))

Submission status: Accepted

Solution code:
l = int(input())
x = l/3
print(x*x*x)

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

l = int(input())

print((l/3) ** 3)

Submission status: Accepted

Solution code:
def main():
    L = int( input())
    print((L/3)**3)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = int(input())

print((A / 3) ** 3)

Submission status: Accepted

Solution code:
l = int(input())

ll = l/3

print(ll**3)

Submission status: Accepted

Solution code:
L = int(input())
ans = (L / 3) ** 3
print('{:.10f}'.format(ans))

Submission status: Accepted

Solution code:
L = int(input())
a,b,c = L/3,L/3,L/3
print(a*b*c)

Submission status: Accepted

Solution code:
L = int(input())
ans = L*L*L/27
print(ans)

Submission status: Accepted

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


def solve(L: int):
    x = L / 3
    print(x**3)
    return


# Generated by 1.1.6 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()
    L = int(next(tokens))  # type: int
    solve(L)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l = int(input())
print((l*l*l)/27)

Submission status: Accepted

Solution code:
import sys
import itertools
import bisect
from operator import itemgetter
 
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
def combi(n, r):
  r = min(r, n-r)
  numer = denom = 1
  for i in range(1, r+1):
    numer = numer * (n+1-i) %mod
    denom = denom * i %mod
  return numer * pow(denom, mod-2, mod) %mod

N = I()
n = N/3

print(n**3)

Submission status: Accepted

Solution code:
import math

L = float(input())
print('{:.10f}'.format(L ** 3 / 27.0))

Submission status: Accepted

Solution code:
import numpy as np
L = int(input())
x = L/3

ans = x**3
print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(700000)

def s_in():
    return input()

def n_in():
    return int(input())

def l_in():
    return list(map(int, input().split()))

def print_l(l):
    print(' '.join(map(str, l)))

class Interval():
    def __init__(self, li):
        self.li = li
        self.n = len(li)
        self.sum_li = [li[0]]
        for i in range(1, self.n):
            self.sum_li.append(self.sum_li[i-1] + li[i])

    def sum(self, a, b=None):
        if b is None:
            return self.sum(0, a)

        res = self.sum_li[min(self.n-1, b-1)]
        if a > 0:
            res -= self.sum_li[a-1]
        return res

l = n_in()
print((l/3)**3)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.buffer.readline
 
def main():
    N = int(input())
    print((N**3)/27)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
l = int(input()) / 3
print(l**3)

Submission status: Accepted

Solution code:
l = int(input())

ans = (float(l) / 3.0)**3
print(ans)

Submission status: Accepted

Solution code:
L = input()
print "%.10f"%((L/3.0)**3)

Submission status: Accepted

Solution code:
def main():
    l = int(input())
    print((l / 3) ** 3)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L = int(input())

print(((L**3)/(27)))

Submission status: Accepted

Solution code:
L=int(input())
ans = (L/3)**3
print(ans)

Submission status: Accepted

Solution code:
l = int(input())
ans = l / 3
print(ans ** 3)

Submission status: Accepted

Solution code:
l = float(input())
print('%.18f' % (l / 3.) ** 3)

Submission status: Accepted

Solution code:
l=int(input())
x=l/3
print(x**3)

Submission status: Accepted

Solution code:
def main():
    L = int(input())
    ret = (L / 3) ** 3
    print(ret)


if __name__ == '__main__':
    main()

# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

L = int(input())
print("{:.20f}".format((L / 3.0) ** 3))

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    n = inp()
    print((n/3)**3)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
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()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n=II()
    print(pow(n/3,3))

main()

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

L = ni()
print("{:.14f}".format((L/3)*(L/3)*(L/3)))

Submission status: Accepted

Solution code:
import math
import sys 
l = int(input())
print((l/3)**3)

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict, deque

L, = [float(x) for x in input().split()]

print((L / 3) ** 3)

Submission status: Accepted

Solution code:
L = int(input())

X = L / 3

print(X * X * X)

Submission status: Accepted

Solution code:

L = int(input())

print ((L/3)**3)

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    L=I()
    print((L/3)**3)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 19 20:52:57 2020

@author: over-
"""

L=float(input())
l=L/3
S=l*l*l
print(S)

Submission status: Accepted

Solution code:
n = int(input())
a = n/3
print("%.12f" % (a*a*a))

Submission status: Accepted

Solution code:
l = int(input())
j = l/3
ans = j*j*j
print(ans)

Submission status: Accepted

Solution code:
import sys
input=lambda: sys.stdin.readline().rstrip()
l=int(input())
print((l/3)**3)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    L=int(input())
    print((L/3)**3)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7 
sys.setrecursionlimit(1000010)

L = float(input())
print((L/3)**3)

Submission status: Accepted

Solution code:
N = int(input())
L = N/3
print(L**3)

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

L = int(sys.stdin.buffer.readline())

ans = (L / 3) ** 3
print(ans)

Submission status: Accepted

Solution code:
l = int(input())
m = l / 3
print(m**3)

Submission status: Accepted

Solution code:
l=int(input())
print((l/3)**3)

Submission status: Accepted

Solution code:
L = (int(input()))
print((L/3)**3)

Submission status: Accepted

Solution code:
n = int(input())
print((n ** 3) / 27)

Submission status: Accepted

Solution code:
import sys
from decimal import Decimal, getcontext
getcontext().prec = 32


def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


L = Decimal(I())

a = L / Decimal(3)
b = L / Decimal(3)
c = L - a - b

print(a * b * c)

Submission status: Accepted

Solution code:
l = int(input())

ans = (l/3)**3
print(ans)

Submission status: Accepted

Solution code:
L = int(input())

ans = (L/3)**3
print(ans)

Submission status: Accepted

Solution code:
L=int(input())

l=L/3

print(l**3)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read


#n,*a = [int(i) for i in read().split()]

l = int(input())


print((l/3)**3)

Submission status: Accepted

Solution code:

import sys
def II(): return int(sys.stdin.readline())


l = II()
print(l*l*l/27)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
L=int(input())

a=L/3

print(a**3)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols
    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])
    return ret


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_map_as_int(H):
    '''
    #→1,.→0として読み込む
    '''
    ret = []
    for _ in range(H):
        ret.append([1 if s == '#' else 0 for s in read()[:-1]])
        # 内包表記はpypyでは若干遅いことに注意
        # #numpy使うだろうからこれを残しておくけど
    return ret


MOD = 10**9 + 7
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

L = read_a_int()
print((L / 3)**3)

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

    L = int(input())
    print((L/3)**3)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l = int(input())

print((1/3 * l)**3)

Submission status: Runtime Error

Solution code:
num = int(input())

number = num / 3
print(number * number * number)a

Submission status: Runtime Error

Solution code:
l = int(input())
print((l/3)***3)

Submission status: Runtime Error

Solution code:
from decimal import Decimal
a= input().split() 
b=Decimal(a/3)
print(b*b*b)

Submission status: Runtime Error

Solution code:
l=int(input())
print(L**3/27)

Submission status: Runtime Error

Solution code:
print((int(input))**3/27)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = input()

returnVal = (L/3)**3
print(returnVal)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<stdio.h>



int main(void){
  float l;
  scanf("%f",&l);
  
  printf("%f\n",l/3*l/3*l/3);


  
 



}

Submission status: Runtime Error

Solution code:
l=int(input())
ans=0
sum=0

for i in range(l)
 for j in range(l)
   sum=i*j*(l-i-j)
   if ans>sum:
      ans=sum
print(ans)

Submission status: Runtime Error

Solution code:
L = int(input())

ans = 0
for i in range(1, L+1):
  for j in range(1, L+1):
    if L - i - j > 0:
      V = i*j*(L - i - j)
    if V > ans:
      ans = V
print(ans)

Submission status: Runtime Error

Solution code:
import sys
N=int(sys.stdin.readline())
L=list(map(int,sys.stdin.readline().split()))
C=list(set(L))
x=0
for i in range(len(C)):
  a = L.count(C[i])
  x += int(a*(a-1)/2)  
for K in range(N):
  print(x-L.count(L[K])+1)

Submission status: Runtime Error

Solution code:
L = int(input().split())

print((L**3)/27)

Submission status: Runtime Error

Solution code:
l = int(input())
print(f"{l**3 / 27:.10f}")

Submission status: Runtime Error

Solution code:
l = int(input())
print(f"{pow(l,3) / 27.0:.10f}")

Submission status: Runtime Error

Solution code:
l = int(input())
print(f"{pow(l / 3.0, 3):.10f}")

Submission status: Runtime Error

Solution code:
l=int(input())
ans=[]
for i in range(1,l):
    for j in range(1,l):
        ans.append(i*j*(l-i-j))
print(max(ans))

Submission status: Runtime Error

Solution code:
l=int(input())
ans=[]
for i in range(1,l//2+1):
    for j in range(1,l//2+1):
        ans.append(i*j*(l-i-j))
print(max(ans))

Submission status: Runtime Error

Solution code:
import decimal
def main():
    L = int(input())
    decimal.getcontext().prec = 6
    print('{:.010f}'.format(decimal.Decimal(L*L*L/27)))

main()

Submission status: Runtime Error

Solution code:
import decimal
def main():
    L = int(input())
    decimal.getcontext().prec = 6
    print('{:.020f}'.format(decimal.Decimal(L*L*L/27)))

main()

Submission status: Runtime Error

Solution code:
l=int(input())
ans((l/3.0)**3)

Submission status: Runtime Error

Solution code:
n=int(input())
v=[]
for i in range(1,n):
    for j in range(1,n):
        k=n-i-j 
        if k>0:
            v.append(i*j*k)
print(max(v))

Submission status: Runtime Error

Solution code:
l = map(int, input().split())
print(l ** 3 / 27)

Submission status: Runtime Error

Solution code:
print((L**3)/27)

Submission status: Runtime Error

Solution code:
L = int(input())
print((l/3)**3)

Submission status: Runtime Error

Solution code:
L = int(input())
if L % 3 == 0:
  A = L / 3
  B = A ** 3
  print('{:.12f}'.format(B))
else:
  C = L / 3
  D = C ** 3
  print('{:.12f}'.format(B))

Submission status: Runtime Error

Solution code:
a=int(input())

print((L**3)/27)

Submission status: Runtime Error

Solution code:
print(L**3/27)

Submission status: Runtime Error

Solution code:
L=int(input())
a=L/3
b=a**3
print("{;.12f}".format(b))

Submission status: Runtime Error

Solution code:
L=int(input())
a=L/3
b=a**3
print(b[:.13f])

Submission status: Runtime Error

Solution code:
import math

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

kylg=L/3
ans=kylg**3

print(ans)

Submission status: Runtime Error

Solution code:
import math

def combinations_count(n, r):
    #print(math.factorial(n) // (math.factorial(n - r) * math.factorial(r)))
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


N=int(input())
a=[int(i) for i in input().split()]
b=[0 for i in range(N)]
c=[0 for i in range(N)]

wa=0
for i in range(N):
    b[a[i]-1]=b[a[i]-1]+1
    if(i>1):
        c[i]=combinations_count(i,2)
    else:
        c[i]=0
print(c)
print(b)
for j in range(N):
    for i in range(N):
#        print('a')
        if(b[i]>1):
            #print('{},{}'.format(j,i))
            #print(b[i])

            if(a[j]==i+1):
                if(b[i]-1>1):
                    wa=c[b[i]-1]+wa
            else:
                wa=c[b[i]]+wa


    print(wa)
    wa=0

Submission status: Runtime Error

Solution code:
l = input()

v = (l/3)**2

print(v)

Submission status: Runtime Error

Solution code:
l = int(input())
ans = []
for i in range(1, l//3+1):
    for j in range(1, l//3+1):
        ans.append(i*j*(l-i-j))
print(max(ans))

Submission status: Runtime Error

Solution code:
n = input()
n = n/3
a = n**3
print(a)

Submission status: Runtime Error

Solution code:
a=int(input())
b,c,d=a/3
print(a*b*c)

Submission status: Runtime Error

Solution code:
L=int(input())

K=(L/3)^3
print(K)

Submission status: Runtime Error

Solution code:
L = int(input())
s = []
for i in range(1,L+1):
    for j in range(1,L - i + 1):
        for k in range(1, L - i - j + 1):
            s.append(i * j * k)
print(max(s))

Submission status: Runtime Error

Solution code:
l = input()
V = (l/3)**3
print(V)

Submission status: Runtime Error

Solution code:
l = int(input())
print((l/3)^3)

Submission status: Runtime Error

Solution code:
l = float(input())
print(math.pow((l/3), 3))

Submission status: Runtime Error

Solution code:
l = int(input())

print(pow(l/3),3)

Submission status: Runtime Error

Solution code:
l = int(input())
vlist = []
for x in range(1, l - 1):
  for y in range(1, l - 1):
    z = l - x - y
    v = x * y * z
    vlist.append(v)
vmax = max(vlist)
print(vmax)

Submission status: Runtime Error

Solution code:
L = int(input())
v = (L / 3) ^ 3
print(v)

Submission status: Runtime Error

Solution code:
L = int(input())
l = [L / 3 for _ in range(L)]

for i in range(L % 3):
    l[i] += 1

v = l[0] * l[1] * l[2]
print(v)

Submission status: Runtime Error

Solution code:
L = int(input())
x = (l / 3)
print(pow(x, 3))

Submission status: Runtime Error

Solution code:
l = int(input());

ans = (l / 3) ^ 3;

print(ans);

Submission status: Runtime Error

Solution code:
l = input();

ans = (l / 3) ^ 3;

print(ans);

Submission status: Runtime Error

Solution code:
def main():
  l = input()

  print(l**3/27)

if __name__ == '__main__':
  main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print((int(input())**3)

Submission status: Runtime Error

Solution code:
l = input().split()
m = int(l)
N = m/3
v = pow(N,3)
print(v)

Submission status: Runtime Error

Solution code:
s = int(input())
side = s/3

print(side^3)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = int(input)
print((L**3)/27)

Submission status: Runtime Error

Solution code:
import os
import math

def main():
    l = int(input())
    if l%3 == 0:
        s = l/3
        print(s*s*s)
    else:
        s = math.floorl(l/3)
        s1 = s + 0.5
        print(s*s1*s1)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
import os
import math

def main():
    l = int(input())
    if l%3 == 0:
        s = l/3
        print(math.pow(s,3))
    else:
        s = math.floorl(l/3)
        s1 = s + 0.5
        print(s*s1*s1)

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
L = int(input().split())

ans = (L/3)**3
print(ans)

Submission status: Runtime Error

Solution code:
print(pow(int(input) / 3, 3))

Submission status: Runtime Error

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
 
L = input()
print((L/3)**3)

Submission status: Runtime Error

Solution code:
f = int(input()) / 3.0
print("{.9f}".format(f * f * f))

Submission status: Runtime Error

Solution code:
f = int(input()) / 3.0
return(f * f * f)

Submission status: Runtime Error

Solution code:
L=input()
x=L/6
y=L/6
z=L/6
print(x*y*z)

Submission status: Runtime Error

Solution code:
#include<iostream>

using namespace std;


main()
{
    int n;
    cin>>n;
    int l=n/3;
    n-=l;
    int w=n/2;
    int h = n-w;
    cout<<l*w*h;
}

Submission status: Runtime Error

Solution code:
def shortie (L):
 R= L/3
 return (R**3)

L=int(input())
Shortie (L)

Submission status: Runtime Error

Solution code:
def shortie (L):
 R= L/3
Return (R**3)

L+int(input())
Shortie (L)

Submission status: Runtime Error

Solution code:
#hello
#password
#input
#understandign python
#less errors
$work now please
q = int(input())
w = q / 3
print(w ** 3)

Submission status: Runtime Error

Solution code:
l = int(input())
print(pow(1/3,3)

Submission status: Runtime Error

Solution code:
def minimumSquare(a, b): 
  
    result = 0
    rem = 0
 
    if (a < b): 
        a, b = b, a  
     while (b > 0): 
      
        # Update result 
        result += int(a / b)  
  
        rem = int(a % b)  
        a = b  
        b = rem  
  
    return result  
n = 13
m = 29
  
print(minimumSquare(n, m))

Submission status: Runtime Error

Solution code:
print(float((input())**3/27))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input(int())
print(s*s*s/27)

Submission status: Runtime Error

Solution code:
l =input();
l = int(l);
print((L/3)^3)

Submission status: Runtime Error

Solution code:
L = input();
print((L/3)^3)

Submission status: Runtime Error

Solution code:
    L = int(input())

    # 普通に立方体が一番大きい
    print(pow(L/3,3))

Submission status: Runtime Error

Solution code:
line = input()

calc = int(line) * int(calc) * int(calc) / 27

print(str(calc))

Submission status: Runtime Error

Solution code:
L = int(input())
maxvalue = 0
i = 1
for i in range(L - 1):
  j = 1
  for j in range(L):
    k = L - i - j
print max(maxvalue, i * j * k)

Submission status: Runtime Error

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

# 各数字の個数を格納
dict = {}
for a in A:
    if a in dict:
        dict[a] += 1
    else:
        dict[a] = 1

# k番目の値を除いたlistで同じ数字を引く回数を出力
memo = {}
for k in range(N):
    ans = 0
    m = A[k]
    if m in memo.keys():
        ans = memo[m]
    else:
        dict_work = dict.copy()
        dict_work[m] -= 1
        for d in dict_work.values():
            if d > 1:
                ans += (d * (d - 1)) // 2
        memo[m] = ans
    print(ans)

Submission status: Runtime Error

Solution code:
n=int(intput())
l=n/3
w=(n-l)/2
h=n-l-w
print(h*l*w)

Submission status: Runtime Error

Solution code:
l = input()
print(l/3 ** 3)

Submission status: Runtime Error

Solution code:
l=map(int,input())
print((l/3)**3)

Submission status: Runtime Error

Solution code:
l = int(input())

arr = []
for a in range(1,l):
    for b in range(1,l):
        c = l - a - b
        if a + b + c == l:
            arr.append(a*b*c)

print(max(arr))

Submission status: Runtime Error

Solution code:
L = int(input())
round(hen, 4) = L / 3
print(hen**3)

Submission status: Runtime Error

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

b_l = list(range(int(b/0.1), int((b+0.99)//0.1+1)))
for b_ in b_l:
  s = int(b_*0.08//1)
  if s==a:
    print(str(b_))
    exit(0)
print(-1)

Submission status: Runtime Error

Solution code:
L=input()
print((L/3)**3)