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: 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
     
    n = int(input())
    while n:
        print(rec[n], odd_rec[n])
        n = int(input())
 
solve()

Python: import sys
import copy


def solve():
    n = 10**6
    INF = 10**3
    dp = [INF] * (n + 1)
    dp[0] = 0
    dp_odd = copy.deepcopy(dp)

    for i in range(n):
        for x in arr:
            if i + x > n:
                break
            if dp[i + x] > dp[i] + 1:
                dp[i + x] = dp[i] + 1
            if x % 2:
                if dp_odd[i + x] > dp_odd[i] + 1:
                    dp_odd[i + x] = dp_odd[i] + 1

    return dp, dp_odd


arr = [1]

for i in range(1, 180):
    arr.append(arr[-1] * (i + 3) // i)

a, b = solve()


while True:
    n = int(input())
    if n == 0:
        sys.exit()
    print(a[n], b[n])

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

def solve():
    ans = []
    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:
        ans.append("{} {}".format(DP1[N], DP2[N]))
        N = int(input())
    print("\n".join(ans))

if __name__ == "__main__":
    solve()

Python: def solve():
    import sys
    file_input = sys.stdin
    
    def tetra_num(n):
        for i in range(1, 181):
            t = i * (i + 1) * (i + 2) // 6
            if t <= n:
                yield t
            else:
                break
    
    while True:
        n = int(file_input.readline())
        if n == 0:
            break
        
        n_lim = 1000000
        rec = [n_lim] * (n + 1)
        rec[0] = 0
        odd_rec = [n_lim] * (n + 1)
        odd_rec[0] = 0
        
        for t in tetra_num(n):
            if t % 2 == 0:
                for i, tpl in enumerate(zip(rec[t:], rec), start=t):
                    a, b = tpl
                    rec[i] = min(a, b + 1)
            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
                    rec[i] = min(a, b + 1)
                    odd_rec[i] = min(c, d + 1)
                    
        print(rec[n], odd_rec[n])

solve()

Python: def main():
  INIT = 100
  
  query = []
  ans = []
  while True:
    q = int(input())
    if q == 0:
      break
    query.append(q)
  MAX = max(query)
  
  table = [INIT] * (MAX + 1)
  table[0] = 0
  all_item = [i * (i + 1) * (i + 2) // 6 for i in range(1, 181)]
  odd_item = [i for i in all_item if i % 2]
  eve_item = [i for i in all_item if not i % 2]
  
  for v in odd_item:
    for j in range(v, MAX + 1):
      tjv = table[j - v]
      if table[j] > tjv + 1:
        table[j] = tjv + 1
  
  for q in query:
    ans.append(table[q])
  
  for v in eve_item:
    for j in range(v, MAX + 1):
      tjv = table[j - v]
      if table[j] > tjv + 1:
        table[j] = tjv + 1
  
  for i, q in enumerate(query):
    print(table[q], ans[i])

main()

Python: def main():
    import sys
    input=sys.stdin.readline   
    M=10**6

    dp=[0]+[M]*M
    dpo=[0]+[M]*M

    for i in range(1,200):
        t=i*(i+1)*(i+2)//6

        for j in range(t,min(5*t,M)):
            if j<t:
                dp[j]=dp[j]
            else:
                dp[j]=min(dp[j],dp[j-t]+1)
        
        if t%2==1:
            for j in range(t,M):
                if j<t:
                    dpo[j]=dpo[j]
                else:
                    dpo[j]=min(dpo[j],dpo[j-t]+1)
    
    while True:
        n=int(input())
        if n==0:
            break
        else:
            print(dp[n],dpo[n])

if __name__=='__main__':
    main()