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:
import math

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

Submission status: Accepted

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

    print(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def maxvolume( s ): 
  
    # finding length 
    length = (s / 3) 
      
    s -= length 
      
    # finding breadth 
    breadth = s / 2
      
    # finding height 
    height = s - breadth 
      
    return (length * breadth * height) 
l=int(input())
print(maxvolume(l))

Submission status: Accepted

Solution code:
l=int(input())

l1=l/3
v=l1*l1*l1
print(v)

Submission status: Accepted

Solution code:
import math as m
n=int(input())
n=n/3
print("{0:.12f}".format(m.pow(n,3)))

Submission status: Accepted

Solution code:
L = int(input().split()[0])
ans = (L / 3) ** 3

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(pow(n/3, 3))

Submission status: Accepted

Solution code:
from decimal import Decimal

L=int(input())
l=Decimal(L/3)
print("{:.12f}".format((l)**3))

Submission status: Accepted

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

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())
a = L/3
print(a*a*a)

Submission status: Accepted

Solution code:
try:
    while True:
        L = int(input())
        if L == '':
            break
        a = (L/3)**3
        input(a)
except EOFError:
    pass

Submission status: Accepted

Solution code:
L = int(input())

print(L/3 * L/3 * L/3)

Submission status: Accepted

Solution code:
def maxvolume( s ): 
  
    # finding length 
    length = s / 3 
      
    s -= length 
      
    # finding breadth 
    breadth = s / 2
      
    # finding height 
    height = s - breadth 
      
    return (length * breadth * height) 
      
# Driven Program 
s = int(input())
print( maxvolume(s) )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputNum = float(input())

inputNum = inputNum / 3

ans = 0.00

ans = inputNum * inputNum * inputNum

print(ans)

Submission status: Accepted

Solution code:
import math


L = int(input())

value = L/3

volume = pow(value,3)

print(volume)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

print((l/3) ** 3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from decimal import *


def solve(L: int):
    l = Decimal(L)
    print((l/3)**3)
    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: Accepted

Solution code:
L = int(input())

x = float(L / 3)

A = x ** 3

print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

V = L ** 3 / 27

print(V)

Submission status: Accepted

Solution code:
l=int(input())
ans_max = (l/3)**3
for a in range(l):
    min = l-a
    max = l
    mid = min + (max - min) // 2
    for i in range(100):
        if ans_max < a * mid * (l - a - mid):
            ans_max = a * mid * (l - a - mid)
        max = mid
print(ans_max)

Submission status: Accepted

Solution code:
# ABC159 C

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

    if l % 3:
        a = l / 3
        print(a * a * (l - 2*a))
    else:
        print((l / 3)**3)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
raw_input = input()
N = int (raw_input)

if N % 3 == 0:
    ans = (N/3) ** 3
    print(ans)
else:
    ans = (N ** 3) / 27
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = float(input())

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

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    #%%
    L = r_float()
    p = L/3
    print(p*p*p)
    
    
    #%%
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

n = N / 3

print(float(n ** 3))

Submission status: Accepted

Solution code:
"""
"""


def int_as_array(num): return list(map(int, [y for y in str(num)]))


def array_as_int(arr): return int(''.join(map(str, arr)))


def read_int(): return int(input())


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


def array_to_string(arr, sep=' '): return sep.join(map(str, arr))


def matrix_to_string(arr, sep=' '): return '[\n' + '\n'.join(
    [sep.join(map(str, row)) for row in arr]) + '\n]'


def solve(L):
    return (L / 3) ** 3


L = read_int()
print(solve(L))

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    n = int(input())
    print('%.12f' % (n / 3) ** 3)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L=int(input())

print(pow(L/3,3.0))

Submission status: Accepted

Solution code:
n = int(input())

kenar = n/3
cevap = (n/3)**3
print(cevap)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
print ('%.6f' % ((l * l * l) / 27))

Submission status: Accepted

Solution code:

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

    l = L / 3

    print(l**3)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal, getcontext
getcontext().prec = 50
S = int(input())
print(Decimal(pow(Decimal(Decimal(S)/Decimal(3)), Decimal(3))))

Submission status: Accepted

Solution code:
n = int(input())

tmp = n/3

ans = tmp**3

print(ans)

Submission status: Accepted

Solution code:
L = int(input())

print((1/27)*L**3)

Submission status: Accepted

Solution code:
from decimal import *

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

Submission status: Accepted

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


if __name__ == '__main__' :
    main()

Submission status: Accepted

Solution code:
l = float(input())

a = (l/3)**3

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

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

Submission status: Accepted

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]
    
    l = int(lines[0])

    return (l, )


def solve(l, ):

    result = (l / 3) ** 3

    return  result


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

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

    print((L / 3) ** 3)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
L = int(input())
# X1_list = [int(input()) for i in range(N)]
# X2_list = [list(map(int,input().split())) for i in range(N)]
e = L / 3
print(e * e * e)

Submission status: Accepted

Solution code:
L = int(input())

h = L *(1/3)

print(h**3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

W = L / 3
H = L / 3
D = L / 3

print(W * H * D)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

h = L / 3
w = L - h * 2

print(h ** 2 * w)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

print(L / 3 * L / 3 * L / 3)

Submission status: Accepted

Solution code:
l = int(input())

e = l / 3

res = e * e * e

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = int(input())

print(pow(L/3,3))

Submission status: Accepted

Solution code:
l = int(input())

print((l/3) ** 3.0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
from decimal import Decimal

l = input()
print (Decimal(l) / 3) ** 3

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = float(input())
r = L/3

V = r*r*r
print(V)

Submission status: Accepted

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

Submission status: Accepted

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



if __name__ == "__main__":
    C159()

Submission status: Accepted

Solution code:

l = int(input())

print((l/3) ** 3)

Submission status: Accepted

Solution code:
# ABC159_C
# def drange(begin, end, step):
#     n = begin
#     while n+step < end:
#      yield n
#      n += step
l=int(input())
ans=(l/3)**3
print(ans)
# ans=03

# for x in range(1,1001):
#     for y in range(1,1001):
#         z=l-x-y
#         if z>0:
#             v=x*y*z
#             ans=max(v,ans)
# print(ans)

# for x in drange(1.0,1001.0,0.1):
#     for y in drange(1.0,1001.0,0.1):
#         z=l-x-y
#         if z>0:
#             v=x*y*z
#             ans=max(v,ans)
# print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

L = int(read())
print(L**3 / 27)

Submission status: Accepted

Solution code:
l=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def solve():
    L = int(input())
    ans = L**3/27
    print(ans)


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

Submission status: Accepted

Solution code:
l = int(input())

v = float(l * l * l/27)
print(v)

Submission status: Accepted

Solution code:
l=int(input())
l1=l/3
import math
print(math.pow(l1,3))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# bin/env/pypy3
import sys
import collections
import heapq
import math
l = int(sys.stdin.readline())
d = l / 3.0
print(d*d*d)

Submission status: Accepted

Solution code:
n = int(input())

print((n*0.3333333333333333)**3)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

s = l / 3

v = s**3

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal
L = int(input())
a = decimal.Decimal(L/3)

print(a*a*a)

Submission status: Accepted

Solution code:
l=int(input())

print(pow(l/3,3))

Submission status: Accepted

Solution code:
from decimal import Decimal
#x = Decimal(5).sqrt()
#print(x)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())

t = l/3

print(t**3)

Submission status: Accepted

Solution code:
#!python3.4.3

L = float(input())

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

Submission status: Accepted

Solution code:
# n = int(input())
# a = list(map(int, input().split()))

# cnt = [0]*(n+1)

# for i in range(n):
#     cnt[a[i]] += 1

# for k in range(n):
#     cnt[a[k]] -= 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def II():
    return int(input())

L=II()

import numpy as np

print((L/3)**3)

Submission status: Accepted

Solution code:
l = int(input(''))
l3 = l/3

print(l3*l3*l3)

Submission status: Accepted

Solution code:
num = int(input())
hen = num/3

ans = hen**3
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
l = i()
print((l/3)**3)

Submission status: Accepted

Solution code:
L = int(input())

ans = (L / 3) ** 3

print(ans)

Submission status: Accepted

Solution code:
l=int(input())

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

Submission status: Accepted

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