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 <cstdio>
#include <algorithm>
using namespace std;

int n;
int memo1[1000001], memo2[1000001], memoodd[1000001], memo3[1000001];

int pollock_1(int n)
{
    int min = 100, ex;
    if (n == memo1[n])
        return memo2[n] = 1;
    if (memo2[n] > 0)
        return memo2[n];
    for (int i = 1; i < 1000001; i++)
    {
        if (i <= n / 2)
        {
            if (pollock_1(n - i) == 1)
            {
                ex = pollock_1(n - i) + pollock_1(i);
            }
            if (i == 1)
            {
                ex = pollock_1(n - 1) + 1;
            }
            if (ex < min)
                min = ex;
        }
    }
    return memo2[n] = min;
}

int pollock_2(int n)
{
    int min = 10000000, ex;
    if (n == memoodd[n])
        return memo2[n] = 1;
    if (memo3[n] > 0)
        return memo3[n];
    for (int i = 1; i < 1000001; i++)
    {
        if (i <= n / 2)
        {
            if (pollock_2(n - i) == 1)
            {
                ex = pollock_2(n - i) + pollock_2(i);
            }
            if (i == 1)
            {
                ex = pollock_2(n - 1) + 1;
            }
            if (ex < min)
                min = ex;
        }
    }
    return memo3[n] = min;
}

int main()
{
    for (int k = 0; k < 1000001; k++)
    {
        memo1[k] = 0;
        memo2[k] = 0;
        memoodd[k] = 0;
        memo3[k] = 0;
    }
    for (int k = 1; k < 200; k++)
    {
        n = (k * (k + 1) * (k + 2)) / 6;
        memo1[n] = n;
        if (n % 2 != 0)
            memoodd[n] = n;
    }

    scanf("%d", &n);
    printf("%d %d\n", pollock_1(n), pollock_2(n));
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define  M 1e6
using namespace std;
typedef long long int ll;
vector<ll> x,y;
ll f(int n){
	return n*(n+1)*(n+2)/6;
}
void make(void){
	int i=1;
while(f(i)<M){
x.push_back(f(i));
if(f(i)%2==1){
	y.push_back(f(i));
}
	i++;
}
}
int main(void){
	make();
vector<ll> num(M,6),num2(M,1000000);
for(ll i=0;i<x.size();i++){
num[x[i]]=1;
}
for(ll i=0;i<y.size();i++){
	num2[y[i]]=1;
}
for(ll i=0;i<x.size();i++){
	for(ll j=x[i];j<M;j++){
		num[j]=min(num[j],num[j-x[i]]+1);
	}
}
for(ll i=0;i<y.size();i++){
	for(ll j=y[i];j<M;j++){
		num2[j]=min(num2[j],num2[j-y[i]]+1);
	}
}
int n;

while(1){
	cin>>n;
	if(n==0)break;

	cout<<num[n]<<" "<<num2[n]<<endl;
}
return 0;
}

C++: #include <iostream>
#include <algorithm>

#define MAXNUM 1000000
#define MAX 100
using namespace std;

int all[MAXNUM], odd[MAXNUM], fourall[MAXNUM], fourodd[MAXNUM];


int _tmain(int argc, _TCHAR* argv[])
{
	int n;
	int counter = 0;
	for (int i = 1; i < MAXNUM; i++){
		all[i] = MAX;
		odd[i] = MAX;

	}

	//1からMAXNUMまでの中に存在する正四面体数を洗い出す．
	int now = 0, four, allcounter = 0, oddcounter = 0;
	while (1){
		now++;
		four = now  *(now + 1)*(now + 2) / 6;
		all[four] = 1;
		fourall[allcounter++] = four;
		if (four % 2 == 1){
			odd[four] = 1;
			fourodd[oddcounter++] = four;
		}
		if (four > MAXNUM)
			break;
	}
	//cout << fourall[allcounter - 1] << endl;
	//cout << "ok" << endl;
	//cout << allcounter << endl;

	//1からMAXNUMまで，配列を埋める.
	for (int i = 1; i <= MAXNUM; i++){
		for (int j = 0; i > fourall[j]; j++){
			all[i] = min(all[i], 1 + all[i - fourall[j]]);
		}
			//cout << i << ":" << all[i]<<endl;

		for (int j = 0; i > fourodd[j]; j++){
			odd[i] = min(odd[i], 1 + odd[i - fourodd[j]]);
		}

	}

	//cout << "aaa" << endl;


	//入力
	while (cin >> n, n)
		cout << all[n] << " " << odd[n] << endl;

	return 0;

}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const int N = 1000000;
const int mod = 1000000007;
const int INF = 1 << 30;
#define rep(i,n) for(int i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define fix(n) fixed<<setprecision(n)
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
ll ss[5000];//正四面体数
vector<ll>v;
ll dp[10000000], dp2[10000000];
int main() {
	v.pb(0);
	ll n, now = 1, now2 = 1;
	rep(i, 5000) {
		ss[i] = (ll)(i*(i + 1)*(i + 2) / 6);
		if (ss[i] % 2 == 1)v.pb(ss[i]);
	}
	rep(i, 1000000) {
		if (i < 2) { dp[i] = i; dp2[i] = i;continue; }
		if (i >= ss[now + 1])++now;
		dp[i] = i / ss[now] + dp[i%ss[now]];
		for (int j = now - 1; j >= 1; --j)dp[i] = min(dp[i], (ll)i / ss[j] + dp[i%ss[j]]);
		if (i >= v[now2 + 1])++now2;
		dp2[i] = i / v[now2] + dp2[i%v[now2]];
		for (int j = now2 - 1; j >= 1; --j)dp2[i] = min(dp2[i], (ll)i / v[j] + dp2[i%v[j]]);
	}
	while (cin >> n, n) {
		rep(i, n)cout << i << "ha" << dp[i] << endl;
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}