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:
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((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((l//3) ** 3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))

    L=int(readline())

    if L<3:
        print((L/3)**3)
        return
    t=0
    for x in range(1,L):
        for y in range(1,L):
            if x+y>=L:
                continue
            z=L-x-y
            t=max(t,x*y*z)

    print(t)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Wrong Answer

Solution code:

### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))

    L=int(readline())

    xxx=0
    if L<10:
        L*=10
        xxx=1


    t=0
    for x in range(1,L):
        for y in range(1,L):
            if x+y>=L:
                continue
            z=L-x-y
            t=max(t,x*y*z)
    #ss=readline().rstrip()
    #yn(1)
    if xxx==1:
        print(t/1000)
    else:
        print(t)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Wrong Answer

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))
    L=int(readline())*10

    t=0
    for x in range(1,L):
        for y in range(1,L):
            if x+y>=L:
                continue
            z=L-x-y
            t=max(t,x*y*z)
    #ss=readline().rstrip()
    #yn(1)
    print(t/1000)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Wrong Answer

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))
    L=int(readline())

    t=0
    for x in range(1,L):
        for y in range(1,L):
            if x+y>=L:
                continue
            z=L-x-y
            t=max(t,x*y*z)
    #ss=readline().rstrip()
    #yn(1)
    print(t)

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

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())
print(float(L)/3)

Submission status: Wrong Answer

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

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:
L = int(input(''))
x = 0
y = 0
if(L%3 == 1):
  x = 1
  y = 0
elif (L%3 == 2):
  x = 1
  y = 1
else:
  x = 0
  y = 0
  
print(float((L//3*(L//3+x)*(L//3+y))))

Submission status: Wrong Answer

Solution code:
L = int(input())

result = L / 3
for i in range(0,3):
  result *= result
  
print(result)

Submission status: Wrong Answer

Solution code:
L = int(input())

result = L / 3
for i in range(0,2):
  result *= result
  
print(result)

Submission status: Wrong Answer

Solution code:
a = int(input())

print(a **3 )

Submission status: Wrong Answer

Solution code:
import sys

def main():
  input = sys.stdin.readline
  L = int(input())

  xyz  = 0

  for i in range(L*10):
    x = i/10
    for j in range(L*10-i):
      y = j/10
      z = L-x-y
      newxyz = x*y*z
      if xyz < newxyz:
        xyz=newxyz

  print ('{0:.6f}'.format(xyz))


if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
import sys

def main():
  input = sys.stdin.readline
  L = int(input())

  xyz  = 0

  for i in range(L*100):
    x = i/100
    for j in range(L*100-i):
      y = j/100
      z = L-x-y
      newxyz = x*y*z
      if xyz < newxyz:
        xyz=newxyz
  
  print (xyz)


if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
import sys

def main():
  input = sys.stdin.readline
  L = int(input())

  xyz  = 0

  for i in range(L*10):
    x = i/10
    for j in range(L*10-i):
      y = j/10
      z = L-x-y
      newxyz = x*y*z
      if xyz < newxyz:
        xyz=newxyz
  
  print (xyz)


if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
L = int(input())

xyz  = 0

for i in range(L*10):
  x = i/10
  for j in range(L*10-i):
    y = j/10
    z = L-x-y
    if xyz < x*y*z:
      xyz=x*y*z
  
print (xyz)

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())

xyz  = 0

for i in np.arange(0.1,L,0.1, dtype='float32'):
  x = i
  for j in np.arange(0.1,L-i,0.1, dtype='float32'):
    y = j
    z = L-i-j
    if xyz < x*y*z:
      xyz=x*y*z
  
print (xyz)

Submission status: Wrong Answer

Solution code:
# A = [list(map(int, input().split())) for _ in range(3)]
L = int(input())
# B = [int(input()) for _ in range(n)]
# X = list(map(int, input().split()))
# a, b = map(int, input().split())
# S = input()
half = L/3
if L % 3 == 2:
    print(((half+1)**2)*half)
elif L % 3 == 1:
    print((half**2)*(half+1))
else:
    print(half**3)

Submission status: Wrong Answer

Solution code:
# A = [list(map(int, input().split())) for _ in range(3)]
L = int(input())
# B = [int(input()) for _ in range(n)]
# X = list(map(int, input().split()))
# a, b = map(int, input().split())
# S = input()
half = L//3
if L % 3 == 2:
    print(((half+1)**2)*half)
elif L % 3 == 1:
    print((half**2)*(half+1))
else:
    print((L//3)**3)

Submission status: Wrong Answer

Solution code:
# A = [list(map(int, input().split())) for _ in range(3)]
L = int(input())
# B = [int(input()) for _ in range(n)]
# X = list(map(int, input().split()))
# a, b = map(int, input().split())
# S = input()
if L % 3 == 2:
    print((L/3)*2*(L/3+1))
elif L % 3 == 1:
    print((L/3)*((L/3+1)*2))
else:
    print((L//3)**3)

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())

xyz  = 0

for i in np.arange(1,L,0.1):
  x = i
  for j in np.arange(1,L-i,0.1):
    y = j
    z = L-i-j
    if xyz < x*y*z:
      xyz=x*y*z
  
print (xyz)

Submission status: Wrong Answer

Solution code:
# A = [list(map(int, input().split())) for _ in range(3)]
L = int(input())
# B = [int(input()) for _ in range(n)]
# X = list(map(int, input().split()))
# a, b = map(int, input().split())
# S = input()
if L % 3 == 2:
    print((L//3)*2*(L//3+1))
elif L % 3 == 1:
    print((L//3)*((L//3+1)*2))
else:
    print((L//3)**3)

Submission status: Wrong Answer

Solution code:

L = int(input())

xyz  = 0

for i in range(L):
  x = i
  for j in range(L-i):
    y = j
    z = L-i-j
    if xyz < float(x*y*z):
      xyz=float(x*y*z)
  
print (xyz)

Submission status: Wrong Answer

Solution code:

L = int(input())

xyz  = 0

for i in range(L):
  x = i
  for j in range(L-i):
    y = j
    z = L-i-j
    if xyz < x*y*z:
      xyz=x*y*z
  
print (xyz)

Submission status: Wrong Answer

Solution code:
L = int(input())

if L > 3:
  print((L**3)/27)
else:
  print(L)

Submission status: Wrong Answer

Solution code:
L = int(input())

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

Submission status: Wrong Answer

Solution code:
L = int(input())

temp = 0
for i in range(1,L):
    for j in range(1,L-i):
        mult = i*j*(L-i-j)
        if(temp < mult):
            temp = mult
print(float(temp))

Submission status: Wrong Answer

Solution code:
import sys
import os
import collections


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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

L = int(input())
print(math.ceil(L/3) * math.ceil(L/3) * (L - math.ceil(L/3) - math.ceil(L/3)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def main():
    L = int(input())
    tmp = L//3
    if L%3 == 0:
        print(tmp*tmp*tmp)
    elif L%3 == 1:
        print(tmp*tmp*(tmp+1))
    else:
        print(tmp*(tmp+1)*(tmp+1))


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import scipy.optimize as optimize


def main():
    L = float(input())
    def fun(x): return -x[0] * x[1] * x[2]
    cons = ({'type': 'eq', 'fun': lambda x: x[0] + x[1] + x[2] - L})
    bnds = ((0, None), (0, None), (0, None))
    res = optimize.minimize(fun, (0, 0, 0), bounds=bnds,
                            constraints=cons, tol=1e-8)
    print("{:.18f}".format(-res.fun))


main()

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = 0
for i in range(1, 1001):
  for j in range(1, 1001):
    if i + j > 1000 or i + j > L:
      break
    for k in range(1, 1001):
      if i + j + k > 1000 or i + j + k > L:
        break
      ans = max(ans, i * j * k)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

length=int(L/3)
L=L-length
width=int(L/2)
L=L-width
height=L
print(length*width*height)

Submission status: Wrong Answer

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

# print(Decimal(N) // Decimal(3))
print(N ** 3 // 27)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
if L==1 or L==2:
    print('%.12f' %(L/3)**3)
else:
    a=b=c=L//3
    if L%3>=1:
        a+=1
        b+=L%3-1
    f=a*b*c
    print('%.12f' %f)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
x=L/3
l=x-1
h=x+1
v=l*x*h
print(v)

Submission status: Wrong Answer

Solution code:
L = int(input())
max = 0
for x in range(L - 2):
    pre = 0
    x1 = x + 1
    for y in range(L - x1 - 1):
        y1 = y + 1
        z1 = L - x1 - y1
        if pre != 0:
            if x1*y1*z1< pre:break
        if x1*y1*z1 > max: max = x1*y1*z1
        pre = x1*y1*z1
print(max)

Submission status: Wrong Answer

Solution code:
a = int(input())
if a < 3:
	print(0)
else:
	yy = a / 3
	print(yy**3)

Submission status: Wrong Answer

Solution code:
N = int(input())

# print(Decimal(N) // Decimal(3))
print(round(N//3, 12))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from decimal import *
N = input()

# print(Decimal(N) // Decimal(3))
print("{0:.15f}".format(Decimal(Decimal(N) // Decimal(3))))

Submission status: Wrong Answer

Solution code:
l=int(input())
ans=0
for a in range(1,l+1):
  b=(l-a)/2
  c=(l-a)/2
  ans=max(ans,a*b*c)
print(ans)

Submission status: Wrong Answer

Solution code:
from decimal import *
N = input()

print(Decimal(N) // Decimal(3))

Submission status: Wrong Answer

Solution code:
l = int(input())
syo = l % 3
v = 0
from decimal import Decimal
l_3sq = Decimal(l /3)
print(l_3sq)

if syo == 0:
    v = (l/3)**3
    print(v)
else:
    v = (l_3sq)**3
    print(v)

Submission status: Wrong Answer

Solution code:
s = int(input())
a = s//3
b = a * 1.2
c = a * 0.8
ans = a * b * c
ans = ans * (1/0.96)
print(ans)

Submission status: Wrong Answer

Solution code:
l = int(input())
syo = l % 3
v = 0
from decimal import Decimal
l_3sq = Decimal(l /3)
print(l_3sq)

if syo == 0:
    v = (l//3)**3
    print(v)
else:
    v = (l_3sq)**3
    print(v)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
front=[]
back=[]
ans="Yes"
for i in range((len(s)-1)//2):
  front.append(s[i])
for i in range((len(s)+3)//2-1,len(s)):
  back.append(s[i])
back.reverse()
if front!=back:
  ans="No"

fro=[]
bac=[]
if len(front)%2!=0 and len(front)!=1:
  for i in range((len(front)-1)//2):
    fro.append(front[i])
  for i in range((len(front)+3)//2-1,len(front)):
    bac.append(front[i])
  bac.reverse()
  if fro!=bac:
    ans="No"
elif len(front)%2==0:
  for i in range(len(front)//2):
    fro.append(front[i])
  for i in range(len(front)//2,len(front)):
    bac.append(front[i])
  bac.reverse()
  if fro!=bac:
    ans="No"

print(ans)

Submission status: Wrong Answer

Solution code:
S = int(input())
a = S//3
b = a * 0.8
c = a * 1.2
ans = a * b * c
ans = ans ** 3/27
print("{0:.12f}".format(ans))

Submission status: Wrong Answer

Solution code:
def resolve():
    L = float(input())
    print((L+L+L)/27)

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
l=int(input())
if l==1:
    print(float(1))
else:
    print(float((l/3)**3))

Submission status: Wrong Answer

Solution code:
S = int(input())
a = S//3
b = a * 0.8
c = a * 1.2
ans = a * b * c
ans = ans * 1.0416666666666666
print("{0:.7f}".format(ans))

Submission status: Wrong Answer

Solution code:
L=int(input())

i=1
list=[]
r=1

if(L==1):
 print("1")
else:
  while(i<L):
    j=1
    while(j<L):
      if(r<j*i*(L-i-j)):
        r=j*i*(L-i-j)
      j+=0.1
    i+=1
  print(r)

Submission status: Wrong Answer

Solution code:
L=float(input())
max=float(0)
def drange(begin, end, step):
    n = begin
    while n+step < end:
     yield n
     n += step
for x in drange(0,2*L/3,0.01):
    for y in drange(0,L-x,0.01):
        z=L-x-y
        A=x*y*z
        if A>max:
            max=A
print(max)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
#分割数
d=400
l=3
L_=int(L**(1/3))
for i in range(max(0,int(L_-l)*d),int(L_+l)*d):
  for j in range(max(0,int(L_-l)*d-i),int(L_+l)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
#分割数
d=300
l=3
L_=int(L**(1/3))
for i in range(max(0,int(L_-l)*d),int(L_+l)*d):
  for j in range(max(0,int(L_-l)*d-i),int(L_+l)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

Solution code:
L=int(input())

i=1
list=[]
r=1

if(L==1):
 print("1")
else:
  while(i<L):
    j=0.1
    while(j<L):
      if(r<j*i*(L-i-j)):
        r=j*i*(L-i-j)
      j+=0.1
    i+=1
  print(r)

Submission status: Wrong Answer

Solution code:
S = int(input())
a = S//3
b = a * 0.8
c = a * 1.2
ans = a * b * c
ans = ans * (1/0.96)
print("{0:.7f}".format(ans))

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
#分割数
d=300
l=2
L_=int(L**(1/3))
for i in range(max(0,int(L_-l)*d),int(L_+l)*d):
  for j in range(max(0,int(L_-l)*d-i),int(L_+l)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

l = int(input())
max = 0.0
for x in range(l):
	for y in np.arange(0, l, 0.1):
			v = x * y * (l - x - y)
			if v > max:
				max = v
print(max)

Submission status: Wrong Answer

Solution code:
L=int(input())

i=1
list=[]
r=1

if(L==1):
 print("1")
else:
  while(i<L):
    j=1
    while(j<L):
      list.append(j*i*(L-i-j))
      j+=1
    i+=1
  print(max(list))

Submission status: Wrong Answer

Solution code:
L=input()

print (L**3/27)

Submission status: Wrong Answer

Solution code:
S = int(input())
a = S//3
b = a * 0.8
c = a * 1.2
ans = a * b * c
ans = ans * (1/0.96)
print("{0:.6f}".format(ans))

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
#分割数
d=100
l=15
L_=int(L**(1/3))
for i in range(max(0,int(L_-l)*d),int(L_+l)*d):
  for j in range(max(0,int(L_-l)*d-i),int(L_+l)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())
maxVol = 0
for h in range(1,L-1):
  height = h
  for w in range(1, L-h):
    width = w
    length = L-h-w
    if (width * length * height) > maxVol:
      maxVol = width * length * height
print(maxVol)

Submission status: Wrong Answer

Solution code:
S = int(input())
a = S//3
b = a * 0.8
c = a * 1.2
ans = a * b * c
ans = ans * (1/0.96)
print("{0:.12f}".format(ans))

Submission status: Wrong Answer

Solution code:
L = int(raw_input())
x = round(float(L/3), 6)
print(x*x*x)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
#分割数
d=100
l=20
L_=int(L**(1/3))
for i in range(max(0,int(L_-l)*d),int(L_+l)*d):
  for j in range(max(0,int(L_-l)*d-i),int(L_+l)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
#分割数
d=100
l=10
L_=int(L**(1/3))
for i in range(max(0,int(L_-10)*d),int(L_+10)*d):
  for j in range(max(0,int(L_-10)*d-i),int(L_+10)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

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

h,w,v = 0, 0, 0
if L % 3 == 0:
    lens = L/3
    h,w,v = lens,lens,lens
else:
    jo = (L % 3)
    lens = (L - jo) / 3
    h,w,v = lens, lens, lens + jo

print(h*w*v)

Submission status: Wrong Answer

Solution code:
S = int(input())
a = S//3
b = a * 0.8
c = a * 1.2
ans = a * b * c
ans = ans * 1.0416666666666666
print("{0:.12f}".format(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=int(input())
if(l>0 and l<=1000):
    a = (l+1) // 3
    v = a * a * a
    print('%.12f' % v)

Submission status: Wrong Answer

Solution code:
import math
from decimal import Decimal

if __name__ == "__main__":
    L = int(input())
    hoge = L / 3 
    ret = (hoge* 10**6) **3
    print(ret)

Submission status: Wrong Answer

Solution code:
L=float(input())
max=float(0)
def drange(begin, end, step):
    n = begin
    while n+step < end:
     yield n
     n += step
for x in drange(L/2,L,0.001):
    for y in drange(0,L-x,0.001):
        z=L-x-y
        A=x*y*z
        if A>max:
            max=A
print(max)

Submission status: Wrong Answer

Solution code:
import math

L = int(input())
if L % 3 == 0:
    print(float((L/3) ** 3))
elif L % 3 == 1:
    k = math.floor(L/3)
    print(k*k*(k+1))
else:
    l = math.floor(L/3)
    print(l*(l+1)*(l+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())

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

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=10
L_=int(L**(1/3))
for i in range(max(0,int(L_-10)*d),int(L_+10)*d):
  for j in range(max(0,int(L_-10)*d-i),int(L_+1)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

Solution code:
l=int(input())
if(l>0 and l<=1000):
    a = l // 3
    v = a * a * a
    print('%.12f' % v)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=2
L_=int(L**(1/3))
for i in range(max(0,int(L_-10)*d),int(L_+10)*d):
  for j in range(max(0,int(L_-10)*d-i),int(L_+1)*d-i):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

Submission status: Wrong Answer

Solution code:
n = input()
num = int(n)

if (num % 3) == 0:
	num = num//3
	num = num**3
	print(num)
elif ((num + 1)%3) == 0:
    num = (num+1)//3
    num = (num**2) * (num-1)
    print(num)
elif ((num + 2)%3) == 0:
    num = (num+2)//3
    num = num * (num-1) * (num-1)
    print(num)

Submission status: Wrong Answer

Solution code:
def resolve():
    L = int(input())
    ans = float(0)
    for x in range(1, L):
        for y in range(1, L-x):
            x = float(x)
            y = float(y)
            z = float(L) - x - y
            ans = max(ans, x*y*z)

    print(ans)
if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
N = int(input())

x=0
y=0
z=0
if(N%3==0):
    print(N/3)
    
elif (N%3==1):
    x=(N-1)/3
    y=(N-1)/3
    z= ((N-1)/3)+1
    print(x*y*z)
    
elif (N%3==2):
    x=(N+1)/3
    y=(N+1)/3
    z= ((N+1)/3)-1
    print(x*y*z)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()
num = int(n)

if (num % 3) == 0:
	num = num//3
	num = num**3
	print(num)
elif ((num + 1)%3) == 0:
    num = num//3
    num = (num**2) * (num-1)
    print(num)
elif ((num + 2)%3) == 0:
    num = num//3
    num = num * (num-1) * (num-1)
    print(num)

Submission status: Wrong Answer

Solution code:
import sys
from collections import Counter
from math import factorial

input = sys.stdin.readline

def conbi(n, r = 2):
    if n - r < 0:
        return 0
    return int(factorial(n) / (factorial(n - r) * factorial(r)))

N = int(input())
A = list(map(int, input().split()))
A_cnt = dict(Counter(A))

for _ in A:
    ans = 0
    for cnt in A_cnt.keys():
        if A_cnt[cnt] == 1:
            continue
        else:
            if cnt == _:
                n = A_cnt[cnt] - 1
                ans += conbi(n)
            else:
                ans += conbi(A_cnt[cnt])
    print(ans)

Submission status: Wrong Answer

Solution code:
# Python3 code to Maximize volume of 
# cuboid with given sum of sides 

# Return the maximum volume. 
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())
t=maxvolume(s)
print(t)

Submission status: Wrong Answer

Solution code:
l = int(input())
syo = l % 3
v = 0
l_3sq = l **(1/3)

if syo == 0:
    v = (l//3)**3
    print(v)
else:
    v = (l_3sq)**3
    print(v)

Submission status: Wrong Answer

Solution code:
n = int(input())

s = n//3
t = n % 3

if t == 0:
    print(s**3)
if t == 1:
    print((s+1)*s*s)
if t == 2:
    print((s+1)*(s+1)*s)

Submission status: Wrong Answer

Solution code:
l = int(input())
a,b,c = 0,0,0
 
if l%3 == 0:
    a = l/3
    b = l/3
    c = l/3
elif l%3 == 1:
    a = l/3 + 1
    b = l/3
    c = l/3
elif l%3 == 2:
    a = l/3 + 1
    b = l/3 + 1
    c = l/3
 
print(a*b*c)

Submission status: Wrong Answer

Solution code:
l = int(input())
a = 0
i = int(l/4)
n = 0

avg = lambda a, b: float(a+b)/2.0
div = lambda i, l: (3/4)*i**2 - 2*l*i + (l**2/4)

min = 0
max = int(l/2)

while n <10000:
    tmp = i*((l-i)/2)*((l-i)/2)
    a = tmp if tmp > a else a
    
    if div(i, l) > 0:
        i, min = avg(i, max), i
    else:
        i, max = avg(i, min), i
    n += 1

print(float(a))

Submission status: Wrong Answer

Solution code:
from decimal import * 
l = int(input())
v_m = 0
if l >= 3:
    for x in range(l//3+1):
        for y in range(l//3+1):
            z = l-(x+y)
            if x*y*z > v_m and z > 0:
                v_m = x*y*z
            
else:
    v_m = Decimal(str((l/3)**3))
    
        
print(v_m)

Submission status: Wrong Answer

Solution code:
L = 999
HWL = L/3

print(HWL ** 3)

Submission status: Wrong Answer

Solution code:
n = int(input())

s = n//3

if n%3 == 0:
    print(s**3)
elif n%3 == 1:
    print((s+1)*s*s)
else:
    print((s+1)*(s+1)*s)

Submission status: Wrong Answer

Solution code:
def main():
  a = []
  n = int(input())
  print((n//3)**3)

  
def count_section_by_zero(data):
  count = 0
  flg = False
  start = 0
  for i, d in enumerate(data):
    if flg is False and d != 0:
      count += 1
      flg = True
      
    if d == 0:
      flg = False
  return count

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

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

def input_list_str():
  return map(str, input().split())

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

# 2で割り切れる回数
def divide_two(arg):
  c = 0
  while True:
    if c >= 2:
      break
    if arg % 2 != 0:
      break
    arg //= 2
    c += 1
  return c

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

import math
import fractions
import collections
from functools import reduce
main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())
syo = l % 3
v = 0
import math
l_sq = math.sqrt(l)

if syo == 0:
    v = (l//3)**3
    print(v)
else:
    v = (l_sq)**3
    print(v)

Submission status: Wrong Answer

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

for i in range(1, l-1, 1):
    for j in range(1, l-i, 1):
        z = l - (i+j)
        result = z*i*j
        if(result>Ma):
            Ma = result
print(Ma/1000)

Submission status: Wrong Answer

Solution code:
import math
L = int(input())
m = 0
for i in range(1,L-1):
    for j in range(1,L-i-1):
        if i*j*(L-i-j)>=m:
            m = i*j*(L-i-j)
print('{:.12f}'.format(m))

Submission status: Wrong Answer

Solution code:
L = float(input())
a = round(((L / 3) * 10)) / 10
b = round(((L / 3) * 10)) / 10
c = round(((L / 3) * 10)) / 10
#a += round(L - (a + b + c))
L = round(L - (a+b+c),2)
a += L
print(round((a*b*c),7))
#print(a*b*c)

Submission status: Wrong Answer

Solution code:
L =int(input())

if L == 1:
    print('0.037036926')
elif L==2:
     print('0.296296074')
else:
    ans =0
    for i in range(1500):
        for j in range(1500):
            ans =max(ans, i/1.5*j/1.5*(L-(i/1.5+j/1.5)))
    print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

l = int(input())
max = 0.0
for x in range(l):
	for y in np.arange(0, l, 0.2):
			v = x * y * (l - x - y)
			if v > max:
				max = v
print(max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())


if(N%3==0):
    print(N/3)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
L = int(input())
m = 0
for i in range(1,L):
    for j in range(1,L-i):
        if i*j*(L-i-j)>=m:
            m = i*j*(L-i-j)
print('{:.12f}'.format(m))

Submission status: Wrong Answer

Solution code:
L =int(input())

if L == 1:
    print('0.037036926')
elif L==2:
     print('0.296296074')
else:
    ans =0
    for i in range(2000):
        for j in range(1000):
            ans =max(ans, i/2*j*(L-(i/2+j)))
    print(ans)