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: # coding: utf-8
# Here your code !

n = []
n.append(int(input()))
while min(n):
    n.append(int(input()))
#triangle = [0]
pyramid = [0]
pyramid_kisu = []
m = 0
memo = []
memo_kisu = []

while pyramid[m] < max(n):
    m += 1
#    triangle.append(m+triangle[m-1])
#    pyramid.append(triangle[m]+pyramid[m-1])
    pyramid.append(int((m*(m+1)*(m+2))/6))

for i in pyramid:
    if i % 2 == 1:
        pyramid_kisu.append(i)

for i in range(len(pyramid_kisu)):
    memo_kisu.append([0,[pyramid_kisu[i]]])

for i in range(m+1):
    memo.append([[0],[],[],[],[],[]])
    memo[i][1].append(pyramid[i])

for j in range(2,6):
    for i in range(1,m):
            for k in range(1,i+1):
                for l in memo[k][j-1]:
                    memo[i][j].append(pyramid[i]+l)

kisu_len=[0]
for question in n:
    flag = 0
    if question == 0:
        break
    else:
        for j in range(1,6):
            for i in reversed(range(1,len(memo))):
                if question in memo[i][j]:
                    ans=j
                    flag = 1
                    break
            if flag == 1:
                break
        
        flag = 0
        count = 1
        while 1:
            for i in range(len(memo_kisu)):
                if question in memo_kisu[i][count]:
                    ans_kisu = count
                    kisu_len.append(ans_kisu)
                    flag = 1
                elif count >= max(kisu_len):
                    memo_kisu[i].append([])
                    for k in range(i+1):
                        for l in memo_kisu[k][count]:
                            memo_kisu[i][count+1].append(pyramid_kisu[i]+l)
            if flag == 1:
                break
            count += 1    
    print(ans,ans_kisu)
#print(kisu_len,memo_kisu[2][max(kisu_len)-1])

Python: INF = 1000000

while True:
    n = input()
    n = int(n)

    if n == 0:
        break

    i = 1
    tetra = []
    while True:
        t = i*(1+i)*(2+i)/6
        if t <= n:
            tetra.append(int(t))
            i += 1
        else:
            break

    dp1 = [INF for _ in range(n+1)]
    dp2 = [INF for _ in range(n+1)]
    dp1[0] = 0
    dp2[0] = 0

    for i in range(n):
        for j in range(len(tetra)):
            if i + tetra[j] <= n:
                dp1[i+tetra[j]] = min(dp1[i+tetra[j]], dp1[i]+1)
                if tetra[j] % 2 == 1:
                    dp2[i+tetra[j]] = min(dp2[i+tetra[j]], dp2[i]+1)
    
    print("%d %d" % (dp1[n], dp2[n]))

Python: # AOJ 1167 - ポロック予想
# 配るDP でいってみよ～

import sys


def main():
    tetra_nums = [i * (i + 1) * (i + 2) // 6 for i in range(1, 181)]
    N = 10 ** 6

    dp = [i for i in range(N)]
    dp_odd = [i for i in range(N)]

    for n in range(N):
        for tetra_num in tetra_nums:
            next_n = n + tetra_num

            if next_n < N:
                next_dp = dp[n] + 1
                if next_dp < dp[next_n]:
                    dp[next_n] = next_dp

                if tetra_num & 1:
                    next_dp = dp_odd[n] + 1
                    if next_dp < dp_odd[next_n]:
                        dp_odd[next_n] = next_dp

    while True:
        num = int(sys.stdin.readline())
        if num == 0:
            break
        print(dp[num], dp_odd[num])


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_ > N +1:
        continue
    n = min(p_*5,N)
    for j in range(p_,n):
#        print(j)
        if N1[j] > N1[j-p_] +1:
            N1[j] = N1[j-p_]+1
for p_ in p2:
    if p_ > N +1 :
        continue
    n = min(p_*5,N)
    for j in range(p_,n):
        if N2[j] > N2[j-p_]+1:
            N2[j] = N2[j -p_]+1
#print('a')
while True:
    n = int(input())
    if n == 0:
        break
    print(N1[n],N2[n])

Python: import bisect
import sys
MAX = 10**6
sys.setrecursionlimit(MAX)
arr1 = [1]
arr2 = [1]
n = 1
while True:
    n += 1
    tmp = n*(n+1)*(n+2)//6
    if tmp > MAX: break
    arr1.append(tmp)
    if tmp%2:
        arr2.append(tmp)

def rec(remain, depth, mindepth, onlyodd):
    if remain == 0: return depth
    if mindepth - depth <= 1: return mindepth
    arr = arr2 if onlyodd else arr1
    i = bisect.bisect_right(arr,remain)
    if i == 1:
        return min(mindepth, depth + remain)
    for j in range(1,i):
        mindepth = rec(remain-arr[j], depth+1, mindepth, onlyodd)
    return mindepth

def solve(n, onlyodd=False):
    return rec(n,0,n,onlyodd)

while True:
    N = int(input())
    if N == 0: break
    print('{0} {1}'.format(solve(N), solve(N,True)))

Python: def main():
    All = [i*(i+1)*(i+2)//6 for i in range(1, 182)]
    inf = 10**18
    n = 10**6
    dp = [inf]*(n+1)
    dpo = [inf]*(n+1)
    dp[0] = 0
    dpo[0] = 0
    for j in All:
        lim = min(j*5, n)
        for i in range(j, lim+1):
            dp[i] = min(dp[i-j]+1, dp[i])
        for i in range(j, n):
            if j%2==1:
                dpo[i] = min(dpo[i-j]+1, dpo[i])
    
    while 1:
        q = int(input())
        if q==0:
            break
        print(dp[q], dpo[q])

main()