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 math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
#from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

stdin = sys.stdin

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

L = ni()
ans = -1
for x in range(1, L+1):
    for y in range(x, L-x+1):
        z = L - x - y
        ans = max(ans, x*y*z)
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=[]

for B in range(1,n+1):
  for C in range(1,n+1):
    new_high=(n-(B+C))*B*C
    ans.append(new_high)
      
print(max(ans))

Submission status: Wrong Answer

Solution code:
l = int(input())

v_max = 0
for width in range(1, l+1):
    for length in range(1, l+1):
        height = l - width - length
        v = width * height * length
        if v_max < v:
            v_max = v

print(v_max)

Submission status: Wrong Answer

Solution code:
l = int(input())

v_max = 0
for width in range(1, l+1):
    for length in range(1, l-width+1):
        height = l - width - length
        v = width * height * length
        if v_max < v:
            v_max = v

print(v_max)

Submission status: Wrong Answer

Solution code:
l = int(input())

v_max = 0
for width in range(l):
    for length in range(l-width):
        height = l - width - length
        v = width * height * length
        if v_max < v:
            v_max = v

print(v_max)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = 0
for i in range(1,L-1):
    for j in range(1,L-i):
        ans = max(i*j*(L-i-j), ans)
print(ans)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(max)

Submission status: Wrong Answer

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

abc159c_maximum_volume()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
def main():
    L = int(input())

    ans = 0
    for i in range(min(L, 1000)):
        for j in range(10 ** 6):
            a = i + (j / 1000)
            b = (L - a) / 2
            ans = max(ans, a * b * b)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
def main():
    L = int(input())

    ans = 0
    for a in range(min(L, 1000)):
        b = (L - a) / 2
        ans = max(ans, a * b * b)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
L = int(input())
A = int(L/3)
B = int((L-A)/2)
C = L - A - B
print(A * B * C)

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())

max_value = -1
for a in range(1, l):
  for b in range(1, l - a + 1):
    c = l - a - b
    max_value = max(max_value, a * b * c)
    
print(max_value)

Submission status: Wrong Answer

Solution code:
l = int(input())

max_value = -1
for a in range(1, l):
  for b in range(1, l - a):
    c = l - a - b
    max_value = max(max_value, a * b * c)
    
print(max_value)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())
ans = 0
for i in range(L*100+1):
  x = i/100
  for j in range(L*100+1-i):
    y = j/100
    z = (L-x-y)
    n_ans = x*y*z
    if(ans <= n_ans):
      ans = n_ans
      
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())
print((L//3)**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) )
else:
  print((L//3) * ((L//3) + 1) ** 2 )

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=[]
for i in range(1,1001):
    for j in range(1,1001):
        k=L-(i+j)
        ans.append(i*j*k)
Y=max(ans)
print(f"{Y:.12f}")

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=[]
for i in range(1,1000):
    for j in range(1,1000):
        k=L-(i+j)
        ans.append(i*j*k)
Y=max(ans)
print(f"{Y:.12f}")

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=[]
for i in range(1,1000):
    for j in range(1,1000):
        k=L-(i+j)
        ans.append(i*j*k)
Y=max(ans)
print(f"{Y:.6f}")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys


def resolve(in_):
    L = int(in_.read())
    return L ** -3


def main():
    answer = resolve(sys.stdin)
    print(f'{answer:.12f}')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys


def resolve(in_):
    L = int(in_.read())
    return L ** -3


def main():
    answer = resolve(sys.stdin)
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

# 正直方体に近ければ近いほど体積が大きい
ht = math.floor(L/3)
wt = ht
dt = wt

if 3 * ht % 3 == 2:
    ht += 1
    wt += 1
if 3 * ht % 3 == 1:
    ht += 1

print(ht*wt*dt)

Submission status: Wrong Answer

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

for i in range(998):
  for j in range(998):
    V = i * j * (L - i - j)
    if ans < V:
      ans = V

print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

x = y = L//3
ans = 0

while x < (L//3+1):
    while y < (L//3+1):
        z = L - x - y
        ans = max(ans, x*y*z)
        y += 0.0001
    x += 0.0001

print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

x = y = L//3
ans = 0

while x < (L//3+1):
    while y < (L//3+1):
        z = L - x - y
        ans = max(ans, x*y*z)
        y += 0.001
    x += 0.001

print(ans)

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+1)**2 * (L//3))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=int(input())

import numpy as np
result = 0
for x in np.arange(0.1, l/3+0.1, 0.1):
  for y in np.arange(x, l/3+0.1, 0.1):
    z = l - (x+y)
    if z < 0:
      break
    v = x*y*z
    result = max(v, result)
print(result)

Submission status: Wrong Answer

Solution code:
l=int(input())

result = 0
for x in range(1,l+1):
  for y in range(x,l+1):
    z = l - (x+y)
    if z < 0:
      break
    v = x*y*z
    result = max(v, result)
print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = (3/L)**3
print(f'{ans:.012f}')

Submission status: Wrong Answer

Solution code:
l = int(input())
s = []
for x in range(l):
  for y in range(l - x):
    z = l - x - y
    s.append(x * y * z)
print(max(s))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=int(input())
ans=0
sum=0
 
for i in range(l):
 for j in range(l-i):
   sum=i*j*(l-i-j)
   if ans<sum:
      ans=sum
print(ans)

Submission status: Wrong Answer

Solution code:
l=int(input())
ans=0
sum=0
 
for i in range(l):
 for j in range(l):
   sum=i*j*(l-i-j)
   if ans<sum:
      ans=sum
print(ans)

Submission status: Wrong Answer

Solution code:
l=int(input())
ans=0
sum=0
 
for i in range(l):
 for j in range(l):
   sum=i*j*(l-i-j)
   if ans>sum:
      ans=sum
print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

result = L / 3
print(result)

Submission status: Wrong Answer

Solution code:
l = int(input())

ans=0
for x in range(1,l):
    for y in range(1, l-x):
        z = l-(x+y)
        ans = max(ans, x*y*z)
print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

res = 0
for i in range(1, 1000+1):
    for q in range(1, 1000+1):
        k = L - (i + q)
        total = i * q * k
        if res < total:
            res = total
print(res)

Submission status: Wrong Answer

Solution code:
L = int(input())

res = 0
for i in range(1, 1000+1):
    for q in range(1, 1000+1):
        k = L - (i + q)
        if k == i and k == q:
            res = i * q * k
print(res)

Submission status: Wrong Answer

Solution code:
l = int(input())

max = 0.0

for x in range(l+1):
    for y in range(l+1-x):
        vol = x * y * (l-x-y)
        if vol > max:
            max = vol

print(max)

Submission status: Wrong Answer

Solution code:
l = int(input())
maxVol = 0
for i in range(l):
    for j in range(l - i):
        ans = i * j * l - (i**2)*j - i * (j**2)
        if ans >= maxVol:
            maxVol = ans
        else:
            pass
print(float(maxVol))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=int(input())
temp1=l//3
temp2=(l-l//3)//2
print(temp1*temp2*(l-temp1-temp2))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
l = int(input())

ans = -1.0
for i in range(1, l+1):
    for j in range(1, l+1):
        k = l - i - j
        if i + j + k == l and k > 0:
            ans = max(ans, float(i * j * k))

print("{:.012f}".format(ans))

Submission status: Wrong Answer

Solution code:
l = int(input())

ans = -1.0
for i in range(1, l+1):
    for j in range(1, l+1):
        k = l - i - j
        if i + j + k == l and k > 0:
            ans = max(ans, float(i * j * k))

print(ans)

Submission status: Wrong Answer

Solution code:
import sys

l = int(input())

mvolume = 0
for h in range(l + 1):
    for w in range(l + 1):
        d = l - (h + w)
        if d <= 0:
            continue
        volume = h * w * d
        mvolume = max(mvolume, volume)

print(mvolume)

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

Submission status: Wrong Answer

Solution code:
l = int(input())

vmax = 0
for a in range(1, l):
   for b in range(1, l):
      c = l - a - b
      if b > a:
         continue
      elif c > 0:
         vmax = max(vmax, a*b*c)
      else:
         break
print(vmax)

Submission status: Wrong Answer

Solution code:
import numpy as np
l = int(input())
m = 0
for t in np.arange(0.1,(l-0.2)):
  for o in np.arange(0.1,(l-0.2)):
    x = t*o*(l-t-o)
    m = x if m<x else m  
 #   print(t,o,y)

print(m)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for x in range(0,L):
  for y in range(0,L):
    z = L - x - y
    if x*y*z > ans: ans = x*y*z

print(ans)

Submission status: Wrong Answer

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

for x in range(1,L):
  for y in range(1,L):
    z = L - x - y
    if x*y*z > ans: ans = x*y*z

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = [n//3 for _ in range(3)]
y =1
for i in range(n%3):
    x[i-1] += 1
for j in x:
    y *= j
print(y)

Submission status: Wrong Answer

Solution code:
s = input()
f = s[:int((len(s)-1)/2)]
print('Yes' if s==s[::-1] and f == f[::-1] else 'No')

Submission status: Wrong Answer

Solution code:
999

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())
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())
if l%3==0:
    k=l/3
    print(k**3)
else:
    n=int(l/3)
    m=l-2*n
    print(n*n*m)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n//3
b = n%3

if b == 1:
    print(a*a*(a+1))
elif b==2:
    print(a*(a+1)*(a+1))
else:
    print(a**3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = 0

for i in range(1, L-1):
    for j in range(1, L-i):
        V = 0
        V = i*j*(L-i-j)
        ans = max(ans, V)

print(ans)

Submission status: Wrong Answer

Solution code:
n=float(input())
div=n/3
rem=n-2*div
print(div,rem)
print("{:.6f}".format(div*div*rem))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
l=10*L
m=0
for a in range(1,l+1):
  for b in range(1,l-a+1):
    if m<a*b*(l-a-b):
      m=a*b*(l-a-b)
        
print(m/1000)

Submission status: Wrong Answer

Solution code:
l=int(input())
m=0
for a in range(1,l+1):
  for b in range(1,l-a+1):
    for c in range(1,l-a-b+1):
      if m<a*b*c:
        m=a*b*c
        
print(m)

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    l = int(input())
    ans = 0
    for x in range(l):
      for y in range(l):
        z = l - x - y
        if ans < x*y*z:
            ans = x*y*z
    print("{0:.6f}".format(ans))

    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
# ABC159C
# 縦，横，高さの合計が len である直方体のうち，体積が最大のものの体積はいくつか
def f(len):
  print((len / 3) * 3)

f(int(input()))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# L = x + y + z
# S = x*y*z
#これをSが最大となるようにyとLの式で表すと
# S_max = 1/2 * (L - y) * y * 1/2 * (L - y) = 1/4 * (y**3 - 2*L*y**2 +L**2 * y)

L = int(input())
S_list = []
for y in range(L*10**2):
    y_cal = y / 10**2
    s  = 1/4 * (y_cal**3 - 2*L*y_cal**2 +L**2 * y_cal)
    S_list.append(s)

S_max = max(S_list)
print(S_max)

Submission status: Wrong Answer

Solution code:
l = int(input())

m = 0
for i in range(l):
    for j in range(l-i):
        t = i * j * (l-i-j)
        if m < t:
            m = t
print(m)

Submission status: Wrong Answer

Solution code:
l = int(input())
ll = float(l)
a=0
b=0
c=0

if(ll%3 == 0):
	a=ll/3
	b=ll/3
	c=ll/3
else:
	a=ll/3
	b=a
	c=ll-a-b
	print(a,b,c)
    
print(a*b*c)

Submission status: Wrong Answer

Solution code:
l = int(input())
ll = float(l)
a=0
b=0
c=0

if(ll%3 == 0):
	a=ll/3
	b=ll/3
	c=ll/3
else:
	a=ll/3
	b=11/3
	c=ll-a-b
    
    
print(a*b*c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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):
        k=L-i-j
        ans=max(ans,i*j*k)
print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

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

Submission status: Wrong Answer

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

print(val)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc159/tasks/abc159_c

L = int(input())
max_v = 0

for i in range(1, L - 1):
    for j in range(1, L - i + 1):
        k = L - (i + j)

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

print(max_v)

Submission status: Wrong Answer

Solution code:
L = int(input())

lmax = 0
for i in range (10**3):    
    for j in range(10**3):
        lmax_ = i*j*(L-i-j)
        lmax = max(lmax, lmax_)

print(lmax)

Submission status: Wrong Answer

Solution code:
import numpy as np
l = int(input())
sum = 0
for i in np.arange(0,l-2,1):
    for j in np.arange(i,(l-i)/2,1):
        temp = i * j * (l - i - j)
        if sum < temp:
            sum = temp 

print(sum)

Submission status: Wrong Answer

Solution code:
l = int(input())
x_tmp, y_tmp, z_tmp, v_max = 0,0,0,0

for i in range(1,l//3+1):
    x = i
    for j in range(x, (l-x)//2+1, 1):
        y = j
        z = l - x - y
        v = x * y * z
        if v >= v_max:
            v_max = v
            x_tmp, y_tmp, z_tmp = x, y, z

x_tmp, y_tmp, z_tmp = float(x_tmp), float(y_tmp), float(z_tmp)

x_tmp2, y_tmp2, z_tmp2, v_max2 = 0,0,0,0

for i in range(0,200,1):
    delta = -0.99 + i / 100.0
    x = x_tmp + delta
    for j in range(0, 200,1):
        delta2 = -0.99 + j / 100.0
        y = y_tmp + delta2
        z = l - x - y
        v = x * y * z

        if v >= v_max2:
            v_max2 = v
            x_tmp2, y_tmp2, z_tmp2 = x, y, z

print(v_max2)

Submission status: Wrong Answer

Solution code:
l = int(input())
x_tmp, y_tmp, z_tmp, v_max = 0,0,0,0

for i in range(1,l//3+1):
    x = i
    for j in range(x, (l-x)//2+1, 1):
        y = j
        z = l - x - y
        v = x * y * z
        print(x,y,z,v)
        if v >= v_max:
            v_max = v
            x_tmp, y_tmp, z_tmp = x, y, z

x_tmp, y_tmp, z_tmp = float(x_tmp), float(y_tmp), float(z_tmp)

x_tmp2, y_tmp2, z_tmp2, v_max2 = 0,0,0,0

for i in range(0,200,1):
    delta = -0.99 + i / 100.0
    x = x_tmp + delta
    for j in range(0, 200,1):
        delta2 = -0.99 + j / 100.0
        y = y_tmp + delta2
        z = l - x - y
        v = x * y * z
        print(v, x, y, z)

        if v >= v_max2:
            v_max2 = v
            x_tmp2, y_tmp2, z_tmp2 = x, y, z

print(v_max2)

Submission status: Wrong Answer

Solution code:
l = int(input())
x_tmp, y_tmp, z_tmp, v_max = 0,0,0,0

for i in range(1,l//3+1):
    x = i
    for j in range(x, (l-x)//2+1, 1):
        y = j
        z = l - x - y
        v = x * y * z
        print(x,y,z,v)
        if v >= v_max:
            v_max = v
            x_tmp, y_tmp, z_tmp = x, y, z


x_tmp2, y_tmp2, z_tmp2, v_max2 = 0,0,0,0

for i in range(0,200,1):
    delta = -0.99 + i / 100.0
    x = x_tmp + delta
    for j in range(0, 200,1):
        delta2 = -0.99 + j / 100.0
        y = y_tmp + delta2
        z = l - x - y
        v = x * y * z

        if v >= v_max2:
            v_max2 = v
            x_tmp2, y_tmp2, z_tmp2 = x, y, z

print(v_max2, x_tmp2, y_tmp2, z_tmp2)

Submission status: Wrong Answer

Solution code:
l=int(input())
ans=0
for y in range(1,1001):
    for z in range(1,1001):
        if(l-y-z<=0):
            continue
        else:
            ans=max(ans,y*z*(l-y-z))
print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

print(format((L*3/9),'.20f'))

Submission status: Wrong Answer

Solution code:
L = int(input())

print(format((L*3/27),'.20f'))

Submission status: Wrong Answer

Solution code:
L = int(input())

print(L*3/27)

Submission status: Wrong Answer

Solution code:
L = int(input())
V = [float(0)]*10000
for x in range(1,10000):
    V[x] = (x*0.1)**2 *(L-2*(x*0.1))
print(max(V))

Submission status: Wrong Answer

Solution code:
L = int(input())
V = [0]*10000
for x in range(1,10000):
    V[x] = (x*0.1)**2 *(L-2*(x*0.1))
print(max(V))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())

v = (l/3)**2

print(v)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:

n=int(input())
ans=0
if n%3==0:
    print(n//3*n//3*n//3)
elif n%3==1:
    print(n//3*n//38*(n//3+1))
else:
    print(n//3*(n//3+1)*(n//3+1))

Submission status: Wrong Answer

Solution code:
L = int(input())

res = 0
result = 0
for i in range(1,L):
    for j in range(1,L-1):
        l = L - i - j
        res = i * j * l
        result = max(res,result)

print(result)

Submission status: Wrong Answer

Solution code:
L = int(input())

res = 0
result = 0
for i in range(1,L):
    for j in range(1,L):
        l = L - i - j
        res = i * j * l
        result = max(res,result)

print(result)

Submission status: Wrong Answer

Solution code:
L = int(input())

res = 0
result = 0
for i in range(1,L):
    for j in range(1,L - i):
        l = L - i - j
        res = i * j * l
        result = max(res,result)

print(result)

Submission status: Wrong Answer

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

L=int(input())
div =0.001
ranges =np.arange(0.001,L+1,0.01)

V=0
for x in ranges:
    z=L-2*x
    V=max(V,x*x*z)

print(V)


# for x in np.arange(1,10+1,0.1):
#     for y in np.arange(1,10+1-x,0.1):
#         print(x,y)

Submission status: Wrong Answer

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

L=int(input())
div =0.01
V=0
for x in np.arange(div,L+1,div):
    y=x
    z=L-x-y
    V=max(V,x*y*z)

print(V)


# for x in np.arange(1,10+1,0.1):
#     for y in np.arange(1,10+1-x,0.1):
#         print(x,y)

Submission status: Wrong Answer

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

L=int(input())
div =0.1
V=0
for x in np.arange(div,L+1,div):
    for y in np.arange(div,L+1-x,div):
        X = x
        Y = y
        Z = L-X-Y
        V = max(V, X*Y*Z)
print(V)


# for x in np.arange(1,10+1,0.1):
#     for y in np.arange(1,10+1-x,0.1):
#         print(x,y)

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = 0
tmp = 0

a = 0.001
b = 0.001
c = L - a - b
while (a <= L):
    while ( b <= a):
        c = L - b - a
        tmp = a * b * c
        if (ans < tmp):
            ans = tmp
        b = b + 0.005
    a = a + 0.005

print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = 0
tmp = 0

a = 0.01
b = 0.01
c = L - a - b
while (a <= L):
    while ( b <= a):
        c = L - b - a
        tmp = a * b * c
        if (ans < tmp):
            ans = tmp
        b = b + 0.01
    a = a + 0.01

print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())

x = y = z = L // 3

if L % 3 == 1:
  x = x + 1
elif L % 3 == 2:
  x, y = x + 1, y + 1
  
print(float(x * y * z))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
f = n // 3

if(f % 3 == 1):
  a, b, c = f, f, f + 1
elif(f % 3 == 2):
  a, b, c = f, f + 1, f + 1
else:
  a, b, c = f, f, f
print(a * b * c)

Submission status: Wrong Answer

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

L=int(input())
div =1000000
V=0
for x in [i/div for i in range(1,L+1)]:
    for y in [j/div for j in range(1,L-int((x*div))+1)]:
        X=(x*div)
        Y=(y*div)
        Z = L-X-Y
        V = max(V, X*Y*Z)
print(V)

Submission status: Wrong Answer

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

L=int(input())
div =100000
V=0
for x in [i/div for i in range(1,L+1)]:
    for y in [j/div for j in range(1,L-int((x*div))+1)]:
        X=(x*div)
        Y=(y*div)
        Z = L-X-Y
        V = max(V, X*Y*Z)
print(V)

Submission status: Wrong Answer

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

L=int(input())
div =100000
V=0
for x in [i/div for i in range(L+1)]:
    for y in [j/div for j in range(L-int((x*div))+1)]:
        X=(x*div)
        Y=(y*div)
        Z = L-X-Y
        V = max(V, X*Y*Z)
print(V)

Submission status: Wrong Answer

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

L=int(input())
div =10000
V=0
for x in [i/div for i in range(L+1)]:
    for y in [j/div for j in range(L-int((x*div))+1)]:
        X=(x*div)
        Y=(y*div)
        Z = L-X-Y
        V = max(V, X*Y*Z)
print(V)

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 [i/1000 for i in range(L+1)]:
    for y in [j/1000 for j in range(L-int((x*1000))+1)]:
        X=(x*1000)
        Y=(y*1000)
        Z = L-X-Y
        V = max(V, X*Y*Z)
print(V)

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 [i/100 for i in range(L+1)]:
    for y in [j/100 for j in range(L-int((x*100))+1)]:
        X=(x*100)
        Y=(y*100)
        Z = L-X-Y
        V = max(V, X*Y*Z)
print(V)