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=[1]
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
               # if count >= max(kisu_len):
                if count >= len(memo_kisu[2])-1:
                  #  print(count,len(memo_kisu[2]))
                    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])
#print(kisu_len,memo_kisu)

Python: def solve():
    rec = [1000000] * 1000000
    rec[0] = 0
    odd_rec = rec.copy()

    for i in range(1, 181):
        t = i * (i + 1) * (i + 2) // 6
        for i, tpl in enumerate(zip(rec[t:t*3+1], rec), start=t):
            a, b = tpl
            b += 1
            if b < a:
                rec[i] = b
        if t % 2:
            for i, tpl in enumerate(zip(odd_rec[t:t*34+1], odd_rec), start=t):
                a, b = tpl
                b += 1
                if b < a:
                    odd_rec[i] = b

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

Python: # https://onlinejudge.u-aizu.ac.jp/problems/1167


def porok(n):
    return n * (n+1) * (n+2) // 6


def dp_1(n):
    for j in poroks_odd:
        for i in range(j, n+1):
            tmp = dp[i-j] + 1
            if dp[i-j] + 1 < dp[i]:
                dp[i] = dp[i-j] + 1


def dp_2(n):
    for j in poroks_even:
        for i in range(j, n+1):
            tmp = dp[i-j] + 1
            if dp[i-j] + 1 < dp[i]:
                dp[i] = dp[i-j] + 1


if __name__ == "__main__":
    query_list = []
    ans_even = []
    while(True):
        n = int(input())
        if n == 0:
            break
        query_list.append(n)

    poroks = [i * (i + 1) * (i + 2) // 6 for i in range(1, 181)]
    poroks_odd = [
        porok_number for porok_number in poroks if porok_number % 2 == 1]
    poroks_even = [
        porok_number for porok_number in poroks if porok_number % 2 == 0]
    dp = [100] * (max(query_list)+1)
    dp[0] = 0

    dp_1(max(query_list))

    for q in query_list:
        ans_even.append(dp[q])

    dp_2(max(query_list))

    for i, q in enumerate(query_list):
        print('{} {}'.format(dp[q], ans_even[i]))

Python: N = 1000000

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
"""
    if p_%2==0:
        continue
    for j in range(p_,N):
        if N2[j] >N2[j-p_]+1:
            N2[j]=N2[j-p_]+1
"""
#print("a")
for p_ in p2:
#    if p_ > N +1 :
 #       continue
    #n = min(p_*7,N+1)
    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])