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:
L=int(input())
ans=0
tmp=0
d=4
for i in range(int(L*d/1.7)):
  for j in range(int((L*d-i)/1.7)):
    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())

print(pow(L//3 ,3))

Submission status: Wrong Answer

Solution code:
l = int(input())
syo = l % 3
v = 0

if syo == 0:
    v = (l//3)**3
    print(v)
elif syo == 1:
    v = ((l-1)//3)**2 * ((l-1)//3 +1)
    print(v)
elif syo == 2:
    v = ((l+1)//3)**2 * ((l+1)//3 -1)
    print(v)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=3
for i in range(int(L*d/1.7)):
  for j in range(int((L*d-i)/1.7)):
    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=3
for i in range(int(L*d/1.4)):
  for j in range(int((L*d-i)/1.4)):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
print(ans)

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(float(a*b*c))

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=3
for i in range(int(L*d/1.3)):
  for j in range(int((L*d-i)/1.3)):
    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())
L=L*10
V_new=1
for x in range(1,L+1):
  for y in range(1,L-x):
    V=x*y*(L-x-y)
    if V>V_new:
      V_new=V
print(V_new/10)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=3
for i in range(int(L*d/1.5)):
  for j in range(int((L*d-i)/1.5)):
    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())

x=round(L/3,3)

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

Submission status: Wrong Answer

Solution code:
l = int(input())
_l = l
if _l < 3:
    l *= 10

ans = 0
for i in range(1, l):
    for j in range(1, l-i):
        k = l - (i + j)
        ans = max(ans, i*j*k)

print(ans if _l >= 3 else ans/1000)

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, 1):
        z = l - (i+j)
        result = z*i*j
        if(result>Ma):
            Ma = result
print(Ma/1000)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=3
for i in range(int(L*d/2)):
  for j in range(int((L*d-i)/2)):
    tmp=(i/d)*(j/d)*(L-(i/d)-(j/d))
    ans=max(ans,tmp,0)
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):
    # finding length
    length = int(s / 3)

    s -= length

    # finding breadth
    breadth = s / 2

    # finding height
    height = s - breadth

    return [length , breadth , height]


# Driven Program
s =int(input())
t=maxvolume(s)
if sum(t)==s:
    print(format((t[0]*t[1]*t[2]), '.10f'))
    #print(t[0]*t[1]*t[2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
V_new=1
for x in range(1,L+1):
  for y in range(1,L-x):
    V=x*y*(L-x-y)
    if V>V_new:
      V_new=V
print(V_new)

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.5):
			v = x * y * (l - x - y)
			if v > max:
				max = v
print(max)

Submission status: Wrong Answer

Solution code:
import decimal

L=int(input())

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=3
for i in range(int(L*d/2)):
  for j in range(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())

max = 0
X=0
Y=0
Z=0

for x in range(L+1):
  for y in range(L-x+1):
    z = L-x-y
    if x*y*z >= max:
      max = x*y*z
      X = x
      Y = y
      Z = z

for i in range(1000):
  for s in range(1000):
    new_z = L - (float(X)-0.5+i*0.001) - (float(Y)-0.5+s*0.001)
    if new_z * (float(X)-0.5+i*0.001) * (float(Y)-0.5+s*0.001) >= max:
      max = new_z * (float(X)-0.5+i*0.001) * (float(Y)-0.5+s*0.001)

print(max)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


L = int(input())

x=y=z=0




p = 0.01

maxV = 0

for x in range(1,L*100+1,1):
    for y in range(1,L*100+1,1):
        z = L-(x*p+y*p)

        V = x*y*z*p*p
    
        if maxV < V:
            maxV = V


print(maxV)

Submission status: Wrong Answer

Solution code:
import decimal

L=int(input())

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

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

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

Submission status: Wrong Answer

Solution code:
from statistics import mean, median,variance,stdev
n = int(input())

res = [0,0,0]
for i in range(1,n+1):
    #print(i)
    for j in range(1,n-i):
        #print(i,j,n - (i+j))
        if res[0] * res[1] * res[2] < i * j * (n - (i+j)):
            res = [i,j,n - (i+j)]
            
#print(res)
print(res[0] * res[1] * res[2])

Submission status: Wrong Answer

Solution code:
L = int(input())

max = 0
X=0
Y=0
Z=0

for x in range(L+1):
  for y in range(L-x+1):
    z = L-x-y
    if x*y*z >= max:
      max = x*y*z
      X = x
      Y = y
      Z = z

for i in range(100):
  for s in range(100):
    new_z = L - (float(X)+i*0.01) - (float(Y)+s*0.01)
    if new_z * (float(X)+i*0.01) * (float(Y)+s*0.01) >= max:
      max = new_z * (float(X)+i*0.01) * (float(Y)+s*0.01)

print(max)

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

for i in range(0, l+1, 1):
    for j in range(0, 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 numpy as np
ans_raw = []
L = int(input())

for i in np.arange(0.1, L/2, 0.1):
    for k in np.arange(0.1, L/2 , 0.1):
        ans = i * k * (L - i - k)
        ans_raw.append(ans)

print(max(ans_raw))

Submission status: Wrong Answer

Solution code:
import numpy as np
l = int(input())

if l >= 3:
    ans = 0
    for i in range(1, l):
        for j in range(1, l-i):
            k = l - (i + j)
            ans = max(ans, i*j*k)
    print(ans)
else:
    ans = 0
    for i in np.arange(0.1, l+0.1, 0.1):
        for j in np.arange(0.1, l+0.1-i, 0.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())
tmp2=0
L*=10
for x in range(1,L+1):
    if x>(L+1)/2:
        print(tmp2/1000)
        exit(0)
    for y in range(1,L-x+1):
        z=L-x-y
        tmp=x*y*z
        if tmp>tmp2:
            tmp2=tmp

print(tmp2)

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 "{:.12f}".format(maxvalue)
n = int(input())
print(maxvolume(n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=2
for i in range(L*d):
  for j in range(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:
sum = int(input())
max = 1
for i in range(10,int(sum*10/2)):
    a = i/10
    for j in range(10,int(i)):
        b = j/10
        c = sum - a - b
        if a*b*c>max:
            max = a*b*c
print(max)

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())
ans = 0

for x in np.arange(0,L+1+0.01,0.01):
    t = ((L-x)/2)**2

    if ans < x*t:
        ans = x*t
    else:
        continue



print(ans)

Submission status: Wrong Answer

Solution code:
l=int(input())
if l==1:
	print("%.18f"%((1/3)**3))
	exit()
if l==2:
	tt=2/3
	print("%.18f"%((tt)**3))
	exit()
a=l/3
b=l/3
c=l/3
temp=l%3
# ans=0 
if temp==0:
	ans=(a*b*c)
	print("%.18f"%(ans))
	exit()
if temp==1:
	a+=(1/3)
	b+=(1/3)
	c+=(1/3)
	ans=a*b*c
	print("%.18f"%(ans))
	exit()
if temp==2:
	tt=2/3
	ans=(a+tt)*(b+tt)*(c+tt)
	print("%.18f"%(ans))
	exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=5
for i in range(L*d):
  for j in range(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())

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

Submission status: Wrong Answer

Solution code:
import sys
import os
import time
import collections
from collections import Counter, deque
import itertools
import math
import timeit
import random
from io import BytesIO, IOBase
from bisect import bisect_left as bl
from bisect import bisect_right as br 
#########################
# imgur.com/Pkt7iIf.png #
#########################

def sieve(n):
    if n < 2: return list()
    prime = [True for _ in range(n + 1)]
    p = 3
    while p * p <= n:
        if prime[p]:
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 2
    r = [2]
    for p in range(3, n + 1, 2):
        if prime[p]:
            r.append(p)
    return r
 
def divs(n, start=1):
    divisors = []
    for i in range(start, int(math.sqrt(n) + 1)):
        if n % i == 0:
            if n / i == i:
                divisors.append(i)
            else:
                divisors.extend([i, n // i])
    return divisors
 
def divn(n, primes):
    divs_number = 1
    for i in primes:
        if n == 1:
            return divs_number
        t = 1
        while n % i == 0:
            t += 1
            n //= i
        divs_number *= t

def flin(d, x, default=-1):
    left = right = -1
    for i in range(len(d)):
        if d[i] == x:
            if left == -1: left = i
            right = i
    if left == -1:
        return (default, default)
    else:
        return (left, right)

def modpow(b,p,m):
    res=1
    b=b%m
    while(p):
        if p&1:
            res=(res*b)%m
        b=(b*b)%m
        p>>=1
    return res

def mod_inv(a,m):
    return modpow(a,m-2,m)

def ncr(n,r,m):
    res=1
    if r==0:
        return 1
    if n-r<r:
        r=n-r
    p,k=1,1
    while(r):
        res=((res%m)*(((n%m)*mod_inv(r,m))%m))%m
        n-=1
        r-=1
    return res

def ncrlis(n,r,m,fact):
    return (fact[n]*(mod_inv(fact[r],m)*mod_inv(fact[n-r],m))%m)%m

def dfs(u,lis):
    vis[u]=True
    lis.append(u)
    for v in g[u]:
        if not vis[v]:
            lis=dfs(v,lis)
    return lis
def dfsutil():
    cnc=[]
    for i in range(1,n+1):
        if not vis[i]:
            tmp=[]
            cnc.append(dfs(i,tmp))
    return cnc

def bfs(s,prev):
    q=deque()
    q.append(s)
    vis[s]=True
    while q:
        u=q.popleft()
        for v in g[u]:
            if not vis[v]:
                q.append(v)
                vis[v]=True
                #lvl[v]=lvl[u]+1
                prev[v]=u
def path(s,e):
    prev=[False for i in range(n+1)]
    bfs(s,prev)
    at=e
    res=[]
    while at!=False:
        res.append(at)
        at=prev[at]
    res.reverse()
    if res[0]==s:
        return res
    else:
        return []


def ceil(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def prr(a, sep=' '): print(sep.join(map(str, a)))
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def ddd(): return collections.defaultdict(collections.defaultdict(int))
 
 
# region fastio
 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
	newlines = 0
 
	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = "x" in file.mode or "r" not in file.mode
		self.write = self.buffer.write if self.writable else None
 
	def read(self):
			while True:
					b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
					if not b:
							break
					ptr = self.buffer.tell()
					self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
			self.newlines = 0
			return self.buffer.read()
 
	def readline(self):
			while self.newlines == 0:
					b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
					self.newlines = b.count(b"\n") + (not b)
					ptr = self.buffer.tell()
					self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
			self.newlines -= 1
			return self.buffer.readline()
 
	def flush(self):
			if self.writable:
					os.write(self._fd, self.buffer.getvalue())
					self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
	def __init__(self, file):
			self.buffer = FastIO(file)
			self.flush = self.buffer.flush
			self.writable = self.buffer.writable
			self.write = lambda s: self.buffer.write(s.encode("ascii"))
			self.read = lambda: self.buffer.read().decode("ascii")
			self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

'''def isPalindrome(s):
    return s==s[::-1]

for _ in range(ii()):
    s=input()
    n=len(s)
    d=ddl()
    for i in range(n):
        d[s[i]].append(i)
    a=''
    idx=-1
    for i in range(len(s)):
        if s[i]==s[n-1-i]:
            a+=s[i]
        else:
            idx=i
            break
    if idx==-1:
        print(s)
        continue
    idx2,idx3=-1,-1
    ch1,ch2=s[idx],s[n-idx-1]
    f1,f2=False,False
    if len(d[ch1])>1:
        for i in range(1,len(d[ch1])-1):
            if d[ch1][i+1]
    if idx2!=-1:
        f1=isPalindrome(s[idx:idx2+1])
    if idx3!=-1:
        f2=isPalindrome(s[idx3:n-idx])
    l1,l2=idx2-idx+1,n-idx-idx3
    if f1 and f2 and l1>=l2:
        print(a+s[idx:idx2+1]+a[::-1])
    elif f1 and f2 and l1<l2:
        print(a+s[idx3:n-idx]+a[::-1])
    elif f1:
        print(a+s[idx:idx2+1]+a[::-1])
    elif f2:
        print(a+s[idx3:n-idx]+a[::-1])
    else:
        print(a+s[idx]+a[::-1])'''

n=ii()
mx=0
a=[i for i in range(1,n+1)]
for i in range(n):
    l,r=i,n-1
    while(l<=r):
        if a[l]+a[r]+a[i]==n:
            mx=max(mx,a[l]*a[r]*a[i])
            l+=1
            r-=1
        elif a[l]+a[r]+a[i]<n:
            l+=1
        else:
            r-=1
print(mx)

Submission status: Wrong Answer

Solution code:
# coding:utf-8

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


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

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

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


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

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

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



print(ans/(10**6))

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:

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 = int(input())
print( maxvolume(s) )

Submission status: Wrong Answer

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

from decimal import *
import numpy as np


getcontext().prec = 6

L = int(input())
L = Decimal(L)

x=y=z=0
x = Decimal(x)
y = Decimal(y)
z = Decimal(z)


p = 0.1
p = Decimal(p)

maxV = 0

for x in np.arange(p,L+1,p):
    for y in np.arange(p,L+1,p):
        z = L-(x+y)

        V = x*y*z
    
        if maxV < V:
            maxV = V


print(maxV)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=1
for i in range(L*d):
  for j in range(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:
n = int(input())
l = n/3
print(l*3)

Submission status: Wrong Answer

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

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

L = int(input())

ans = 0
for x in range(math.floor(L/3)-1, math.ceil(L/3)+1):
    for y in range(math.floor(L/3)-1, math.ceil(L/3)+1):
        for z in range(math.floor(L/3)-1, math.ceil(L/3)+1):
            if x+y+z == L:
                tmp = x*y*z
                ans = max(ans, tmp)
print(float(ans))

Submission status: Wrong Answer

Solution code:
l = int(input())

res = []
for i in range(l+1):
    for j in range(l+1-i):
        res.append(i*j*(l-i-j))
max(res)

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
n = int(input())
print(maxvolume(n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())
dp = 1
for a in range(1,L-2):
    for b in range(1,L-3-a):
        dp = max(dp, a*b*(L-a-b))
print(dp)

Submission status: Wrong Answer

Solution code:
L=int(input())
ans=0
tmp=0
d=10
for i in range(L*d):
  for j in range(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())
if l==1:
	print((0.33333333333333333333333)**3)
	exit()
if l==2:
	tt=0.666666666666666666666666667
	print(tt*tt*tt)
	exit()
a=l/3
b=l/3
c=l/3
temp=l%3
# ans=0 
if temp==0:
	ans=(a*b*c)
	print("%.18f"%(ans))
	exit()
if temp==1:
	ans=(a+0.33333333333333333333333)*(b+0.33333333333333333333333)*(c+0.33333333333333333333333) 
	print("%.18f"%(ans))
	exit()
if temp==2:
	tt=0.666666666666666666666666667
	ans=(a+tt)*(b+tt)*(c+tt)
	print("%.18f"%(ans))
	exit()

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())
ans = 0

for x in np.arange(0,L+1,0.01):
    t = ((L-x)/2)**2

    if x == 0:
        if ans < t:
            ans = t
        else:
            continue
    elif t == 0:
        if ans < x:
            ans = x
        else:
            continue
    else:
        if ans < x*t:
            ans = x*t
        else:
            continue



print(ans)

Submission status: Wrong Answer

Solution code:
def maxVolume(L):
    length = int(L / 3)
    L -= length
    breadth = L / 2

    height = L - breadth

    print(length * breadth * height)


L = int(input())
maxVolume(L)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L= int(input())
tmp = 0
if L%3 == 0:
    for a in range(1,L):
        for b in range(1,L-a):
            c=L-a-b
            tmp = max(tmp,a*b*c)
elif L <= 2:
    step = [i/100 for i in range(1,L*100)]
    for s in step:
        for t in step:
            u=L-s-t
            tmp = max(tmp, s*t*u)
else:
    for a in range(1,L):
        for b in range(1,L-a):
            c=L-a-b
            if tmp < a*b*c:
                tmp = a*b*c
                ans = [a,b]
    step = [i/100 for i in range(0,100)]
    for s in step:
        a = ans[0]+s
        for t in step:
            b = ans[1]+t
            c = L-a-b
            tmp = max(tmp, a*b*c)
print(tmp)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    s=float(input())
    mod=s%3
    news=s-mod
    each=news//3
    l=b=h=each
    if mod==1:
        l+=mod
    elif mod ==2:
        l+=mod/2
        b+=mod/2
    vol=l*b*h
    print(vol)
main()

Submission status: Wrong Answer

Solution code:
l=int(input())
if l==1:
	print((0.33333333333333333333333)**3)
	exit()
if l==2:
	tt=0.666666666666666666666666667
	print(tt*tt*tt)
	exit()
a=l/3
b=l/3
c=l/3
temp=l%3
# ans=0 
if temp==0:
	ans=(a*b*c)
	print("%.8f"%(ans))
	exit()
if temp==1:
	ans=(a+0.33333333333333333333333)*(b+0.33333333333333333333333)*(c+0.33333333333333333333333) 
	print("%.8f"%(ans))
	exit()
if temp==2:
	tt=0.666666666666666666666666667
	ans=(a+tt)*(b+tt)*(c+tt)
	print("%.8f"%(ans))
	exit()

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())
ans = 0

for x in np.arange(0,L+1,0.01):
    t = ((L-x)/2)**2
    if ans < x*t:
        ans = x*t
    else:
        continue

print(ans)

Submission status: Wrong Answer

Solution code:
L = int(input())
if L % 3 == 0:
  b = [i + 1 for i in range(L)]
  k = [(i * (L - i) * (L - i)) / 4 for i in b]
  print(max(k))
else: 
  import numpy as np
  b = np.arange(0.1, L+0.01, 0.01)
  k = [(i * (L - i) * (L - i)) / 4 for i in b]
  print(max(k))

Submission status: Wrong Answer

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

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 = int(input())
print(maxVolume(L))

Submission status: Wrong Answer

Solution code:
L = int(input())
if L % 3 == 0:
  b = [i + 1 for i in range(L)]
  k = [(i * (L - i) * (L - i)) / 4 for i in b]
  print(max(k))
else: 
  import numpy as np
  b = np.arange(0.1, L+0.05, 0.05)
  k = [(i * (L - i) * (L - i)) / 4 for i in b]
  print(max(k))

Submission status: Wrong Answer

Solution code:
l = int(input())
Ma = 0
import numpy as np
for i in np.arange(0,l+1,1):
    for j in np.arange(0,i+1,1):
        z = l - (i+j)
        result = z*i*j
        if(result>Ma):
            Ma = result
print(Ma)

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())
ans = 0

for x in np.arange(0,L,0.01):
    t = ((L-x)/2)**2
    if ans < x*t:
        ans = x*t
    else:
        continue

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=int(input())
if l==1:
	print((0.33333333333333333333333)**3)
	exit()
if l==2:
	tt=0.666666666666666666666666667
	print(tt*tt*tt)
	exit()
a=l/3
b=l/3
c=l/3
temp=l%3
# ans=0 
if temp==0:
	ans=(a*b*c)
	print("%.8f"%(ans))
	exit()
if temp==1:
	ans=(a+0.5)*(b+0.5)*c 
	print("%.8f"%(ans))
	exit()
if temp==2:
	tt=0.666666666666666666666666667
	ans=(a+tt)*(b+tt)*(c+tt)
	print("%.8f"%(ans))
	exit()

Submission status: Wrong Answer

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

for i in range(1000):
    for j in range(1000):
        if i+j <= l:
            if v < i*j*(l-(i+j)):
                v = i*j*(l-(i+j))
print (v)

Submission status: Wrong Answer

Solution code:
L = int(input())
if L % 3 == 0:
  b = [i + 1 for i in range(L)]
  k = [(i * (L - i) * (L - i)) / 4 for i in b]
  print(max(k))
else: 
  import numpy as np
  b = np.arange(0.1, L+0.1, 0.1)
  k = [(i * (L - i) * (L - i)) / 4 for i in b]
  print(max(k))

Submission status: Wrong Answer

Solution code:
import numpy as np

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

Submission status: Wrong Answer

Solution code:
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 = (l/3)**3
        
print(v_m)

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())
ans = 0

for x in np.arange(1,L,0.001):
    t = ((L-x)/2)**2
    if ans < x*t:
        ans = x*t
    else:
        continue

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

l = int(input())
result = 0

if l % 3 == 0:
    result = ((l /3) ** 3)


print(round(result,7))

Submission status: Wrong Answer

Solution code:
import numpy as np

L = int(input())
ans = 0

for x in np.arange(1,L,0.01):
    t = ((L-x)/2)**2
    if ans < x*t:
        ans = x*t
    else:
        continue

print(ans)

Submission status: Wrong Answer

Solution code:
l=int(input())
if l==1:
	print((1/3)**3)
	exit()
if l==2:
	print(0.25)
	exit()
a=l/3
b=l/3
c=l/3
temp=l%3
# ans=0 
if temp==0:
	ans=(a*b*c)
	print("%.8f"%(ans))
	exit()
if temp==1:
	ans=(a+0.5)*(b+0.5)*c 
	print("%.8f"%(ans))
	exit()
if temp==2:
	ans=(a+2/3)*(b+2/3)*(c+2/3)
	print("%.8f"%(ans))
	exit()

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):
    # finding length
    length = int(s / 3)

    s -= length

    # finding breadth
    breadth = s / 2

    # finding height
    height = s - breadth

    return length * breadth * height


# Driven Program
s =int(input())
t=maxvolume(s)
print(t)

Submission status: Wrong Answer

Solution code:
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 = (l/3)**3
        
print(l)

Submission status: Wrong Answer

Solution code:
import math

L = int(input())

kirei = float(L) // 3.0
amari = float(L) % 3.0

print(kirei**2 * (kirei+amari))

Submission status: Wrong Answer

Solution code:
L = int(input())

l = L//3
m = L%3

print(float(l*l*(l+m)))

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

l = int(input())

max = 0

for i in range(l+1):
    for j in range(l+1):
        num = i * j * (l - i -j)
        if (num > max):
            max = num
print(max)

Submission status: Wrong Answer

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

for i in range(l):
    a = i*((l-i)/2)*((l-i)/2) if a < i*((l-i)/2)*((l-i)/2) else a

print(float(a))

Submission status: Wrong Answer

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

MOD = 10 ** 9 + 7


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

    L = int(sys.stdin.buffer.readline().rstrip())
    if L == 1:
        print(0.027)
        exit()

    if L == 2:
        print(0.287496)
        exit()

    ret = 0
    for l in range(L):
        for m in range(L - l):
            ret = max(ret, l * m * (L - l - m))

    print(ret)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
L = int(input())

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

Submission status: Wrong Answer

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

MOD = 10 ** 9 + 7


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

    L = int(sys.stdin.buffer.readline().rstrip())
    if L == 1:
        print(0.027)
        exit()

    if L == 2:
        print(0.287496)
        exit()

    ret = 0
    for l in range(L-2):
        for m in range(L - l - 1):
            ret = max(ret, l * m * (L - l - m))

    print(ret)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
L =int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())
n = 3
l = [(x + i) // n for i in range(n)]
print(float(l[0] * l[1] * l[2]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(1, L - 1):
    for j in range(1, L - 1):
        val = i * j * (L - i - j)
        if val > Max:
            val, Max = Max, val

print(Max)