Go: package main

import (
	"bufio"
	_ "container/heap"
	"fmt"
	"os"
	_ "sort"
	"strconv"
)

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func lcm(a, b int) int {
	return a / gcd(a, b) * b
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
const MOD = int(1e+9) + 7
const INF = 1 << 60

func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	defer wtr.Flush()
	var nums []int
	for i := 1; i < 2*100+1; i++ {
		nums = append(nums, i*(i+1)*(i+2)/6)
	}
	var ins []int
	N := 0
	for true {
		n := sc.nextInt()
		if n == 0 {
			break
		}
		ins = append(ins, n)
		N = max(N, n)
	}
	dp := make([]int, N+1)
	dp2 := make([]int, N+1)
	for i := 1; i < N+1; i++ {
		dp[i] = INF
		dp2[i] = INF
	}
	for i := 0; i < len(nums); i++ {
		n := nums[i]
		if n > N {
			break
		}
		for j := 0; j < N+1; j++ {
			if j >= n {
				dp[j] = min(dp[j], dp[j-n]+1)
				if n%2 != 0 {
					dp2[j] = min(dp2[j], dp2[j-n]+1)
				}
			}
		}
	}
	for i := 0; i < len(ins); i++ {
		fmt.Fprintln(wtr, dp[ins[i]], dp2[ins[i]])
	}
}

Python: import sys
input = lambda: sys.stdin.readline().rstrip() 

def resolve():
    tetrahedral_num = [i*(i+1)*(i+2)//6 for i in range(1, 201)]
    tetrahedral_num_odd = [i for i in tetrahedral_num if i%2==1]
    n = []
    while True:
        tmp = int(input())
        if tmp==0:
            break
        else:
            n.append(tmp)
    max_n = max(n)

    # dp[i]: 数iを構成する最小個数
    dp = [float('inf')]*(max_n+1)
    dp[0] = 0
    for i in range(1, max_n+1):
        tmp = []
        for j in tetrahedral_num:
            if i-j>=0:
                tmp.append(dp[i-j])
        dp[i] = min(tmp) + 1

    dp_odd = [float('inf')]*(max_n+1)
    dp_odd[0] = 0
    for i in range(1, max_n+1):
        tmp = []
        for j in tetrahedral_num_odd:
            if i-j>=0:
                tmp.append(dp_odd[i-j])
        dp_odd[i] = min(tmp) + 1

    for i in n:
        print(dp[i], dp_odd[i])

if __name__ == '__main__':
    resolve()

Python: # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: print('Yes' if b else 'No')
YESNO=lambda b: print('YES' if b else 'NO')

def main():
    Q=[]
    while True:
        N=int(input())
        if N==0:
            break
        Q.append(N)
    MAX_Q=max(Q)
    A=tuple((i+1)*(i+2)*(i+3)//6 for i in range(182))
    A_odd=tuple(i for i in A if i%2)
    A_even=tuple(i for i in A if i%2==0)
    dp=[INF]*(MAX_Q+1)
    dp[0]=0
    for x in A_odd:
        for k in range(x,MAX_Q+1):
            if dp[k]>dp[k-x]+1:
                dp[k]=dp[k-x]+1
    ans=[]
    for q in Q:
        ans.append(dp[q])
        
    for x in A_even:
        for k in range(x,MAX_Q+1):
            dp[k]=min(dp[k],dp[k-x]+1)
    for i,q in enumerate(Q):
        print(dp[q],ans[i])


if __name__ == '__main__':
    main()

Python: N = 10**6

N1 = [i for i in range(N+40)]
N2 = [i for i in range(N+40)]

N1[0] = 0
N2[0] = 0

p = [n*(n+1)*(n+2)//6 for n in range(1,200) if n *(n+1)*(n+2)//6< N+1]
p2 = [n*(n+1)*(n+2)//6 for n in range(1,200) if n *(n+1)*(n+2)//6< N+1 and n *(n+1)*(n+2)//6 % 2 ==1 ]
#print(p2)
for p_ in p:
    if p_ > len(N1) :
        continue
    for j in range(p_,len(N1)):
#        print(j)
        N1[j] = min(N1[j],N1[j-p_]+1)

for p_ in p2:
    if p_ > len(N2) :
        continue
    for j in range(p_,len(N2)):
        N2[j] = min(N2[j],N2[j-p_]+1)
#print('a')
while True:
    n = int(input())
    if n == 0:
        break
    print(N1[n],N2[n])

Python: MAX = 1000010
tetra = []
dp = [0] * (MAX+1)
dpodd = [0] * (MAX+1)

for i in range(1,MAX+1):
    dp[i] = i
    dpodd[i] = i


i = 0
while True:
    i += 1
    t = i * (i+1) * (i+2) // 6
    if t > MAX: break
    tetra.append(t)

for p in tetra:
    #print(p)
    for i in range(0,MAX-p):
        dp[i+p] = min(dp[i+p], dp[i]+1)
        if p % 2 == 1:
            dpodd[i+p] = min(dpodd[i+p], dpodd[i]+1)

while True:
    n = int(raw_input())
    if n == 0: break
    print (dp[n],dpodd[n])

Python: from collections import defaultdict
from bisect import bisect_left, bisect

def solve():
    i = 1
    P = []
    x = 1
    M = 10**6
    while x < M:
        P.append(x)
        i += 1
        x = (i)*(i+1)*(i+2)//6
    
    P = P[1:]
    Q = [p for p in P if p%2]
    DP1 = list(range(M+1))
    DP2 = list(range(M+1))
    
    for i in range(M):
        for p in P[:bisect(P, M-i)]:
            DP1[i+p] = min(DP1[i+p], DP1[i]+1)
        for q in Q[:bisect(Q, M-i)]:
            DP2[i+q] = min(DP2[i+q], DP2[i]+1)
    
    N = int(input())
    
    while N:
        print("{} {}".format(DP1[N], DP2[N]))
        N = int(input())
    
if __name__ == "__main__":
    solve()

Python: def solve():
    rec = list(range(1000000))
    odd_rec = rec.copy()
    
    for i in range(2, 181):
        t = i * (i + 1) * (i + 2) // 6
        if t % 2 == 0:
            for i, tpl in enumerate(zip(rec[t:], rec), start=t):
                a, b = tpl
                b += 1
                if b < a:
                    rec[i] = b
        else:
            z_rec = zip(rec[t:], rec, odd_rec[t:], odd_rec)
            for i, tpl in enumerate(z_rec, start=t):
                a, b, c, d = tpl
                b += 1
                if b < a:
                    rec[i] = b
                d += 1
                if d < c:
                    odd_rec[i] = d
    
    import sys
    file_input = sys.stdin
    n = int(file_input.readline())
    while n:
        print(rec[n], odd_rec[n])
        n = int(file_input.readline())

solve()

Python: dp = [0] + [10 ** 10] * 10**6
odd = [0] + [10 ** 10] * 10**6
for i in range(1, 10**6 + 1):
    a = i * (i + 1) * (i + 2) // 6
    if a > 10**6: break
    for j in range(a, 10**6 + 1):
        dp[j] = min(dp[j], dp[j - a] + 1)
        if a & 1: odd[j] = min(odd[j], odd[j - a] + 1)
while 1:
    n=int(input())
    if n==0:break
    print(dp[n],odd[n])