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 <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

int main() {
    const int n = 1000000;
    vector<int> pyramid_nums;
    int k = 1;
    while(true) {
        int num = k*(k+1)*(k+2) / 6;
        if(num >= n) break;
        pyramid_nums.push_back(num);
        k++;
    }
    vector<int> dp;
    dp.push_back(0);
    for(int k = 1; k < n; ++k) {
        int elem = k;
        for(int p_num : pyramid_nums) {
            if(p_num > k) break;
            if(elem > dp[k - p_num] + 1) elem = dp[k - p_num] + 1;
        }
        dp.push_back(elem);
    }
    vector<int> dp_odd;
    dp_odd.push_back(0);
    for(int k = 1; k < n; ++k) {
        int elem = k;
        for(int p_num : pyramid_nums) {
            if(p_num % 2 == 0) continue;
            if(p_num > k) break;
            if(elem > dp_odd[k - p_num] + 1) elem = dp_odd[k - p_num] + 1;
        }
        dp_odd.push_back(elem);
    }
    while(true) {
        int q; cin >> q;
        if(q == 0) break;
        cout << dp[q] << ' ' << dp_odd[q] << endl;
    }
    return 0;
}

// [Problem] Pollock's conjecture
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167&lang=jp

C++: 
#include <iostream>
#include <string>
#include <algorithm>
#include <list>
#include <set>
#define foreach(t,p) for(t::iterator it=p.begin();it!=p.end();++it)
#define rforeach(t,p) for(t::reverse_iterator it=p.rbegin();it!=p.rend();++it)
using namespace std;
#define REP(n) for(int i=0;i<n;i++)
#define N 1000001
#define POL 180
int pol[POL];
int pol2[POL];
int dp1[N];
int dp2[N];
int num;

void solve1() {
    REP(N) dp1[i] = N;
    dp1[0] = 0;
    REP(5) {
        for(int k=0;k<N;k++) {
            if(dp1[k] == i) {
                for(int j=0;j<POL;j++) 
                    if(k+pol[j] <=N)
                        dp1[k+pol[j] ] = min(dp1[k+pol[j]],dp1[k]+1);
            }
        }
    }
}

int solve2(int n) {
    REP(N) dp2[i] = N;
    dp2[0] = 0;
    for(int cnt =0;;cnt++){
        for(int i=0;i<N;i++) {
            if(dp2[i] == cnt) {
//                cout << i << " "  << " " << dp2[i] << endl;
                for(int j=0;j<num;j++) {
                if(i+pol2[j] <= N) {
                dp2[i+pol2[j] ] = min(dp2[i+pol2[j]],dp2[i]+1);
                if(i+pol2[j] == n) return dp2[i+pol2[j]];
                }
                }
            }
        }
    }
}

int main() {
    num = 0;
    REP(POL){
        pol[i] = (i+1)*(i+2)*(i+3)/6;
        if(pol[i]%2 == 1) pol2[num++] = pol[i];
    }
    solve1();
//    REP(30) cout << dp1[i];
    int q;
    while(cin >> q && q) {
        cout << dp1[q] << " " << solve2(q) << endl;
    }

    return 0;
}

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

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

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

int main()
{
	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 = 1, oddcounter = 1;
	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 * 2)
			break;

	}


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

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

	return 0;

}

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

#define INF 1 << 28

int t[500];
int odd_t[500];
int ns[1000001];
int odd_ns[1000001];

int count_t(int n) {
	if (ns[n] != 0) return ns[n];
	if (binary_search(t, t+500, n)) return 1;
	ns[n] = INF;
	for (int i = 0; n-t[i] >= 0; i++) {
		ns[n] = min(ns[n], count_t(n-t[i])+1);
	}
	return ns[n];
}

int count_odd_t(int n) {
	if (odd_ns[n] != 0) return odd_ns[n];
	if (binary_search(odd_t, odd_t+100, n)) return 1;
	odd_ns[n] = INF;
	for (int i = 0; n-odd_t[i] >= 0; i++) {
		odd_ns[n] = min(odd_ns[n], count_odd_t(n-odd_t[i])+1);
	}
	return odd_ns[n];
}

int main() {
	memset(ns, 0, sizeof(ns));
	memset(odd_ns, 0, sizeof(odd_ns));

	int odd_pos = 0;
	for (int i = 0; i < 500; i++) {
	   	t[i] = (i+1)*(i+2)*(i+3) / 6;
		if (t[i] % 2 == 1) odd_t[odd_pos++] = t[i];
	}
	int n;
	while (cin >> n, n) {
		cout << count_t(n) << ' ' << count_odd_t(n) << endl;
	}
	return 0;
}