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: Wrong Answer

Solution code:
import sys
import numpy as np
# input処理を高速化する
input = sys.stdin.readline

L=int(input())

V=0
for x in np.arange(0,L+0.1,0.1):
    for y in np.arange(0,L+0.1-x,0.1):
        z = L-x-y
        V = max(V, x*y*z)
print(V)

Submission status: Wrong Answer

Solution code:
l = int(input())

a = l//3
v = a*a*a

print(v)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
if N%3==0:
     a=b=c=N/3

elif N%3==1:
     b=c=int(N/3)
     a=b+1

elif N%3==2:
     c=int(N/3)
     a=b=c+1

print(a*b*c)

Submission status: Wrong Answer

Solution code:
ans = 0
L = int(input())

for i in range(1, L+1):
    for j in range(i, L+1):
        k = L - i - j
        if k <= 0: continue
        ans = max(ans, i*j*k)
        
print(ans)

Submission status: Wrong Answer

Solution code:
l = int(input())

print((l**3)/9)

Submission status: Wrong Answer

Solution code:
L=int(input())
x=y=z=L//3
if L%3==1:
  x+=1
elif L%3==2:
  x+=1
  y+=1
print(x*y*z)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# C - Maximum Volume
# https://atcoder.jp/contests/abc159/tasks/abc159_c

L = int(input())

center = (L/3)
pre = center - 0.1
follow = center + 0.1

# print(pre)
# print(center)
# print(follow)

print(pre*center*follow)

Submission status: Wrong Answer

Solution code:
L=int(input())
L1=(L//3)
L2=L%3
while L2>=10**-16:
    L1+=(L2/3)
    L2=(L2/3)

print(L1**3)

Submission status: Wrong Answer

Solution code:
L=int(input())
L1=(L//3)
L2=L%3
while L2>=10**-10:
    L1+=(L2/3)
    L2=(L2/3)

print(L1**3)

Submission status: Wrong Answer

Solution code:
L=int(input())
L1=(L//3)
L2=L%3
while L2>=10**-8:
    L1+=(L2/3)
    L2=(L2/3)

print(float(L1**3))

Submission status: Wrong Answer

Solution code:
L=int(input())
L1=(L//3)
L2=L%3
while L2>=10**-8:
    L1+=(L2/3)
    L2=(L2/3)

print(L1**3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

L = int(input())

if L % 3 == 0:
    print((L//3)**3)
elif L % 3 == 1:
    a = L // 3
    b = a + 1
    print(a**2*b)
else:
    a = L // 3
    b = a + 1
    print(a*b**2)

Submission status: Wrong Answer

Solution code:
def main():
    L = int(input())
    l = L
    ans = 0
    for i in range(1, (L - 1)*10):
        for j in range(1, L * 10):
            w = L - i/10 - j/10
            t = i/10 * j/10 * w
            ans = ans if ans > t else t
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    L = int(input())
    l = L
    ans = 0
    for i in range(1, L - 1):
        for j in range(1, L):
            w = L - i - j
            t = i * j * w
            ans = ans if ans > t else t
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())
l = [np.floor(L / 3) for _ in range(3)]

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
L = list(map(int, (stdin.readline().strip().split())))[0]
max=0
for x in range(1,L):
    for y in range(1,L):
        z=L-x-y
        if z<=0:break
        if max<x*y*z:max=x*y*z
print(max)

Submission status: Wrong Answer

Solution code:
l = int(input())
L = 100 * l
max = 0
V = 0
for a in range(L):
    V = a*((L - a)/2)*(L - a - ((L - a)/2))
    if max <= V:
        max = V
print(max/1000000)

Submission status: Wrong Answer

Solution code:
l=100*int(input())
candi=[[0] * l for i in range(l)]
ans=[]
for i in range(l):
  for j in range(l):
    if i+j<=l:
      candi[i][j]=float(i*j*(l-i-j))
  ans.append(max(candi[i]))
print(max(ans)/(10**6))

Submission status: Wrong Answer

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

for a in range(1, l+1):
    for b in range(1, l+1):
        v = a * b * (l-a-b)
        if mx < v:
            mx = v

print(float(mx))

Submission status: Wrong Answer

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

for a in range(1, l+1):
    for b in range(1, l+1):
        v = a * b * (l-a-b)
        if mx < v:
            mx = v

print(mx)

Submission status: Wrong Answer

Solution code:
l = int(input())

if l%3 == 0:
  print((l/3)**3)
elif l%3 == 1:
  print(((l//3)**2)*(l//3+1))
else:
  print((l//3)*(l//3+2)**2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=int(input())
L=10**3
ans=0
for a in range(1,L+1):
    for b in range(1,L-a):
        h=l-a-b
        v=a*b*h
        ans=max(ans,v)
print(ans)

Submission status: Wrong Answer

Solution code:
import os
import math

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

    if l%3 == 0:
        s = l//3
        
        print(s*s*s)
    elif l%3 == 1:
        s = l//3
        s1 = s + 0.5
        
        print(s*s1*s1)
    elif l%3 == 2:
        s = l//3
        s1 = s + 1
        
        print(s*s1*s1)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import os
import math

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

    if l%3 == 0:
        s = l//3
        print(s*s*s)
    else:
        s = l//3
        s1 = s + 0.5
        print(s*s1*s1)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
L = int(input())

volume = L ** 3 / 9

print(volume)

Submission status: Wrong Answer

Solution code:
L = int(input())

volume = L ** 3 / 3

print(volume)

Submission status: Wrong Answer

Solution code:
L = int(input())
am = L%3

if am == 0:
  print((L/3)**3)
else:
  print((((L+am)/3)**(3-am))*(((L+am)/3-1)**am))

Submission status: Wrong Answer

Solution code:
l=int(input())
v=0
x=0.01
vmax=0
while x<l/2:
    v=x**2*(l-2*x)
    if v>=vmax:
        vmax=v
        x+=0.01
    else:
        x+=0.01

print(str(vmax))

Submission status: Wrong Answer

Solution code:
l = int(raw_input())
print (l/3)**3 + 1e-21

Submission status: Wrong Answer

Solution code:
def volume(s): 
    count = 0
    for x in range(1,s - 1): 
        for y in range(1,s): 
            t = s-x-y
            count = max(count,x*y*t) 
            
    count = str(count)
    count = count+".000000000000"
    return count

s = int(input())
print(volume(s))

Submission status: Wrong Answer

Solution code:
def volume(s): 
    count = 0
    for x in range(1,s - 1): 
        for y in range(1,s): 
            t = s-x-y
            count = max(count,x*y*t) 
    return float(count) 

s = int(input())
print(volume(s))

Submission status: Wrong Answer

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

L=int(input())
shortie (L)

Submission status: Wrong Answer

Solution code:
def maxvolume( L ): 
  
 
    length = int(L / 3) 
      
    L -= length 
      

    breadth = L / 2
      
    height = L - breadth 
      
    return int(length * breadth * height) 
      

L = 4
print( maxvolume(L) )

Submission status: Wrong Answer

Solution code:

def maxvolume( L ): 
  
 
    length = int(L / 3) 
      
    L -= length 
      

    breadth = L / 2
      
    height = L - breadth 
      
    return int(length * breadth * height) 
      

L = 8
print( maxvolume(L) )

Submission status: Wrong Answer

Solution code:
a=int(input())
ans=[]
import math
x = math.floor((1000*a)/3)
print(x**3/1000000000)

Submission status: Wrong Answer

Solution code:
l=float(input())
if l%3==0:
    print((l/3)**3)
elif l%3==1:
    print(((l//3+0.3)**2)*(l//3+0.4))
else:
    print(((l//3+0.7)**2)*(l//3+0.6))

Submission status: Wrong Answer

Solution code:
from math import sqrt 

  
# function to return maximum volume 

def maxVol(P, A): 

      

    # calculate length 

    l = (P - sqrt(P * P - 24 * A)) / 12

  

    # calculate volume 

    V = l * (A / 2.0 - l * (P / 4.0 - l)) 

  

    

    return V 

  
# Driver code 

if __name__ == '__main__': 

    P = 1000

    A = 16

    print(maxVol(P, A))

Submission status: Wrong Answer

Solution code:
from math import sqrt 

  
# function to return maximum volume 

def maxVol(P, A): 

      

    # calculate length 

    l = (P - sqrt(P * P - 24 * A)) / 12

  

    # calculate volume 

    V = l * (A / 2.0 - l * (P / 4.0 - l)) 

  

    # return result 

    return V 

if __name__ == '__main__': 

    P = 20

    A = 16

    print(maxVol(P, A))

Submission status: Wrong Answer

Solution code:
def maxvolume( s ): 
    length = int(s / 3)       
    s -= length  
    breadth = s / 2
    height = s - breadth 
    return float(length * breadth * height) 
      
s = int(input())
print( maxvolume(s) )

Submission status: Wrong Answer

Solution code:
def maxvolume (s): 
    maxvalue = 0
    i = 1
    for i in range(s - 1): 
        j = 1
        for j in range(s): 
            k = s - i - j 
            maxvalue = max(maxvalue, i * j * k) 
              
    return float(maxvalue) 
      
s = int(input())
print(maxvolume(s))

Submission status: Wrong Answer

Solution code:
l=float(input())
if l%3<2:
    print(((l//3)**2)*(l//3+l%3))
else:
    print(l/3*((l/3+1)**2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=float(input())
if l%3<2:
    print(((l/3)**2)*(l/3+l%3))
else:
    print(l/3*((l/3+1)**2))

Submission status: Wrong Answer

Solution code:
l=float(input())
if l%3<2:
    print(((l//3)**2)*(l//3+l%3))
else:
    print(l//3*((l//3+1)**2))

Submission status: Wrong Answer

Solution code:
def maxvolume (s): 

    maxvalue = 0

  

   

    i = 1

    for i in range(s - 1): 

        j = 1

          

        

        for j in range(s): 

              

            

            k = s - i - j 

              

           

            maxvalue = max(maxvalue, i * j * k) 

              

    return maxvalue 

s = 8

print(maxvolume(s))

Submission status: Wrong Answer

Solution code:
l=float(input())
print(((l//3)**2)*(l//3+l%3))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def maxvolume (s): 

    maxvalue = 0

  

    # for length 

    i = 1

    for i in range(s - 1): 

        j = 1

          

        # for breadth 

        for j in range(s): 

              

            # for height 

            k = s - i - j 

              

            # calculating maximum volume. 

            maxvalue = max(maxvalue, i * j * k) 

              

    return maxvalue 
# Driven Program 

s = 8

print(maxvolume(s))

Submission status: Wrong Answer

Solution code:
def maxvolume (s): 

    maxvalue = 0

  

    # for length 

    i = 1

    for i in range(s - 1): 

        j = 1

          

        # for breadth 

        for j in range(s): 

              

            # for height 

            k = s - i - j 

              

            # calculating maximum volume. 

            maxvalue = max(maxvalue, i * j * k) 

              

    return maxvalue

Submission status: Wrong Answer

Solution code:
from math import sqrt 

  
# function to return maximum volume 

def maxVol(P, A): 

      

    # calculate length 

    l = (P - sqrt(P * P - 24 * A)) / 12

  

    # calculate volume 

    V = l * (A / 2.0 - l * (P / 4.0 - l)) 

  

    # return result 

    return V 

  
# Driver code 

if __name__ == '__main__': 

    P = 20

    A = 16

    print(maxVol(P, A))

Submission status: Wrong Answer

Solution code:
# abc159 c
L = int(input())
ans = 0
for H in range(L):
    for W in range(L-H):
        ans = max(H * W * (L-H-W), ans)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#整数の入力
N = int(input())

a = int(N/3)

print(a*a*a)

Submission status: Wrong Answer

Solution code:
import numpy as np

vol = 0
vol_max = 0
L = int(input())

for i in np.arange(1.0,L,0.1):
    for j in np.arange(1.0,i + 0.1,0.1):
        k = L - i - j
        vol = i*j*k
        if vol > vol_max and k > 0:
            #print("i,j,k", "=", i,j,k,"vol = ",vol,"vol_max = ",vol_max)
            vol_max = vol      

print(vol_max)

Submission status: Wrong Answer

Solution code:
L = int(input())

if L % 3 == 0:
    print((L/3)**3)
elif L % 3 == 1:
    print((L//3)**2 * (L//3 + 1))
else:
    print((L//3) * (L//3 + 1)**2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n//3
if n%3 == 0:
    print(a**3)
elif n%3 == 1:
    print(a**2*(a+1))
else:
    print(a*(a+1)*(a+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

s_max = 0
l = int(input())
for x in np.arange(0.1,l,0.1):
    for y in np.arange(0.1,l-x,0.1):
        h = l-x-y
        s = x*y*h
        if (s_max < s): s_max = s
    if(s_max == s):break
print(s_max)

Submission status: Wrong Answer

Solution code:
L = int(input())

import random

vol_max = 0

for i in range(1000000):
    a = random.uniform(0, L)
    b = random.uniform(0, L-a)
    c= L-a-b
    vol = a*b*c
    if vol_max < vol: vol_max = vol
    else: continue
        
print(vol_max)

Submission status: Wrong Answer

Solution code:
L = int(input())

import random

vol_max = 0

for i in range(100000):
    a = random.uniform(0, L)
    b = random.uniform(0, L-a)
    c= L-a-b
    vol = a*b*c
    if vol_max < vol:
        vol_max = vol
    else:continue
        
print(vol_max)

Submission status: Wrong Answer

Solution code:
L = int(input())

import random

vol_max = 0

for i in range(10000):
    a = random.uniform(0, L)
    b = random.uniform(0, L-a)
    c= L-a-b
    vol = a*b*c
    if vol_max < vol:
        vol_max = vol
    else:continue
        
print(vol_max)

Submission status: Wrong Answer

Solution code:
l = int(input())
d = l / 3
e = l // 3
if l / 3 == 0:
  print(d ^ 3)
elif l / 3 == 1:
  print(e ^ 2 * (e + 1))
else:
  print(e * (e + 1) * (e + 1))

Submission status: Wrong Answer

Solution code:
l = int(input())
ans = 0
for i in range(l+1):
    for j in range(l+1-i):
        ans = max(ans, i*j*(l-i-j))
print(float(ans))

Submission status: Wrong Answer

Solution code:
line = int(input())

if line % 3 == 0:
  calc = (line / 3) * (line / 3) * (line / 3)
elif line % 3 == 1:
  calc = (line / 3 + 1 / 3) * (line / 3 + 1 / 3) * (line / 3 + 1 / 3)
else:
  calc = (line / 3 + 2 / 3) * (line / 3 + 2 / 3) * (line / 3 + 2 / 3)

print(str(calc))

Submission status: Wrong Answer

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

max = 0
for i in range(1,int(l/2)):
    for j in range(1,int(l/2)):
        if(l-i-j <= 0):
            break
        calc = (l - i - j)*i*j
        if(max < calc):
            max = calc


print(max/1000)

Submission status: Wrong Answer

Solution code:
l = int(input())

max = 0
for i in range(1,l):
    for j in range(1,l):
        if(l-i-j <= 0):
            break
        calc = (l - i - j)*i*j
        if(max < calc):
            max = calc


print(max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def maxvolume (s): 
    maxvalue = 0
  
    # for length 
    i = 1
    for i in range(s - 1): 
        j = 1
          
        # for breadth 
        for j in range(s): 
              
            # for height 
            k = s - i - j 
              
            # calculating maximum volume. 
            maxvalue = max(maxvalue, i * j * k) 
              
    return maxvalue 
      
# Driven Program 
s = int(input())
print(maxvolume(s))

Submission status: Wrong Answer

Solution code:
def maxvolume(s): 
    length = int(s / 3) 
    s -= length 
    breadth = s / 2
    height = s - breadth 
    return int(length * breadth * height) 
s = int(input())
print(maxvolume(s))

Submission status: Wrong Answer

Solution code:
from scipy.optimize import minimize
import numpy as np
L = int(input())


def volume(x):
    return -(x[0] * x[1] * (L - (x[0] + x[1])))


x0 = np.array([1, 1])
res = minimize(volume, x0, options={'maxiter':1e7})
print(-res.fun)

Submission status: Wrong Answer

Solution code:
from scipy.optimize import minimize
import numpy as np
L = int(input())


def volume(x):
    return -(x[0] * x[1] * (L - (x[0] + x[1])))


x0 = np.array([1, 1])
res = minimize(volume, x0, )
print(np.round(-res.fun))

Submission status: Wrong Answer

Solution code:
from scipy.optimize import minimize
import numpy as np
L = int(input())


def volume(x):
    return -(x[0] * x[1] * (L - (x[0] + x[1])))


x0 = np.array([1, 1])
res = minimize(volume, x0, tol=1e-8)
print(-res.fun)

Submission status: Wrong Answer

Solution code:
from scipy.optimize import minimize
import numpy as np
L = int(input())


def volume(x):
    return -(x[0] * x[1] * (L - (x[0] + x[1])))


x0 = np.array([1, 1])
res = minimize(volume, x0, tol=1e-7)
print(-res.fun)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
l = int(input())
x = math.floor(l/3)

if l%3 == 0:
  ans = x**3
elif l%3 == 1:
  ans = x*x*(x+1)
else:
  ans = x*(x+1)*(x+1)

print(str(ans))

Submission status: Wrong Answer

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

    ans = 0.0
    for x in range(0, 1001):
        for y in range(0, 1001):
            if x + y > 1000:
                break
            tmp = x*y*(L - x - y)

            if tmp > ans:
                ans = tmp
    print('{0:.7f}'.format(ans))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    ans = 0.0
    for x in range(0, 1001):
        for y in range(0, 1001):
            if x + y > 1000:
                break
            tmp = x*y*(L - x - y)

            if tmp > ans:
                ans = tmp
    print('{0:.6f}'.format(ans))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
l = int(input())
m = 0
for t in range(1,l+1):
  for o in range(1,l+1):
    y = l - t - o
 #   print(t,o,y)
    if y>0 and  t*y*o >=m:
      m = t*y*o

print(m)

Submission status: Wrong Answer

Solution code:
N = float(input())
a=b=c=N//3
print(a*b*c)

Submission status: Wrong Answer

Solution code:
l = int(input())
m = l//3
n = 0

for i in range(m, l-1):
    for j in range(1, l-i//2):
        a = i*j*(l-i-j)
        if n < a:
            n = a

print(n)

Submission status: Wrong Answer

Solution code:
L = float(input())

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

Submission status: Wrong Answer

Solution code:
L = int(input())

print(round(L/3, 4) ** 3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())

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

Submission status: Wrong Answer

Solution code:
L = int(input())

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

Submission status: Wrong Answer

Solution code:
L = int(input())

print(L//3 ** 3)

Submission status: Wrong Answer

Solution code:
L = int(input())
q, mod = divmod(L, 3)

if mod == 0:
    print(q ** 3.0)

Submission status: Wrong Answer

Solution code:
L = int(input())
q, mod = divmod(L, 3)

if mod == 0:
    print(q ** 3)
elif mod == 1:
    print(q**2 * (q + 1))
elif mod == 2:
    print(q* (q + 1) ** 2)

Submission status: Wrong Answer

Solution code:
#ABC.C159
L = int(input())
x = L//3
print(x**3)

Submission status: Wrong Answer

Solution code:
l = int(input())
l1 = l // 3
l2 = (l - l1) // 2
l3 = l - l1 - l2
print(l1 * l2 * l3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
if L%3==0:
  n=(L//3)**3
elif L%3==1:
  k=L//3
  l=L//3
  m=(L//3)+1
  n=k*l*m
else:
  k=L//3
  l=(L//3)+1
  m=(L//3)+1
  n=k*l*m
print(n)

Submission status: Wrong Answer

Solution code:
L=int(input())
if L%3==0:
  n=(L//3)**3
elif L%3==1:
  k=l=L//3
  m=L//3+1
  n=k*l*m
else:
  k=L//3
  l=m=L//3+1
  n=k*l*m
print(n)

Submission status: Wrong Answer

Solution code:
L=int(input())
n1=n3 = L//3
for i in range(1,3):
    if n1*2+n3 != L:
        n3+=1
print(n1**2*n3)

Submission status: Wrong Answer

Solution code:
L = int(input())

print(L**3//27)

Submission status: Wrong Answer

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

L = int(input())  

if L % 3 == 0:
    edge1 = L // 3
    edge2 = L // 3
    edge3 = L // 3

elif L % 3 == 1:
    edge1 = L // 3
    edge2 = L // 3
    edge3 = L // 3 + 1

else:
    edge1 = L // 3
    edge2 = L // 3 + 1
    edge3 = L // 3 + 1

print(edge1*edge2*edge3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L= int(input())

list = 0
for i in range(L):
    for j in range(L-i):
        k = L - i -j
        V = i*j*k
        if V > list:
            list = V
print(list)

Submission status: Wrong Answer

Solution code:
def solution():
    l = int(input())
    
    maximum = 0
    for i in range(1, l*10):
        yoko = 0.1 * i
        for j in range(1, l*100-(i*10)):
            tate = 0.01 * j
            calc = tate * yoko * (l - tate - yoko)
            maximum = max(maximum, calc)
    print(maximum)

solution()

Submission status: Wrong Answer

Solution code:
def solution():
    l = int(input())
    
    maximum = 0
    for i in range(1, l*10):
        yoko = 0.1 * i
        for j in range(1, l*10-i):
            tate = 0.1 * j
            calc = tate * yoko * (l - tate - yoko)
            maximum = max(maximum, calc)
    print(maximum)

solution()

Submission status: Wrong Answer

Solution code:
def solution():
    l = int(input())
    
    maximum = 0
    for i in range(1, l*100):
        yoko = 0.01 * i
        for j in range(l*100-i):
            tate = 0.01 * j
            calc = tate * yoko * (l - tate - yoko)
            maximum = max(maximum, calc)
    print(maximum)

solution()

Submission status: Wrong Answer

Solution code:
def solution():
    l = int(input())
    
    maximum = 0
    for i in range(1, l*10):
        yoko = 0.1 * i
        for j in range(l*10-i):
            tate = 0.1 * j
            calc = tate * yoko * (l - tate - yoko)
            maximum = max(maximum, calc)
    print(maximum)

solution()

Submission status: Wrong Answer

Solution code:
def solution():
    l = int(input())
    
    maximum = 0
    for i in range(1, l):
        for j in range(l-i):
            calc = i * j * (l - i - j)
            maximum = max(maximum, calc)
    print(maximum)

solution()

Submission status: Wrong Answer

Solution code:
def solution():
    l = int(input())
    
    maximum = 0
    for i in range(l*10):
        yoko = 0.1 * i
        for j in range(i+1, l*10):
            tate = 0.1 * j
            calc = tate * yoko * (l - tate - yoko)
            maximum = max(maximum, calc)
    print(maximum)

solution()

Submission status: Wrong Answer

Solution code:
#author : dokueki

import sys


def IOE():
    sys.stdin = open("input.txt", "r")
    sys.stdout = open("output.txt", "w")


def main():
    n = int(input())
    if n % 3 == 0:
        print((n // 3) ** 3)
    elif n % 3 == 2:
        print(2*pow(3, n//3))
    else:
        print(2*2*pow(3, (n//3)-1))


if __name__ == "__main__":
    #IOE()
    main()

Submission status: Wrong Answer

Solution code:
#author : dokueki

import sys


def IOE():
    sys.stdin = open("input.txt", "r")
    sys.stdout = open("output.txt", "w")


def main():
    n = int(input())
    if n % 3 == 0:
        print((n // 3) ** 3)
    elif n % 3 == 2:
        print((n // 3) * ((n // 3) - 0.6) * ((n // 3) - 1 + 0.6))
    else:
        print((n // 3) * ((n // 3) - 0.6) * ((n // 3) - 2 + 0.6))


if __name__ == "__main__":
    #IOE()
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
#  C.py
#  
#  Copyright 2020 BHASKAR <>
#  
#  This program is free software; you can redistribute it and/or modify
#  it under the terms of the GNU General Public License as published by
#  the Free Software Foundation; either version 2 of the License, or
#  (at your option) any later version.
#  
#  This program is distributed in the hope that it will be useful,
#  but WITHOUT ANY WARRANTY; without even the implied warranty of
#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#  GNU General Public License for more details.
#  
#  You should have received a copy of the GNU General Public License
#  along with this program; if not, write to the Free Software
#  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
#  MA 02110-1301, USA.
#  
#  


n = int(input())
if n%3==0:
	print((n//3)**3)
elif n%3==2:
	print(n//3*n//3*(n//3)-1)
else:
	print(n//3*(n//3)-1*(n//3)-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input(""))
a = 0.001
b = l - 2 * a
V = 0
V_vec = [0,0]
for i in range(l*99):
    if V < a * a * b :
        V = a * a * b
        V_vec = [a,b]
    a += 0.01
    b = l - 2 * a
print(V)

Submission status: Wrong Answer

Solution code:
l = int(input(""))
a = 0.01
b = l - 2 * a
V = 0
V_vec = [0,0]
for i in range(l*99):
    if V < a * a * b :
        V = a * a * b
        V_vec = [a,b]
    a += 0.01
    b = l - 2 * a
print(V)

Submission status: Wrong Answer

Solution code:
l = int(input())
if l%3 == 0:
    print((l//3)**3)
else:
    t = l//3
    if l%3 == 1:
        print(t**3+t**2+t/3+1/27)
    else:
        print(t**3+2*t**2+2*t/3+8/27)

Submission status: Wrong Answer

Solution code:
l = int(input())
if l%3 == 0:
    print((l//3)**3)
elif l%3 == 1:
    print((l//3)*(l//3)*((l//3)+1))
else:
    print((l//3)*(l//3+1)*((l//3)+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
E=[L//3+(1 if i<L%3 else 0) for i in range(3)]
print(E[0]*E[1]*E[2])

Submission status: Wrong Answer

Solution code:
import scipy.optimize

L = int(input())

func = lambda x: -1 * (x[0] * x[1] * (L - x[0] - x[1]))

res = scipy.optimize.minimize(func, (1 ,2), bounds = ((0, None), (0, None)))

print(-1 * res.fun)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
for i in range(1,(L*100)//3+1):
  x=i
  for j in range(x,(L*100-x)//2+1):
    y=j
    ans=max(ans,(L*100-(x+y))*x*y)
    
print(ans/1000000)

Submission status: Wrong Answer

Solution code:
q=input()
t=int(q)
print(t)
y=t/3
u=t/3
i=t/3
print(y*u*i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import decimal
decimal.getcontext().prec = 6
L = int(input())
l = decimal.Decimal(L/3)
print(l**3)

Submission status: Wrong Answer

Solution code:
L = int(input())
if L % 3 == 0:
  print((L // 3) ^ 3)
elif L % 3 == 1:
  print((L // 3) ^ 2 * (L // 3 + 1))
elif L % 3 == 2:
  print((L // 3) * (L // 3 + 1) * (L // 3 + 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())

from decimal import *
n = Decimal(l/3).quantize(Decimal('.001'))

print(n**3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())
ls = []

for i in range(l*10):
    i2 = i/10
    x = i2
    for ii in range(l*10 - i):
        y = ii/10
        z = l - x - y
        lsa = [x, y, z]
        ls.append(lsa)
vols = []
def culv(l):
    x = l[0]
    y = l[1]
    z = l[2]
    v = x * y * z
    return v
for i in ls:
    a = culv(i)
    vols.append(a)

mxv = max(vols)
print(mxv)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    L = int(input())
    """
    a + b + c = L 
    a * b * c = (L - b - c) * b * c 
    """
    ans = 0
    for b in range(1,L,1):
        for c in range(1,L - b,1):
            if ans < (L - b - c) * b * c :
                ans = (L - b - c) * b * c
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
L = int(input())
v=-1
for x in range(1,L):
    for y in range(1,L-x):
        v = max(v, x*y*(L-x-y))
print(v)

Submission status: Wrong Answer

Solution code:
a = int(input())
z = a/3
x = z*z*z
b = a//3
c = a%3
Y = b*b*c
if a%3 == 0:
  print(int(x))
elif a == 0:
  print(0)
elif a%3 != 0:
  print(int(Y))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import *
from math import *
from collections import deque
input = stdin.readline
lmi = lambda: list(map(float, input().split()))
mi = lambda: map(int, input().split())
si = lambda: input().strip('\n')
ssi = lambda: input().strip('\n').split()

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

Submission status: Wrong Answer

Solution code:
from sys import *
from math import *
from collections import deque
input = stdin.readline
lmi = lambda: list(map(float, input().split()))
mi = lambda: map(int, input().split())
si = lambda: input().strip('\n')
ssi = lambda: input().strip('\n').split()

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