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:
import math
import numpy as np

L = int(input())
a0 = L/3

print(a0*a0*a0)

Submission status: Accepted

Solution code:
import decimal

L=int(input())

#decimal.getcontext().prec = 9
x = decimal.Decimal(L / 3)

V=decimal.Decimal(x*x*x)

print("{:.12f}".format(V))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal
decimal.getcontext().prec = 6

L = int(input()) 

vertical = L / 3.0
horizontal = L / 3.0
height = L / 3.0

print(vertical * horizontal * height)

Submission status: Accepted

Solution code:
L=int(input())

x=L/3

print(round(x*x*x,7))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L=int(input())
a=L/3.0
print('{:.12f}'.format(a*a*a))

Submission status: Accepted

Solution code:
L = int(input())

x = L/3
y = L/3
z = L/3
print(x*y*z)

Submission status: Accepted

Solution code:
n = int(input())

m = n/3
print(m*m*m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def maxvolume(s):  
    length = s / 3
    s -= length 
    breadth = s / 2
    height = s - breadth 
      
    return "{:.12f}".format(length * breadth * height) 
s = int(input())
print(maxvolume(s))

Submission status: Accepted

Solution code:
L = float(input())
M = float(L/3)
print('{:.12f}'.format(M**3))

Submission status: Accepted

Solution code:
def main():
    L = int(input())
    r = L / 3
    V = r ** 3
    print(V)
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
l=int(input())
ans=l*l*l
ans=ans/27
print("%.18f"%(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
ans = (n/3)**3
print("{:.20}".format(ans))

Submission status: Accepted

Solution code:
import sys; sys.setrecursionlimit(2147483647); input = sys.stdin.readline
from math import floor, ceil, sqrt, factorial, log
from collections import Counter, defaultdict, deque
from operator import itemgetter
INF = float('inf'); MOD = 10**9+7
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(MI())
def LIR(n): return [LI() for i in range(n)]
def IS(): return input().rstrip()

def main():
    L = I()
    print((L/3)**3)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import decimal
a = int(input())
print(decimal.Decimal(str((a/3)**3)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

def main():
	L = inputInt()

	tmp = L / 3

	print(tmp*tmp*tmp)


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))

# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = int(input())
var = float(inp/3)
vol = var**3
print(vol)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

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

Submission status: Accepted

Solution code:
l = int(input())

print(float((l/3) * (l/3) * (l/3)))

Submission status: Accepted

Solution code:
import decimal as dec

l = int(input())
ll = dec.Decimal(l/3)
pro = dec.Decimal(ll * ll * ll)
print(pro)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = float(input())
s = n/3

print(s*s*s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
import queue
import copy
import bisect
import heapq


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

def bfs(sx, sy, n):
  que = deque([[sy,sx]])
  while que:
    y,x = que.popleft()
    for i,j in D:
      if(x+i<0 or y+j<0 or x+i>W-1 or y+j>H-1):
        continue
      dist = G[y+j][x+i]
      if(G[y+j][x+i] != "X"):
        if(type(G[y+j][x+i]) is str):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        elif(dist>G[y][x]+1):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        

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


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#V, E, r = map(int, input().split())
#INF = V * 10001

L = int(input())
#L = L*100
#dp = [[[0] for i in range(L)] for j in range(L)]
ans = (L/3)**3

#for i in range(math.floor(L/3), math.ceil(2*L/3)):
#  for j in range(math.floor(L/3)-1, L-i):
#    ans = max(ans, i*j*(L-i-j))



print(ans)

Submission status: Accepted

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

from sys import stdin
from decimal import *


def main():
    L = Decimal(stdin.readline())

    V = ( L / 3 ) ** 3
    print('{:.12f}'.format(V))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
import sys

import numpy as np
from scipy.optimize import minimize


scan = sys.stdin.readline


def main():
    l = int(scan().rstrip())

    v = lambda x: (x[0] ** 2) * x[1] + (x[1] ** 2) * x[0] - l * x[0] * x[1]
    cons = (
        {"type": "ineq", "fun": lambda x: x[0]},
        {"type": "ineq", "fun": lambda x: x[1]},
        {"type": "ineq", "fun": lambda x: l - x[0] - x[1]}
    )

    result = minimize(v, x0=np.array([l/3, l/3]), constraints=cons, method="SLSQP")
    print(-result["fun"])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import *
l = int(input())
num = Decimal(l) / Decimal(3)
ans = num**3

print(format(ans, '.12f'))

Submission status: Accepted

Solution code:
print("{:.10f}".format((float(input())/3)**3))

Submission status: Accepted

Solution code:
L=int(input())

ans=(L/3)**3

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
L = int(input())
l = L / 3
ans = l * l * l
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = float(input())
print("%0.6f" % ((l*l*l)/float(27)))

Submission status: Accepted

Solution code:
L = int(input())

x, y, z = L/3, L/3, L/3

print(x*y*z)

Submission status: Accepted

Solution code:
from decimal import *
L = int(input())

print(Decimal(L/3)*Decimal(L/3)*Decimal(L/3))

Submission status: Accepted

Solution code:
l = int(input())

d = l / 3

print(d ** 3)

Submission status: Accepted

Solution code:
l = int(input())

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

Submission status: Accepted

Solution code:
l = int(input())
x = l/3;
print("%.12f" %float(x*x*x))

Submission status: Accepted

Solution code:
l=float(input())
l=(l*l*l)/27
print ("{0:.6f}".format(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


l = int(input())

print((l/3) **3)

Submission status: Accepted

Solution code:

l = int(input())

# 縦 横 高さ
v = l / 3
w = l / 3
h = l - v - w

ans = v * w * h

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import math

l = int(input())

e = float(l) / 3

print(e * e * e)

Submission status: Accepted

Solution code:
import sys, re
import math
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
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
 
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

# -*- coding: utf-8 -*-

l = int(input())

side = l / 3
ans = side * side * side

print(ans)

Submission status: Accepted

Solution code:
L = int(input())

l = round(L/3, 8)
print(round(l*l*l, 6))

Submission status: Accepted

Solution code:
from decimal import (Decimal, ROUND_DOWN)

def round_down6(value):
    value = Decimal(value).quantize(Decimal('0.000001'), rounding=ROUND_DOWN)
    return str(value)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import collections
import itertools as it
import math
import numpy as np

# A = input()
A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()


print(A/3 * A/3 * (A-(A/3)*2))

Submission status: Accepted

Solution code:
l = int(input())
a = l/3
b = (l-a)/2
c = l-(a+b)
print (a*b*c)

Submission status: Accepted

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

print(l**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
L = int(input())

def max_volume(L):
    return (L/3)**3
    
print(max_volume(L))

Submission status: Accepted

Solution code:
l = int(input())
v = 0

r = l/3
vr = r ** (3)

for i in range(0,l+1):
    for j in range(0,l-i+1):
       if v < i*j*(l-i-j):
           v = i*j*(l-i-j)
    
if vr >= v:
    print(vr)
else:
    print(v)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal
L = int(input())

VM1 = decimal.Decimal(L**3)
VM2 = decimal.Decimal(27)

print('{:.10f}'.format(VM1/VM2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
l = int(input())
i = l
n = math.ceil(l/9) - 1
l = l / 3
if l ** 3 == i:
    n = 0
#print(n)
print(l**3)

Submission status: Accepted

Solution code:
l = int(input())
result = ((l /3) ** 3)
print(round(result,7))

Submission status: Accepted

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

print(L**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L=int(input())

W=L/3
H=L/3
V=L/3

print(W*H*V)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

num = x // 3
rem = x % 3

if rem == 1:
    res = (num+1)*(num**2)

elif rem == 2:
    res = ((num + 1) ** 2) * num

else:
    res = num ** 3

res2 = (x/3)**3
if res > res2:
    print(res)
else:
    print(res2)

Submission status: Accepted

Solution code:
import sys
import os


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

    L = int(sys.stdin.buffer.readline().rstrip())
    print(L ** 3 / 27)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)

n = float(input())
a = n / 3
ans = a*a*a
print(str(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
i=int(input())
print(pow(i,3)/27)

Submission status: Accepted

Solution code:
x = int(input())
num = x // 3
rem = x % 3
if rem == 1:
    res = (num+1)*(num**2)
elif rem == 2:
    res = ((num + 1) ** 2) * num
else:
    res = num ** 3
res2 = (x/3)**3
if res > res2:
    print(res)
else:
    print(res2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

l = int(input())
l = l / 3.0
l = math.pow(l, 3)
print(l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
a = l/3
b = l/3
c = l - a - b
cub = a * b * c
print(cub)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

    print( (L/3)**3 )


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math

import itertools

#import bisect

import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]

def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)


def main():
    l=int(input())
    vol=l*l*l
    print(vol/27)




if __name__ == "__main__":

    main()

Submission status: Accepted

Solution code:
def main():
    s=float(input())
    l=b=h=s/3
    print(l*b*h)
main()

Submission status: Accepted

Solution code:
l = int(input())
print('{:.12f}'.format(float((l/3)*(l/3)*(l/3))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
L = int(stdin.readline().rstrip())

print((L/3)**3)

Submission status: Accepted

Solution code:
a = int(input())

print('{:.12f}'.format(a/3 * a/3 * a/3))

Submission status: Accepted

Solution code:
import math

n = 15  # 切り捨てしたい桁

L = int(input())
a = math.floor(L / 3 * 10 ** n) / (10 ** n)
b = math.floor(((L - a) / 2) * 10 ** n) / (10 ** n)
c = L - a - b

print(a * b * c)

Submission status: Accepted

Solution code:

str_l = input()
L = int(str_l)

tmp = L / 3.0
V = tmp * tmp * tmp

print(V)

Submission status: Accepted

Solution code:
n = int(input())

if n % 3 == 0:
  x = n //3
elif n % 3 == 1:
  x = n // 3 + 0.33333333333333
else:
  x = n // 3 + 0.66666666666666

v = x ** 3
print(v)

Submission status: Accepted

Solution code:
L = int(input())

num = L // 3
rem = L % 3

if rem == 1:
    res = (num+1)*(num**2)

elif rem == 2:
    res = ((num + 1) ** 2) * num

else:
    res = num ** 3

res2 = (L/3)**3
if res > res2:
    print(res)
else:
    print(res2)

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions

l = int(stdin.readline().rstrip())
x = l / 3
print(x ** 3)

Submission status: Accepted

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


def solve(L: int):
    # if L % 3 == 0:
    #     print(math.pow(L/3,3))
    #     return
    # if L % 3 == 1:
    #     print(math.pow(L//3,2) * (1+L//3))
    #     return
    # if L % 3 == 2:
    #     print(math.pow(1+L//3,2) * (L//3))
    #     return
    #L_3 = L / 3
    #print(L_3*L_3*(L-L_3*2))
    print(pow(L,3)/27.0)
    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())
l1 = l / 3
print(l1**3)

Submission status: Accepted

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

num = 0.0
num = l / 3

print(num**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor, ceil
L = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
ans = (a/3)**3
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

print((n / 3) ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
import sys
import heapq
import bisect
import math
import itertools
import string
import queue
import copy
import time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7


def inp(): return int(sys.stdin.readline())


def inpl(): return list(map(int, sys.stdin.readline().split()))


def inpl_str(): return list(sys.stdin.readline().split())


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

Submission status: Accepted

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

ret = (l / 3.0) ** 3

print("{}".format(ret))

Submission status: Accepted

Solution code:
L = int(input())

d = L/3

V = d*d*d

print(V)

Submission status: Accepted

Solution code:
L=int(input())

l=L/3

print(l*l*l)

Submission status: Accepted

Solution code:
import numpy as np

L = np.float128(input()) / 3

print(np.power(L, 3))

Submission status: Accepted

Solution code:
def fl(x):
    digits = 30
    form = '%.'+str(digits-1)+'e'
    return float((form % x))

L=int(input())
print(fl((L*L*L/27)))

Submission status: Accepted

Solution code:
from decimal import*
l = int(input())
r = Decimal(l/3)
print(Decimal(r*r*r))

Submission status: Accepted

Solution code:
L = int(input())
  
x = L/3

ans = x **3
print(ans)

Submission status: Accepted

Solution code:
L=int(input())

v=(L**3)/27

print(v)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = float(input())
ans = L * L * L / 27.0
print(ans)

Submission status: Accepted

Solution code:
s = int(input())
a = s/3
b = (s-a)/2
print(a*b*(s-a-b))

Submission status: Accepted

Solution code:
x = int(input())

num = x // 3
rem = x % 3

if rem == 1:
    res = (num+1)*(num**2)

elif rem == 2:
    res = ((num + 1) ** 2) * num

else:
    res = num ** 3

res2 = (x/3)**3
if res > res2:
    print(res)
else:
    print(res2)

Submission status: Accepted

Solution code:
def solver():
    l = int(input())
    print(pow(l, 3) / 27)


if __name__ == '__main__':
    solver()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal

l = int(input())

ls = Decimal(l) / Decimal(3)
print("{:.10f}".format(ls * ls * ls))

Submission status: Accepted

Solution code:

tot = int(input())

print(tot/3*tot/3*tot/3)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
l = int(input())

a = l /3
print("{:.12f}".format(a ** 3))

Submission status: Accepted

Solution code:
s = int(input())

out = s/3 * s/3 * s/3 
print(out)

Submission status: Accepted

Solution code:
L = int(input())

result = (L/3)** 3
print("{:.6f}".format(result))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import fractions

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

def ValueToBits(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

def BitsToValue(arr):
    n = len(arr)
    ans = 0
    for i in range(n):
        ans+= arr[i] * 2**i
    return ans

def ValueToArray10(x, digit):
    ans = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        ans[digit-i-1] = now%10
        now = now //10
    return ans
'''
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p = 2
N = 10 ** 6 + 2
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
'''


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

n = int(input())
m = n/3
print(m*m*m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
side=n/3
print('%.10f' %(side**3))

Submission status: Accepted

Solution code:
import decimal
x = int(input())


int_val = decimal.Decimal(x / 3)
answer = int_val * int_val * int_val

print(answer)

Submission status: Accepted

Solution code:
N = int(input())

print( N*N*N/27)

Submission status: Accepted

Solution code:
L = int(input())

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

Submission status: Accepted

Solution code:
import sys
L = int(input())

print(L**3/27)

Submission status: Accepted

Solution code:
L = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

l = float(s)/3
print( l ** 3 )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

max = l / 3

print(max ** 3)

Submission status: Accepted

Solution code:
l = int(input())

l_three_mul = l ** 3
#print(l_three_mul)
l_big = l_three_mul * 10**6
#print(l_big)

num = (l_big // 27)
#print(num)

num = num / (10**6)

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
L = int(input())

length = L*1000
max_vol=0
for w in range(1,math.ceil((length+1)/3)):
    if max_vol<w*((length-w)/2)**2:
        max_vol = w*((length-w)/2)**2
print(max_vol/1000000000)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
L = int(input())

print('{:.12f}'.format((L**3)/27))

Submission status: Accepted

Solution code:
l = float(input())

x = l/3

print(x**3)

Submission status: Accepted

Solution code:
l = int(input())

print(l ** 3 / 27)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input
L = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
L = Decimal(input())

print((L/3)**3)

Submission status: Accepted

Solution code:
import decimal
l=input()
l=decimal.Decimal(l)
m=decimal.Decimal(3)
print((l/m)**3)

Submission status: Accepted

Solution code:
L = int(input())

print(L ** 3 / 27)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s  = int(input())
s = s / 3
print('{:.12f}'.format(s ** 3))

Submission status: Accepted

Solution code:
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
# from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

n, = I()
print((n / 3) ** 3)

Submission status: Accepted

Solution code:
L = int(input())

L_div3 = L / 3
L_route3 = L_div3 ** (1/3)
zan = L_div3 - L_route3

hen = L_route3 + zan

print(hen ** 3)