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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = int(input())

print((L/3)**3

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = [0 for i in range(n)]
s = 0

for i in range(n):
    b[a[i]-1] += 1

for i in range(n):
    s += (b[i]*(b[i]-1))//2

for i in range(n):
    print(s-b[a[i]-1]+1)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
# 入力
L = input()

print((L/3)**3)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l=int(input())
x=l/3
#print((l/3)**3)
print(f"{x*x*x:09f}")

Submission status: Runtime Error

Solution code:
l=int(input())
x=l/3
#print((l/3)**3)
print(f"{x*x*x:0.9f}")

Submission status: Runtime Error

Solution code:
l=int(input())
x=l/3
#print((l/3)**3)
print(f"{x*x*x:0.6f}")

Submission status: Runtime Error

Solution code:
l=float(input())
x=l/3
#print((l/3)**3)
print(f"{x*x*x:0.6f}")

Submission status: Runtime Error

Solution code:
import sys
l=int(input())
x=l/3
ans=0
print(f"{x*x*x:0.6f}")
sys.exit()
for i in [x-1,x,x+1]:
    for j in [x-1,x,x+1]:
        for k in [x-1,x,x+1]:
            if i+j+k==l:
                ans=max(ans,i*j*k)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = input()

print(pow(L/3,3))

Submission status: Runtime Error

Solution code:
L = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = int(intput())
e = l / 3.0
print(e*e*e)

Submission status: Runtime Error

Solution code:
l = float(intput())
e = l / 3.0
print(e*e*e)

Submission status: Runtime Error

Solution code:
l = float(intput())
e = l // 3.0
print(e*e*e)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define mfill(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x,y,h,w) if(0<=x&&x<h&&0<=y&&y<w)
#define y0 y12345
#define y1 y54321

#ifdef LOCAL
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug(...) 42
#endif

using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;using vvint = vector<vector<int>>;
using vll = vector<ll>;using vvll = vector<vector<ll>>;
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b){if(a>b){a=b;return 1;}return 0;}
template <class T>void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}
template <class T>T gcd(T &a, T &b){if(a<b){swap(a,b);} T r = a%b; while(r!=0){a=b;b=r;r=a%b;} return b;}

vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    debug("debug test\n");
    int n,m;cin>>n;
    double l = (double)n/3.0;
    printf("%.10f\n", l*l*l);

    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print((L/3)**3)

Submission status: Runtime Error

Solution code:
(L/3)**3

Submission status: Runtime Error

Solution code:
N = list(map(int, input().split()))
print((N/3)**3)

Submission status: Runtime Error

Solution code:
l=int(input())
print({:.10d}.format(l/3))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

print(round((N/3)**3, '.15f'))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using intl = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define repd(i, n) for(intl i = (intl)(n); i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#define repid(i, a, b) for(intl i = (intl)(a); i >= (intl)(b); i--)
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define all(x) (x).begin,(x).end()
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define length(a) (sizeof(a) / sizeof(a[0]))
#define cin(i, a) rep(i, length(a))cin >> a[i]
#define ccin(i, j, a) rep(i, length(a))rep(j, length(a[i]))cin >> a[i][j]
#define debug(x) cout << #x << ":" << x << endl
#define sqrtl sqrt
#define pb push_back
#define mp make_pair
const intl INF = 1e9;
const intl MOD = 1e9+7;
const ld eps = 1.0e-9;//-9
void fp(bool flag){
    if(flag)cout << "Yes" << endl;
    else cout << "No" << endl;
}
intl kai(intl k){
    intl a = 1;
    for(int i = 2; i <= k; i++){
        a *= i;
    }
    return a;
}
int main(){
    ld n;
    cin >> n;
    cout << fixed;
    cout << (n/3)*(n/3)*(n/3) << endl;
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = map(int,input().split())
print(n*n*n/27)

Submission status: Runtime Error

Solution code:
if __name__=="__main__":
  L=input()
  a=L/3.0
  print(a**3)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
list = []
import math
import numpy as np
import decimal

num = int(input())

if num == 3:
    print(1)
else:

    for x in np.arange(0.1,math.floor(num/2)):
        for y in np.arange(0.1,math.floor(num/2)):
            if x + y <= num:
                list.append(math.floor(x)*math.floor(y)*(num-math.floor(x)-math.floor(y)))
            else:
                None

if num ==3:
    None
else:
    list.sort()

    print(decimal.Decimal(list[-1]))

Submission status: Runtime Error

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



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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
wakarann

Submission status: Runtime Error

Solution code:
l = int(input())
ans = []
if 1<= l <= 1000:
    for i in range(1, l+1):
        for x in range(1, l+1):
            for y in range(1, l+1):
                if i + x + y == l:
                    m = i * x * y
                    ans.append(m)
    print(max(ans))

Submission status: Runtime Error

Solution code:
L=int(input())

i=1
list=[]
r=1

while(i<L):
  j=1
  while(j<L):
    list.append(j*i*(L-i-j))
    j+=1
  i+=1

print(max(list))

Submission status: Runtime Error

Solution code:
import collections
from math import factorial
from scipy.special import comb
# a = comb(n, r)
a = comb(n, r, exact=True)

def comb(n,r):
	#_a = factorial(n) / factorial(r) / factorial(n - r)
	a = comb(n, r, exact=True)
	return int(_a)


N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
#
for a in A:
	c[a]-=1
	#print(c)
	sum=0
	for b in set(c):
		if c[b]>=2:
			sum+=comb(c[b],2)
	c[a]+=1
	print(sum)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input()
b=a/3
print(b**3)
exit(0)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
#数値ひとつ
I = int(input())
#数値欲しいとき
H, W = map(int, input().split())
#文字欲しいとき
str = input()

a = (I*0.8)+(I*1)+(I*1.2)
b = I * I * I 

if(a < b):
    print(b)
else:
    print(a)

Submission status: Runtime Error

Solution code:
l = int(input())
k = 0
li = []
for i in range(1, l):
    for j in range(i, l):
        k = l - i - j
        li.append(i * j * k)
li.sort(reverse=True)
print(li[0])

Submission status: Runtime Error

Solution code:
L=int(input())

i=1
j=1
c=1
list=[]

while(i<L):
  while(j<L):
    list.append(j*i*(L-i-j))
    j+=1
  i+=1

print(max(list))

Submission status: Runtime Error

Solution code:
N = int(input())
lis = list(map(int, input().split()))

dic = {}
for num in lis:
    if num in dic:
        dic[num] = dic[num] + 1
    else:
        dic[num] = 1

answer_memo_dic = {}
for key, val in dic.items():
    ans_1 = int(val * (val -1) / 2)
    ans_2 = int((val - 1) * (val - 2) / 2)
    answer_memo_dic[key] = {"ans_1": ans_1, "ans_2": ans_2}

answer_list = []
answer_dic = {}
def answer():
    for n in lis:
        if n in answer_dic:
            answer_list.append(answer_dic[n])
        else:
            answer = 0
            for key, val in answer_memo_dic.items():
                if n == key:
                    answer += val["ans_2"]
                else:
                    answer += val["ans_1"]
            answer_list.append(answer)
            answer_dic[n] = answer

answer()
for a in answer_list:
    print(a)

Submission status: Runtime Error

Solution code:
l=int(input())
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors
d=make_divisors(l)
print(max([x*y*(l-x-y) for x in range(1,l//3+1) for y in range(1,l-x) if x in d and y in d] ))

Submission status: Runtime Error

Solution code:
L = str(input())
HWL = L/3

print(HWL ** 3)

Submission status: Runtime Error

Solution code:
list = []
import math

num = int(input())

if num == 3:
    print(1)
else:

    for x in range(math.floor(num/2)):
        for y in range(math.floor(num/2)):
            if x + y <= num:
                list.append(x*y*(num-x-y))



            else:
                None

if num ==3:
    None
else:
    list.sort()

    print(list[-1])

Submission status: Runtime Error

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

if L==1:
    res1=0
    x = np.arange(0.1, 10.1, 0.1)
    for i in x:
        for j in x:
            res1=max(res1,i*j*(L-i-j))
else:
    res=0
    for i in range(1,1001):
        for j in range(1,1001):
            res=max(res,i*j*(L-i-j))
print(res if res!=0 else res1)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main()
{
    long double l;
    cin >> l;
    long double ans = (l/3) * (l/3) * (l/3);
    printf("%Lf\n", ans);
    
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = int(input())

a = []
for i in range(1, l - 2 + 1):
    for j in range(1, i + 1):
        a.append(i * j * (l - i - j))
print(max(a))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;

int main() {
    long double l, a, c, b;
    cin >> l;

    long double ans = l / 3 * l / 3 * l / 3;


    printf("%Lf\n", ans);
    // cout << a << " " << b << " " << c << endl;
    return 0;
}

Submission status: Runtime Error

Solution code:
L =int(input())

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

Submission status: Runtime Error

Solution code:
l=int(input())
print(max([x*y*(l-x-y) for x in range(1,l//3+1) for y in range(1,l-x)]))

Submission status: Runtime Error

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

Solution code:
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int main(void){
    // Your code here!
    long double L;
    cin >> L;
    long double ans=0;
    long double  a = L/3;
    ans = a*a*a;
    cout << ans <<endl;
    
    
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
import sys

import numpy as np
from scipy.optimize import minimize


scan = sys.stdin.readline


def main():
    l = int(scan().rstrip())

    v = lambda x, n: (x[0] ** 2) * x[1] + (x[1] ** 2) * x[0] - n * x[0] * x[1]
    cons = (
        {"type": "ineq", "fun": lambda x: x[0]},
        {"type": "ineq", "fun": lambda x: x[1]},
        {"type": "ineq", "fun": lambda x: l - x[0] - x[1]}
    )

    result = minimize(v, x0=np.array([l/3, l/3]), constraints=cons, method="SLSQP")
    print(result["fun"][0])


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import math
import numpy as np

L = int(input())
#print(L)

a0 = math.floor(L/2)
#print(a0)

cand = []

if a0==1:
  b0 = -2*a0 + L
  cand.append(a0*b0*a0)
else:
  x = np.arange(0.1, a0, 0.001)
  for i in x:
    b0 = -2*i + L
    cand.append(i*b0*i)

cand_np = np.array(cand)
print(cand_np.max())

Submission status: Runtime Error

Solution code:
import math
import numpy as np

L = int(input())
#print(L)

a0 = math.floor(L/2)
#print(a0)

cand = []

if a0==1:
  b0 = -2*a0 + L
  cand.append(a0*b0*a0)
else:
  x = np.arange(0.1, a0, 0.1)
  for i in x:
    b0 = -2*i + L
    cand.append(i*b0*i)

cand_np = np.array(cand)
print(cand_np.max())

Submission status: Runtime Error

Solution code:
L = int(intput())

print(L/3**3)

Submission status: Runtime Error

Solution code:
l=int(input())
print(max([x*y*(l-x-y) for x in range(1,l-1) for y in range(1,l-x)]))

Submission status: Runtime Error

Solution code:
import math
import numpy as np

L = int(input())
#print(L)

a0 = math.floor(L/2)
#print(a0)

cand = []

if a0==1:
  b0 = -2*a0 + L
  cand.append(a0*b0*a0)
else:
  for i in range(1,a0):
    b0 = -2*i + L
    cand.append(i*b0*i)

cand_np = np.array(cand)
print(cand_np.max())

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

res2 = (x/3)**3
if res > res2:
    print(res)
else:

Submission status: Runtime Error

Solution code:
L = int(input())

num = L // 3
rem = x % 3

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

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

else:
    res = num ** 3

res2 = (x/3)**3
if res > res2:
    print(res)
else:
    print(res2)

Submission status: Runtime Error

Solution code:
L = map(int, input().split())
ans = (L/3)**3
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l=int(input())
v=float((l/3)**3)
print(f'{v:.15e}')

Submission status: Runtime Error

Solution code:
S = input()
print(S[1])
N = len(S)
print(N)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l=int(input())
v=float((l/3)**3)
print(f'{v:.18e}')

Submission status: Runtime Error

Solution code:
l = int(input())

vol = []

for x in range(1, l):
    for y in range(1, l-x):
        z = l - x -y
        t = x*y*z
        vol.append(t)

print(max(vol))

Submission status: Runtime Error

Solution code:

l = int(input())
result = 0

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


print(result)

Submission status: Runtime Error

Solution code:
import sympy
l = int(input())

x = sympy.Symbol('x')
y = sympy.Symbol('y')

f = l*x*y - y*x**2 - x*y**2

dfdx = sympy.diff(f, x)
#dfdx = sympy.diff(dfdx, y)

dfdy = sympy.diff(f, y)
#dfdy = sympy.diff(dfdy, x)

#print(f)
#print(dfdx)
#print(dfdy)
ans = sympy.solve([dfdx, dfdy])
#print(ans[0][x])

length = len(ans)
res = 0
for i in range(length):
    x1 = ans[i][x]
    y1 = ans[i][y]
    z1 = l - x1 - y1
    su = x1 * y1 * z1
    if res < su:
        res = su
        
print(float(res))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sympy as sym
L = int(input())
(x, y) = sym.symbols("x, y")
targetFunc = x*y*(L-x-y)

def AnalyzeCurry(Z):
    dx = sym.diff(Z, x)             
    dy = sym.diff(Z, y)            
    s = sym.solve([dx, dy], [x, y]) 
    return dx, dy, s


def main():
    dx, dy, s = AnalyzeCurry(targetFunc)
    ans = s[2][0] * s[2][1] * (L- s[2][0] - s[2][1])
    print(float(ans))

main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sympy as sym
L = int(input())
sym.init_printing()
(x, y) = sym.symbols("x, y")
targetFunc = x*y*(L-x-y)

def AnalyzeCurry(Z):
    dx = sym.diff(Z, x)             
    dy = sym.diff(Z, y)             
    s = sym.solve([dx, dy], [x, y]) 
    return dx, dy, s


def main():
    dx, dy, s = AnalyzeCurry(targetFunc)
    ans = s[2][0] * s[2][1] * (L- s[2][0] - s[2][1])
    print(float(ans))

main()

Submission status: Runtime Error

Solution code:
import sympy as sym
L = int(input())
sym.init_printing()
(x, y) = sym.symbols("x, y")


targetFunc = x*y*(L-x-y)

def AnalyzeCurry(Z):
    dx = sym.diff(Z, x)             # xで偏微分
    dy = sym.diff(Z, y)             # yで偏微分
    s = sym.solve([dx, dy], [x, y]) # dx=0, dy=0で連立方程式
    return dx, dy, s


def main():
    dx, dy, s = AnalyzeCurry(targetFunc)
    ans = s[2][0] * s[2][1] * (L- s[2][0] - s[2][1])
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
L = int(input())
import sympy as sym
sym.init_printing()
(x, y) = sym.symbols("x, y")


targetFunc = x*y*(L-x-y)

def AnalyzeCurry(Z):
    dx = sym.diff(Z, x)             # xで偏微分
    dy = sym.diff(Z, y)             # yで偏微分
    s = sym.solve([dx, dy], [x, y]) # dx=0, dy=0で連立方程式
    return dx, dy, s


def main():
    dx, dy, s = AnalyzeCurry(targetFunc)
    ans = s[2][0] * s[2][1] * (L- s[2][0] - s[2][1])
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import decimal
getcontext().prec = 20
S = decimal.Decimal(input()) 
s = S/3
print(decimal.Decimal(s**3))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
  a = []
  n = int(input())
  for x in range(1, n+1):
    for y in range(1, n+1):
      z = n - (x+y)
      if z <= 0:
        continue
      a.append(x*y*z)
  print(max(a))
          
  
def count_section_by_zero(data):
  count = 0
  flg = False
  start = 0
  for i, d in enumerate(data):
    if flg is False and d != 0:
      count += 1
      flg = True
      
    if d == 0:
      flg = False
  return count

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

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

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

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

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

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

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

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

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

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

Submission status: Runtime Error

Solution code:
import sys
import numpy as np

l3 = l / 3

print(l3**3)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys,math
sys.setrecursionlimit(10**9)
from collections import defaultdict
 
IA = lambda: map(int,input().split())
IAS= lambda: map(str,input().split())
sum=100
for i in range(1:100):
  sum=sum+1
n=int(input())
print("{:.12f}".format(pow(n,3)/27.0))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = float(input())

l = L / 3.0
ans = l*l*l
print(f"{ans:.12f}")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L = float(input())

l = L / 3.0
ans = l*l*l
print(f"{ans:.12f}")

Submission status: Runtime Error

Solution code:
import collections
import copy

N = int(input())
A = list(map(int, input().split()))
C = collections.Counter(A)

for a in A:
    pC = copy.deepcopy(C)

    ans = 0
    for k, v in pC.items():
        if k == a:
            ans += (v - 1) * (v - 2) // 2
        else:
            ans += v * (v - 1) // 2
    print(ans)

Submission status: Runtime Error

Solution code:

l=input()
print((l/3)^3)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = int(input())

result = []
for i in range(1,10**3):
    for j in range(i, 10**3):
        if l-i-j > 0:
            result.append(i*j*(l-i-j))
print(max(result))

Submission status: Runtime Error

Solution code:
L = map(int,input().split())
print((L/3)**3)