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: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    num = ii()
    print((num / 3) ** 3)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	L = int(input())
	ans = (L / 3) ** 3
	print(ans)


if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    L = int(input())
    l = L
    ans = 0
    a = L / 3
    print(L ** 3 /27)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

l = int(input())


if (l<1 or l > 1000):
  quit()

length = (l/3)
l = l - length
#print ("length", length)

breadth = (l/2)
#print ("breadth", breadth)
l = l - breadth

height = l
#print("height", height)

maxVolume = length*breadth*height

result = float(l*l*l)
print (maxVolume)

Submission status: Accepted

Solution code:
L = int(input())

M = L/3
print(M**3)

Submission status: Accepted

Solution code:
##======================================python3
import sys
import collections
sys.setrecursionlimit(10**6)
input = sys.stdin.readline

class Run:
    def build(gv):
        gv.L = int(input())

    def solve(gv):
        side = gv.L / 3
        ans = side**3
        ans = round(ans, 12)
        print(ans)
        
if __name__ == '__main__':
    run = Run()
    run.build()
    run.solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

res = (L / 3) ** 3

print(res)

Submission status: Accepted

Solution code:
n=int(input())

print(n**3/27)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

print( (L ** 3) / 27)

Submission status: Accepted

Solution code:
L = int(input())


def main():
    print(pow(L/3,3))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = (l / 3) ** 3;

print(ans);

Submission status: Accepted

Solution code:
from sys import stdin
L = list(map(int, (stdin.readline().strip().split())))[0]
max=float(L/3)**3
print(max)

Submission status: Accepted

Solution code:
v = int(input())
'''
ans = 0
for a in range(v+1):
    for b in range(v-a+1):
            if a*b*(v-a-b) > ans:
                ans = a*b*(v-a-b)
print(ans)
'''
print((v/3)**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
L = 1000 * l
max = 0
V = 0
for a in range(L):
    V = a*((L - a)/2)*(L - a - ((L - a)/2))
    if max <= V:
        max = V
print(max/1000000000)

Submission status: Accepted

Solution code:
L =int(input())

print((L/3)**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

l1 = L / 3.0
print(l1**3)

Submission status: Accepted

Solution code:
L = int(input())

V = (L/3)**3
print(V)

Submission status: Accepted

Solution code:
L = int(input())

l1 = L / 3.0
print(l1**3)

Submission status: Accepted

Solution code:
def solve(l):
  return (l/3)**3

l = int(input())
# n, m = [int(s) for s in input().split(" ")]
print(solve(l))

Submission status: Accepted

Solution code:
def Main(L):
    return (L/3)**3

def main():
    L = int(input())
    print('{:.12f}'.format(Main(L)))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
L = int(input().strip('\n'))
print((L/3)**3)

Submission status: Accepted

Solution code:
#!/usr/bin python3
# -*- coding: utf-8 -*-

import sys
input = sys.stdin.readline

def main():
    L = int(input())/3
    print(pow(L,3))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L = int(input())

length = L / 3

print('{:.12f}'.format(length**3))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

L = INT()
print((L/3)**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

print('{:.10f}'.format((l/3)**3))

Submission status: Accepted

Solution code:
a = int(input())

b = (a/3)**3

print(b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

ans = 0
i = L / 3
ans = i ** 3

print('{:.7f}'.format(ans))

Submission status: Accepted

Solution code:
l = input()
m = int(l)
N = m/3
v = pow(N,3)
print(v)

Submission status: Accepted

Solution code:
s = int(input())
side = s/3
ans = pow(side,3)
print(ans)

Submission status: Accepted

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


def main():
    L = int(input())
    print((L/3)**3)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L = int(input())

l = L/3

print(l*l*l)

Submission status: Accepted

Solution code:
n = int(input())

x = float(n/3)
ans = float(x**3)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#sys.setrecursionlimit(10**9)

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
#import numpy as np

from collections import deque

def main():
	l=int(input())
	print((l/3)**3)




if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
N = float(input())
ans = N*N*N/27.0
print('{:.7f}'.format(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    L = int(input())
    print("{:.12f}".format((L / 3) ** 3))

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

a = L / 3

print(a ** 3)

Submission status: Accepted

Solution code:
L = int(input())

ans = (L/3)**3
print(ans)

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    l = int(input())
    l1 = l / 3
    print(l1 ** 3)

Submission status: Accepted

Solution code:
l = int(input())

a = l/3
b = (l - a) /2
c = l - a - b

print(a*b*c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

# volume = (L / 3) * (L / 3) * (L / 3)
volume = L ** 3 / 27

print(volume)

Submission status: Accepted

Solution code:
L = int(input())

volume = (L / 3) * (L / 3) * (L / 3)

print(volume)

Submission status: Accepted

Solution code:
L = input("")
L = float(L)
S = (L/3)* (L/3)*(L/3)

print(S)

Submission status: Accepted

Solution code:
"""
int(input())
map(int,input().split())
list(map(int,input().split()))

"""

n=int(input())
print((n/3)**3)

Submission status: Accepted

Solution code:
# coding: utf-8
l = int(input())
print((l/3)**3)

Submission status: Accepted

Solution code:
def main():
    args = input().rstrip().split(' ')
    L = float(args[0])
    l = L/3.
    print(l*l*l)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
L = INT()
print((L/3)**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = input()
l = int(l) # 1 <= L <= 1000
h = l / 3
x = l / 3
y = l / 3
print(h * x * y)

Submission status: Accepted

Solution code:
l = int(input())
print('{:.06f}'.format((l/3)*(l/3)*(l/3)))

Submission status: Accepted

Solution code:
f = int(input()) / 3.0
print("{:.9f}".format(f * f * f))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def maximum(l):
    print(pow(l/3.0, 3))

l = int(input())

maximum(l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(l):
    return (l / 3) ** 3

def main():
    l = int(input())
    print(solve(l))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = float(input())

x = L/3

print(x*x*x)

Submission status: Accepted

Solution code:
l = float(input())

a = l / 3

v = a ** 3
print(format(v, '.12f'))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


############ ---- Input Functions ---- ############
def in_int():
    return (int(input()))


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


def in_str():
    s = input()
    return (list(s[:len(s) - 1]))


def in_ints():
    return (map(int, input().split()))






n = in_int()

n = n/3


print(n*n*n)

Submission status: Accepted

Solution code:
n = int(input())
x = n/3
y = pow(x,3)
print("{0:.12f}".format(y))

Submission status: Accepted

Solution code:
def short(S):
    a = S/3
    return (a **3)


S =int(input())
print(short(S))

Submission status: Accepted

Solution code:
def shortie (L):
 R= L/3
 return (R**3)

L=int(input())
print(shortie (L))

Submission status: Accepted

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

x =((1000*a)/3)
print((x**3)/1000000000)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def shortie(L):
    r = L/3
    return (r **3)


L =int(input())
print(shortie(L))

Submission status: Accepted

Solution code:
#maximum volume problem
J = int(input()) #to take input from the user, input function is used
K = J /3   
M= K
print(M ** 3) #to print the solution of the problem

Submission status: Accepted

Solution code:
J=int(input())
E=J/3
print(E**3)
#print the answer

Submission status: Accepted

Solution code:
#hello
#password
#input
#understandign python
#less errors
#work now please
q = int(input())
w = q / 3
print(w ** 3)

Submission status: Accepted

Solution code:
#HIManshu
H = int(input())
E = H / 3
print(E ** 3)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

a = int(input())

l = a/3

print(l**3)

Submission status: Accepted

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

Submission status: Accepted

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

    i = L/3

    print(i*i*i)

main()

Submission status: Accepted

Solution code:
def maxVolume(dim):
	return dim * dim * dim / 27

dim = int(input())
print(maxVolume(dim))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# C

L = int(input())

print((L/3)**3)

Submission status: Accepted

Solution code:
def main():
    L = int(input())
    edge = L/3

    return edge ** 3


if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#整数の入力
N = int(input())

a = N/3

print(a*a*a)

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    l = int(readline())
    print((l / 3) * (l / 3) * (l - l / 3 * 2))


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
from decimal import Decimal

L = Decimal(input())

result = (L / 3) ** 3
print(result)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print((int(input()) / 3) ** 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


l = int(input())

print(math.pow(l/3,3))

Submission status: Accepted

Solution code:
import sys
import math

from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 
def prime_list(n):
    li = [i for i in range(2, n+1)]
    for i in range(len(li)):
        if li[i] >= int(math.sqrt(n)):
            break
        if li[i] == -1:
            continue
        for j in range(i+1, len(li)):
            if li[j] % li[i] == 0:
                li[j] = -1
    return [n for n in li if n != -1]
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while True:
        r = a % b
        if r == 0: return b
        a, b = b, r
def lcm(a, b):
    return int(a * b / gcd(a,b))
def all_subset(li):
    s = []
    n = len(li)
    for bit in range(0, (1<<(n+1))):
        ss = set()
        for i in range(0, n):
            if (bit & (1 << i)):
                ss.add(li[i])
        s.append(ss)
    return s
def factorial(n):
    if n == 1:
        return 1
    return n * factorial(n-1)
def mCn(m, n):
    def factorial_ntimes(m, n):
        r = 1
        while n:
            r *= m
            m -= 1
            n -= 1
        return r
    return int(factorial_ntimes(m, n) / factorial(n))

l = load()
print((l/3) ** 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

v = pow(l/3, 3)

print(v)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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)

print((L/3)**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
# 体積が最大になる条件は正6面体
print((l/3)**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

a_3 = a/3

print(a_3*a_3*a_3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L=int(input())

s=L/3

print(s**3)

Submission status: Accepted

Solution code:
n=int(input())

print((n/3)**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

a=N/3

print(a**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

print(L*L*L/27)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

n /= 3

print(n**3)

Submission status: Accepted

Solution code:
#!/usr/bin/python3


l = int(input())

print((l ** 3) / 27)

Submission status: Accepted

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

Submission status: Accepted

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

'''

'''

import sys

L = float(input())

x = L / 3
# print(type(x))
print(x**3)

Submission status: Accepted

Solution code:
L = int(input())

import random

print(L**3/27)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()

    return pow(n/3, 3)


print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr  4 19:32:33 2020

@author: Kanaru Sato
"""

l = int(input())

ans= (l**3)/27

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

ap = L /3

print(ap**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
a = round(l / 3, 6)
print(a * a * a)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
from decimal import *

L = int(input())

d = Decimal(L)

print((d/3) ** 3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

# 普通に立方体が一番大きい
print(pow(L/3,3))

Submission status: Accepted

Solution code:
line = int(input())
calc = line * line * line / 27

print(str(calc))

Submission status: Accepted

Solution code:
L = int(input())

V = pow(L, 3) / 27

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('{:.012f}'.format(a ** 3))

Submission status: Accepted

Solution code:
l = int(input())
x = l / 3
y = l / 3
z = l / 3
ans = x * y * z
print('{:.10f}'.format(ans))

Submission status: Accepted

Solution code:
value = input()

one = int(value) / 3

print(one **3)

Submission status: Accepted

Solution code:
L = int(input())

l = L / 3
print(l ** 3)

Submission status: Accepted

Solution code:
import math
l = int(input())
x = l/3
print(str(x**3))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
L = int(input())
print("{:.12g}".format(math.pow(L/3, 3)))

Submission status: Accepted

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

    print(pow(L/3, 3))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

l = ni()

print("{:.12f}".format((l / 3) * (l / 3) * (l / 3)))

Submission status: Accepted

Solution code:
L = float(input().strip())
a = L/3
print(pow(a,3))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = float(input())

ans = float((L/3)**3)

print(ans)

Submission status: Accepted

Solution code:
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN

L =int(input())

ans = Decimal((L/3)**3)

print(float(round(ans, 10)))

Submission status: Accepted

Solution code:
L = float(input())

V_max = (L/3)**3
print(V_max)

Submission status: Accepted

Solution code:
#ABC159C
import sys
L = int(sys.stdin.readline())

print((L/3)**3)

Submission status: Accepted

Solution code:
X = int(input())

print(X**3/27)

Submission status: Accepted

Solution code:
L =int(input())

print ((L/3)**3)

Submission status: Accepted

Solution code:
n = int(input())

print((n/3)**3)

Submission status: Accepted

Solution code:
L = int(input())

print(round(L/3, 6) ** 3)

Submission status: Accepted

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

a = l / 3;

print(a * a * a);

Submission status: Accepted

Solution code:
L = int(input())

print((L/3.0) ** 3)

Submission status: Accepted

Solution code:
#ABC.C159
L = int(input())
x = L/3
print('{:.7f}'.format(x**3))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
x = round(l / 3, 6)
y = round(l / 3, 6)
z = round(l / 3, 6)
print(x * y * z)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=int(input())

ans=(l/3)**3
print(ans)

Submission status: Accepted

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

print(l*l*l)