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 copy

item = [i *(i +1) * (i+2) //6 for i in range(1,181)]
q = []
while True:
    in_ = int(input())
    if in_ == 0:
        break
    q.append(in_)

INIT = 1000
MAX = max(q) +10
ans = [INIT] *MAX
ans[0] = 0
odd_item = [i for i in item if i % 2 ==0 ]
even_item = [i for i in item if not(i % 2 == 0)]

for i in even_item:
    for j in range(0,MAX-i):
        if ans[j+i] > ans[j] + 1:
            ans[j+i] = ans[j] + 1

ans_ = copy.deepcopy(ans)

for i in odd_item:
    for j in range(0,MAX-i):
        if ans[j+i] > ans[j] + 1:
            ans[j+i] = ans[j]+1
for i in q:
    print(ans[i],ans_[i])

Python: with open("input.txt") as f:
    while True:
        target = int(f.readline())
        if target == 0:
            break
        pascal = []
        tmp = 1
        nexpas = 1
        oddpas = []
        while target >= nexpas:
            pascal.append(nexpas)
            if nexpas % 2 == 1:
                oddpas.append(nexpas)
            tmp += 1
            nexpas = (tmp * (tmp + 1) * (tmp + 2)) // 6
        length = len(pascal)

        dp = [float("inf") for n in range(target + 1)]
        ans = - 1
        for i in range(length):
            dp[pascal[i]] = 1
            if pascal[i] == target:
                ans = 1
        cnt = 0
        while cnt < 10:
            #print(dp)
            cnt += 1
            tmpdp = dp[:]
            if ans != -1:
                break
            else:
                for outer in range(target + 1):
                    if dp[outer] != float("inf"):
                        nowcnt = dp[outer]

                        for i in range(length):
                            nextnum = outer + pascal[i]

                            if nextnum > target:
                                break
                            elif nextnum == target:
                                ans = nowcnt + 1
                                break
                            tmpdp[nextnum] = min(dp[nextnum],nowcnt + 1)
            #print(dp,tmpdb)
            dp = tmpdp

        oddlen = len(oddpas)
        odddp = [float("inf") for n in range(target + 1)]
        oddans = -1
        for i in range(oddlen):
            odddp[oddpas[i]] = 1
            if oddpas[i] == target:
                oddans = 1
        cnt = 0
        #print(oddpas)
        while cnt < 50:
            #print(odddp)
            cnt += 1
            tmpdp = odddp[:]
            if oddans != -1:
                break
            else:
                for outer in range(target + 1):
                    if odddp[outer] != float("inf"):
                        nowcnt = odddp[outer]
                        for i in range(oddlen):
                            nextnum = outer + oddpas[i]
                            #print(nextnum)
                            if nextnum > target:
                                break
                            elif nextnum == target:
                                oddans = nowcnt + 1
                                break
                            tmpdp[nextnum] = min(odddp[nextnum],nowcnt + 1)
            odddp = tmpdp
        print(str(ans) + " " + str(oddans))
        #print(odddp,oddpas,oddans,target)
        #print(dp,pascal,ans,target)

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 pollockConjection():
    inf=int(1e6)
    dp=list(range(0,inf+1))
    odp=list(range(0,inf+1))
    n=2
    s=1
    os=1
    while s<inf+1:
        s=n*(n+1)*(n+2)//6
        n+=1
        if s%2==1:
            os=s
        for i in range(0,inf+1-s):
            dp[i+s]=min(dp[i+s],dp[i]+1)
        for i in range(0,inf+1-os):
            odp[i+os]=min(odp[i+os],odp[i]+1)
    return dp,odp

if __name__=="__main__":
    dp,odp=pollockConjection()
    while True:
        N=int(input())
        if N==0:
            break
        print(dp[N],odp[N])

Python: import copy

item = [i *(i +1) * (i+2) //6 for i in range(1,181)]
q = []
while True:
    in_ = int(input())
    if in_ == 0:
        break
    q.append(in_)

INIT = 1000
MAX = max(q) +10
ans = [INIT] *MAX
ans[0] = 0
odd_item = [i for i in item if i % 2 ==0 ]
even_item = [i for i in item if not(i % 2 == 0)]

for i in even_item:
    for j in range(0,MAX-i):
        if ans[j+i] > ans[j] + 1:
            ans[j+i] = ans[j] + 1

ans_ = copy.deepcopy(ans)

for i in odd_item:
    for j in range(0,MAX-i):
        if ans[j+i] > ans[j] + 1:
            ans[j+i] = ans[j]+1
for i in q:
    print(ans[i],ans_[i])