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())
x = int(L/3)

if L%3 >= 1:
    y = int(L/3) + 1
else:
    y = int(L/3)

if L%3 >= 2:
    h = int(L/3) + 1
else:
    h = int(L/3)

print(x**3)

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:
# 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*10
#dp = [[[0] for i in range(L)] for j in range(L)]
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/1000)

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 
cc=0
while temp>0:
	temp-=0.5 
	if cc%3==0:
		a+=0.5
	elif cc%3==1:
		b+=0.5 
	else:
		c+=0.5
	cc+=1 
print("%.8f"%(a*b*c))

Submission status: Wrong Answer

Solution code:
L =int(input())

if L == 1:
    print('0.37036926')
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:
L = int(input())

max = 0
for x in range(L * 10):
    pre = 0
    x1 = x + 1
    for y in range((L - x1) * 10):
        y1 = y + 1
        z1 = L - x1 - y1
        x2 = x1 / 10
        y2 = y1 / 10
        z2 = z1 / 10
        if pre != 0:
            if x2*y2*z2< pre:break
        if x2*y2*z2 > max: max = x2*y2*z2
        pre = x2*y2*z2
print(max * 1000)

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 
cc=0
while temp>0:
	temp-=0.5 
	if cc%3==0:
		a+=0.5
	elif cc%3==1:
		b+=0.5 
	else:
		c+=0.5 
print("%.8f"%(a*b*c))

Submission status: Wrong Answer

Solution code:
a = int(input())
if a < 3:
	print(0)
else:
	v = 0
	for x in range(1,a+1):
		for y in range(1,a+1):
			z = a - (x + y)
			v = max(v, x*y*z)
	print(v)

Submission status: Wrong Answer

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

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

print(v)

Submission status: Wrong Answer

Solution code:
def maxvolume(s):
    maxvalue = 0

    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 =float(max(maxvalue, float(i * j * k)))

    return maxvalue


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

Submission status: Wrong Answer

Solution code:
a = int(input())
if a < 3:
	print(0)
else:
	x = 1
	y = 1
	v = 0
	for x in range(1,a):
		for y in range(1,a):
			z = a - (x + y)
			v = max(v, x*y*z)
	print(v)

Submission status: Wrong Answer

Solution code:
a = int(input())
if a < 3:
	print(0)
else:
	x = 1
	y = 1
	v = 0
	for x in range(1,a-1):
		for y in range(1,a-1):
			z = a - (x + y)
			v = max(v, x*y*z)
	print(v)

Submission status: Wrong Answer

Solution code:
l = int(input())

print(pow(l/3, 2))

Submission status: Wrong Answer

Solution code:
L=int(input())
tmp2=0
L*=10
for x in range(1,L+1):
    for y in range(1,L-x+1):
        z=L-x-y
        tmp=x*y*z
        if tmp>tmp2:
            tmp2=tmp

print(tmp2/1000)

Submission status: Wrong Answer

Solution code:
x = int(input())

num = x // 3
rem = x % 3

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

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

else:
    res = num ** 3

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def judge(s):
    ok = True
    n = len(s)
    m = (n - 1) // 2
    if (n == 1):
        ok = True
    else:
        if (m == 0):
            ok = (s[0] == s[1])
        else:
            for i in range(m):
                if s[i] != s[(n-1)-i]:
                    ok = False
                    break
    return ok

def strong_judge(s):
    ok = judge(s)
    n = len(s)
    m = (n - 1) // 2
    kf = (m - 1) // 2
    kb = m + kf + 1
    sf = s[0:m]
    sb = s[(m + 1):n]
    if ok:
        ok = judge(sf) and judge(sb)
    return ok

s = str(input())

if ((len(s) % 2 == 0) or (len(s) > 99) or (len(s) < 3)):
    print("No")
else:
    if strong_judge(s):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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 < 3:
    step = [i/10 for i in range(1,L*10)]
    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/10 for i in range(1,10)]
    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:
import math
L = int(input())
m = 0
for i in range(L+1):
    for j in range(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 = int(input())
max = 0
for x in range(l):
	for y in range(l):
			v = x * y * (l - x - y)
			if v > max:
				max = v
print(float(max))

Submission status: Wrong Answer

Solution code:
L = int(input())

x = int(L / 3)
y = L % 3

if y == 0:
    A = x ** 3
elif y == 1:
    A = x * x * (x + 1)
elif y == 2:
    A = x * (x + 1) * (x + 1)

print(A)

Submission status: Wrong Answer

Solution code:
def resolve():
    L = int(input())
    divL = L//3
    restL = L - (divL*2)
    return print(float(divL**2 * restL))


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())

h = L **(1/3)

print(h**3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if(L%3==0):
    ans = (L//3)**3
else:
    if(L%3==2):
        ans = (L//3)*(L//3+1)**2
    else:
        ans = (L//3+1)*(L//3)**2
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) * (((l//3)+1)**2))

Submission status: Wrong Answer

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

for i in range(l):
    for j in range(l-i):
        k = l-(i+j)
        #print(i,j,k)
        a = i*j*k if i*j*k > a else a

print(float(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
L = int(input())
m = 0
for i in range(L):
    for j in range(L):
        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())
x = int(L/3)
print(x**3)

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().split()[0])
max_a = -float("inf")

for x in range((L + 1) * 10):
    x = x / 10
    y = x
    h = L - x - y
    if h > 0:
        max_a = max(max_a, x * y * h)
ans = max_a

print(ans)

Submission status: Wrong Answer

Solution code:
L =int(input())
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:
##C
L = int(input())
(L/3)**3

Submission status: Wrong Answer

Solution code:
L = int(input())
s = float(round(L/3))
print(format(s*s*s,'.12f'))

Submission status: Wrong Answer

Solution code:
import math
L = int(input())
m = 0
for i in range(L):
    for j in range(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())

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:
l = int(input())
i = l // 3 
print(float(i**3))

Submission status: Wrong Answer

Solution code:
l=int(input())

if l==1:
  t=l/3
  print(t*t*t)
  exit()
ans=0
for i in range(l):
  for j in range(l-i):
    ans=max(ans,i*j*(l-i-j))
print(ans)

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
x = math.floor(n / 3) * math.floor(n / 3) * math.ceil(n / 3)
print(str(x) + "." + '0' * 12)

Submission status: Wrong Answer

Solution code:
from math import sqrt
def maxVol(P, A): 
    l = (P - sqrt(P * P - 24 * A)) / 12
    V = l * (A / 2.0 - l * (P / 4.0 - l))
    return V
if __name__ == '__main__': 
    P = 20
    A = 16
    print(maxVol(P, A))

Submission status: Wrong Answer

Solution code:
#C
L = int(input())
a = L/3
b = L/3
c = L/3
print(str(round(round(a, 3)*round(b, 3)*round(c, 3),16)))

Submission status: Wrong Answer

Solution code:
l = int(input())

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

Submission status: Wrong Answer

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

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

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

    if L == 1000:
        print(37036926)
        exit()

    ret = l ** 3
    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:
#C
L = int(input())
a = L/3
b = L/3
c = L/3
print(str(round(round(a, 3)*round(b, 3)*round(c, 3),7)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())

print(L**3 / 9)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())
b = [i + 1 for i in range(L)]
k = [(i * (L - i) * (L - i)) / 4 for i in b]
print(max(k))

Submission status: Wrong Answer

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


def solve(L: int):
    if L % 3 == 0:
        print(math.pow(L/3,3))
        return
    if L % 3 == 1:
        print(math.pow(L//3,2) * (1+L//3))
        return
    if L % 3 == 2:
        print(math.pow(1+L//3,2) * (L//3))
        return
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    L = int(next(tokens))  # type: int
    solve(L)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def resolve():
    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)

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

Solution code:
# C - Maximum Volume
L = int(input())
a = L/3
ans = a**3

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
print(math.floor(n / 3) * math.floor(n / 3) * math.ceil(n / 3))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# initialization
c = L / 3

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())

lx = int(l/3)

if l%3 == 0:
    print(round(lx*lx*lx, 5))
elif l%3 == 1:
    print(round((lx+1)*lx*lx, 5))
elif l%3 == 2:
    print(round((lx+1)*(lx+1)*lx, 5))

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline


def main():
    n = int(input())
    if n % 3 == 0:
        ret = (n / 3) ** 3
    elif n % 3 == 1:
        num = round(n / 3, 1)
        ret = num * num * round(num + 0.1, 1)
    else:
        num = round(n / 3, 1)
        ret = num * num * round(num - 0.1, 1)
    print('%.12f' % ret)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

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

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

    ret = l ** 3
    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())
ans = 0
a = L / 3
b = L % 3

if L == 1:
    print(3*3*4/1000)
elif L == 2:
    print(6*7*7/1000)
elif b == 0:
    print(a**3)
elif b == 1:
    print(a*a*(a+1))
elif b == 2:
    print(a*(a+1)*(a+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())
s,a = divmod(L,3)
print((s+a)*s*s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = int(input())
S = L / 3
print(S*S*S+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+1):
    taiseki = i * j * (l-i-j)
    ans = max(ans, taiseki)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())

lx = int(l/3)

if l%3 == 0:
    print(lx*lx*lx)
elif l%3 == 1:
    print(round((lx+1)*lx*lx, 6))
elif l%3 == 2:
    print(round((lx+1)*(lx+1)*lx, 6))

Submission status: Wrong Answer

Solution code:
l = int(input())

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#C
L = int(input())
a = L/3
b = L/3
c = L/3
print(str(round(a, 3)*round(b, 3)*round(c, 3)))

Submission status: Wrong Answer

Solution code:
a = int(input())
if a < 3:
	print(0)
else:
	yy = a // 3
	x = yy
	y = yy
	z = yy
	r = a % 3
	if r == 1:
		z+=1
	elif r == 2:
		z+=1
		y+=1
	print(x*y*z)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L= int(input())
tmp = 0
if L >= 3:
    for a in range(1,L):
        for b in range(1,L-a):
            c=L-a-b
            tmp = max(tmp, a*b*c)
else:
    step = [i/10 for i in range(1,L*10)]
    for s in step:
        for t in step:
            u=L-s-t
            tmp = max(tmp, s*t*u)
print(tmp)

Submission status: Wrong Answer

Solution code:
n = int(input())

a = n/3
b = n/3
c = n/3

res = a*b*c

print("{:.6}".format(res))

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 int(length * breadth * height) 
	
# Driven Program 
s = int(input())
print( maxvolume(s) ) 

# This code is contributed by "Sharad_Bhardwaj".

Submission status: Wrong Answer

Solution code:
L = int(input())

V = 0

for w in range(1001):
    for h in range(1001):
        d = L - w - h
        if d <= 0:
            continue
        V = max(V, w * h * d)
print(V)

Submission status: Wrong Answer

Solution code:
n = int(input())

w = int(n/3)
h = int(n/3)
t = n - int(n/3) -int(n/3)

print(w * h * t)

Submission status: Wrong Answer

Solution code:
L=int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import math
import itertools
import statistics
#n, m = list(map(int, input().split()))
L = int(input())

x = L//3
ans = (x*x*(L-x*2))
print(float(ans))

Submission status: Wrong Answer

Solution code:

#C
L = int(input())
a = L/3
b = L/3
c = L/3
print(str(round(a, 2)*round(b, 2)*round(c, 2)))

Submission status: Wrong Answer

Solution code:
L=int(input())

if L%3==0:
    a=L/3
    ans=a*a*a
elif L%3==1:
    a=(L+2)/3
    ans=a*(a-1)*(a-1)
elif L%3==2:
    a=(L+1)/3
    ans=a*a*(a-1)

print(ans)

Submission status: Wrong Answer

Solution code:
from decimal import Decimal
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    L = input()

    l1 = Decimal(L) // Decimal('3')
    l2 = l1
    l3 = Decimal(L) - l1 - l2
    print(l1 * l2 * l3)


main()

Submission status: Wrong Answer

Solution code:
l = int(input())
v_m = 0
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
            
print(v_m)

Submission status: Wrong Answer

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

ans=-1;
if l<=3:
	print("1");
else:
	for i in range(1,l-1):
		for j in range(1,l):
			ans=max(ans,i*j*(l-i-j));
	print(ans)

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

i_i = lambda: int(i_s())
i_l = lambda: list(map(int, stdin.readline().split()))
i_s = lambda: stdin.readline().rstrip()

L = i_i()

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

print(ans)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

L1 = L//3
L -= L1
L2 = L//2
L -= L2
print(L1*L2*L)

Submission status: Wrong Answer

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

    L = int(sys.stdin.buffer.readline().rstrip())

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

x=0
if int(L)<=2:
    print((int(L)/3)**3)
else:
    for i in range(int(L)):
        if 3*x < int(L):
            x += 1
        else:
            break
    print(x**3)

Submission status: Wrong Answer

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

L = int(input())

maxV = 0

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

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


print(maxV)

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = 0
for a in range(1, L):
    for b in range(1, L):
        c = L - a - b
        if c > 0:
            res = a * b * c
            ans = max(ans, res)

print(ans)

Submission status: Wrong Answer

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

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())
length = int(L/3)
print(float(length * length * (L - 2 * length)))

Submission status: Wrong Answer

Solution code:
l = int(input())

def f(x,y):
    z = l-x-y
    if z<1 or z>l:
        print(x,y,z)
        return -1
    return x*y*z

def fp(x,y):
    dx = y*(l-x-y) - x*y
    dy = x*(l-x-y) - x*y
    return dx,dy

x = 1.0
y = 1.0
while True:
    dx,dy = fp(x,y)
    if dx<10**-8 and dy<10**-8:
        print(f(x,y))
        exit()

    x += dx * 10**-5
    y += dy * 10**-5

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L= int(input())
tmp = 0
for a in range(1,L):
    for b in range(1,L-a):
        c=L-a-b
        tmp = max(tmp, a*b*c)
print(tmp)

Submission status: Wrong Answer

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

    L = int(sys.stdin.buffer.readline().rstrip())
    f = L % 3
    l = L // 3
    print(l ** 3 if f == 0 else l*l*(l+1) if f == 1 else l*(l+1)*(l+1))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
L = int(input())
res = 0
for a in range(1, 1001):
    for b in range(1, 1001):
        c = L - a - b
        res = max(res, a * b * c)
print(res)

Submission status: Wrong Answer

Solution code:
l = int(input())

ans = 0
if l >= 3:
    for i in range(l):
        if (l - i) % 2 == 0:
            a = (l - i) / 2
            b = (l - i) / 2
        else:
            a = ((l - i) / 2)
            b = (l - i) / 2
        ans = max(ans, a * b * i)
else:
    i = 0
    while i < l:
        if (l - i) % 2 == 0:
            a = (l - i) / 2
            b = (l - i) / 2
        else:
            a = ((l - i) / 2)
            b = (l - i) / 2
        ans = max(ans, a * b * i)
        i += 0.1

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-i):
        k = l-i-j
        if i+j+k != l:
            continue
        ans = max(ans, i*j*k)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

a = N //3
b = N//3
print(a*b*(N-a-b))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
L = int(input())

mx = -1
for i in range(1,L+1):
    for j in range(1,L+1):
        z = L - (i + j)
        if (z + i + j) == L:
            buf = z*i*j
            if buf > mx:
                mx = buf
print(mx)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 0
for i in range(N):
    for j in range(N):
        k = N - i - j
        if k>0:
            vol = i * j * k
            ans = max(ans,vol)
        
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l = int(input())

def f(x,y):
    z = l-x-y
    if z<1 or z>l:
        print(x,y,z)
        return -1
    return x*y*z

def fp(x,y):
    dx = y*(l-x-y) - x*y
    dy = x*(l-x-y) - x*y
    return dx,dy

x = 1.0
y = 1.0
while True:
    dx,dy = fp(x,y)
    if dx<10**-8 and dy<10**-8:
        print(f(x,y))
        exit()

    x += dx * 10**-4
    y += dy * 10**-4

Submission status: Wrong Answer

Solution code:
def volume(h, w, v):
    return h * w * v

L = int(input())

max_volume = 0
for i in range(L):
    for j in range(L-i):
        k = L - i - j
        v = volume(i, j, k)
        max_volume = max(max_volume, v)

print(max_volume)

Submission status: Wrong Answer

Solution code:
def c():
    L = int(input())
    if (L % 3 == 0):
        a, b, c = (L/3, L/3, L/3)
    elif (L % 3 == 1):
        a, b, c = (L/3, L/3, L/3 + 1)
    else:
        a, b, c = (L/3, L/3 + 1, L/3 + 1)

    print(a * b * c)


##########
if __name__ == "__main__":
    c()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
l=int(input())

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

Submission status: Wrong Answer

Solution code:
L = int(input())

ans = 0
for tate in range(1, 999):
    for yoko in range(1, 999):
        takasa = L - tate - yoko
        if takasa > 0:
            ans = max(ans, tate*yoko*takasa)
print(ans)

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

    ans = 0

    for a in range(1, L):
        for b in range(1, L):
            c = L - a - b
            if c < 1:
                break
            V = a*b*c
            if V > ans:
                ans = V
    print(ans)


    return 0


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    L = int(input())

    l = L // 3
    ans = 0
    for l1 in range(l, L - 1):
        for l2 in range(l1, L - 1):
            l3 = L - l1 - l2
            ans = max(ans, l1 * l2 * l3)
    print(ans)


main()

Submission status: Wrong Answer

Solution code:
l = int(input())

max_ = 0

for i in range(l):
    for j in range(l-i):
        max_ = max(i*j*(l-i-j),max_)

print(max_)

Submission status: Wrong Answer

Solution code:
L = int(input())
ans = 0
if L >= 3:
    for i in range(1, L-1):
        for j in range(1, L-i):
            ans = max(ans, i*j*(L-i-j))
else:
    L = 10 * L
    for i in range(1, L-1):
        for j in range(1, L-i):
            ans = max(ans, i*j*(L-i-j))
    ans = ans / 1000
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

    L = int(sys.stdin.buffer.readline().rstrip())
    f = L % 3 == 0
    l = L // 3
    print(l ** 3 if f else l * l * (l + (L % 3)))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
l=int(input())
res=0
for i in range(1,l-1):
    for j in range(1,l-1):
        s=l-i-j
        if res<i*j*s:
            res=i*j*s
print(res)

Submission status: Wrong Answer

Solution code:
L = int(input())

print(L**3/3)