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]])
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
template<class T>bool chmin(T &a, const T &b)
{ return (a>b ? (a=b)||1 : 0); }

int main(){
	
	vector<int> d,e;
	for(int i=1; i<=200; i++){
		int m = i*(i+1)*(i+2)/6;
		d.push_back(m);
		if(m%2) e.push_back(m);
	}
	vector<int> dp1(1000001,1e8);
	vector<int> dp2(1000001,1e8);
	dp1.at(0) = 0;
	dp2.at(0) = 0;
	for(int i=0; i<=1000000; i++){
		for(auto j:d){
			if(i+j<=1e6){
				chmin(dp1.at(i+j),dp1.at(i)+1);
			}
		}
		for(auto j:e){
			if(i+j<=1e6){
				chmin(dp2.at(i+j),dp2.at(i)+1);
			}
		}
	}
	while(1){
		int n; cin>>n;
		if(!n) break;
		cout << dp1.at(n)<<' '<<dp2.at(n)<<endl;
	}
	
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
const int INF = 1<<30;
const int N_MAX = 1000000;

int dp[N_MAX];
int dpOdd[N_MAX];

int main() {
	rep(i,N_MAX) {
		dp[i] = INF;
		dpOdd[i] = INF;
	}
	dp[0] = dpOdd[0] = 0;
	int n=1;
	while(n*(n+1)*(n+2)/6 < N_MAX) {
		int v = n*(n+1)*(n+2)/6;
		for(int i=v; i<N_MAX; i++) {
			dp[i] = min( dp[i], dp[i-v]+1 );
		}
		n++;
	}
	n=1;
	while(n*(n+1)*(n+2)/6 < N_MAX) {
		int v = n*(n+1)*(n+2)/6;
		for(int i=v; i<N_MAX; i++) {
			dpOdd[i] = min( dpOdd[i], dpOdd[i-v]+1 );
		}
		do{ n++; } while((n*(n+1)*(n+2)/6)%2==0);
	}
	while(cin >> n, n) {
		cout << dp[n] << ' ' << dpOdd[n] << endl;
	}
	return 0;
}