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>
using namespace std;

const int INF = 1<<21;

int main(){
    static int dp[1000000], dpo[1000000];
    for(int i = 1; i < 1000000; i++)    dp[i] = dpo[i] = INF;

    vector<int> tetra;
    for(int i = 1; i*(i+1)*(i+2)/6 < 1000000; i++){
        tetra.push_back(i*(i+1)*(i+2)/6);
    }

    for(int i = 0; i < tetra.size(); i++){
        for(int j = tetra[i]; j < 1000000; j++){
            if(dp[j-tetra[i]] == INF)   continue;
            
            dp[j] = min(dp[j], dp[j-tetra[i]]+1);
            if(tetra[i] % 2)    dpo[j] = min(dpo[j], dpo[j-tetra[i]]+1);
        }
    }

    int n;
    while(cin >> n, n){
        cout << dp[n] << " " << dpo[n] << endl;
    }

    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<functional>
#define rep(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
using namespace std;
#define ull unsigned long long
int memo[150];
int  dp[1000002];
int  dp2[1000002];
void inset(){
	dp[0]=0;
	fill(dp,dp+1000001,10000);
	fill(dp2,dp2+1000001,10000);
	dp[0]=0;
	dp2[0]=0;
	rep(i,1,150){
		memo[i]=i*(i+1)*(i+2),memo[i]/=6;
		rep(j,1,1000001)
			if(j-memo[i]>=0){
		if(dp[j]>dp[j-memo[i]]+1)dp[j]=dp[j-memo[i]]+1;
		if(memo[i]&1)if(dp2[j]>dp2[j-memo[i]]+1)dp2[j]=dp2[j-memo[i]]+1;
		}
	}
	//rep(i,1,1000001){
	//	if(dp2[i]==0){
	//	printf("[%d]%d\n",i,dp2[i]);
	//	break;
	//	}
	}
}


int main(void){
	inset();
	int x;
	while(true){
		cin>>x;if(x==0)return(0);
		cout<<dp[x]<<" "<<dp2[x]<<endl;
	}

}

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

using namespace std;

int dp1[1000010]={0};
int dp2[1000010]={0};
int List[200];

void setpolloc(){
	int i,j,li;
	for(i=1;i*(i+1)*(i+2)/6<1000000;i++){
		List[i]=i*(i+1)*(i+2)/6;
		dp1[i*(i+1)*(i+2)/6]=1;
		if((i*(i+1)*(i+2)/6)%2) dp2[i*(i+1)*(i+2)/6]=1;
	}
	for(i=1;i<1000000;i++){
		if(dp2[i]) continue;
		for(j=1;List[j]<=i-1;j+=2)if(!dp2[i] || dp2[List[j]]+dp2[i-List[j]] < dp2[i]) dp2[i]=dp2[List[j]]+dp2[i-List[j]];
		if(dp1[i]) continue;
		for(j=1;List[j]<=i-1;j++) if(!dp1[i] || dp1[List[j]]+dp1[i-List[j]] < dp1[i]) dp1[i]=dp1[List[j]]+dp1[i-List[j]];
	}
}


int main(){
	int n;
	setpolloc();
	while(cin>>n,n){
		cout << dp1[n] << ' ' << dp2[n] << endl;
	}
	return 0;
}

C++: #include <iostream>
#define MAX 1000000
#define INF 1000000000
using namespace std;

int dp1[MAX+1],dp2[MAX+1];

int main(){
    //INFで初期化
    for(int i = 0;i <= MAX;i++){
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1;n * (n + 1) * (n * 2) /6 <= MAX;n++){
        int a = n * (n + 1) * (n + 2) / 6;  //ポロック数の生成
        for(int i = a;i <= MAX;i++)     //正四面体数の個数dp(a以下は必要ない)
            dp1[i] = min(dp1[i],dp1[i-a] + 1);  //更新しないor左側から更新する
        if(a % 2 == 0)continue;     //偶数の時は次のroopへ
        for(int i = a;i <= MAX;i++)     //奇数の正四面体数の個数dp(a以下は必要ない)
            dp2[i] = min(dp2[i],dp2[i-a] + 1);  //更新しないor左側から更新する
    }

    //入出力
    while(true){
        int n;
        cin >> n;
        if(n == 0)break;
        cout << dp1[n] << " " << dp2[n] << endl;
    }

    return 0;
}

C++: 
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <limits.h>
#include <string>
#include <sstream>

using namespace std;

vector<int> GetIntVector()
{
	string str;
	getline(cin,str);
	istringstream line( str );

	istream_iterator<int> iit(line);
	istream_iterator<int> iit_eof;

	vector<int> ret;

	for(;iit != iit_eof; iit++){
		ret.push_back(*iit);
	}

	return ret;
}

int tetrahedralNumber(int count)
{
	return count * (count + 1) * (count + 2) / 6;
}

bool isEven(int num){ return num % 2 == 0; }

int GetMinCombination(vector<int>& numbers,int input,int maxConbination)
{

	int minConbi = INT_MAX;

	vector<int>::reverse_iterator rit = numbers.rbegin();   
	for(; rit != numbers.rend(); rit++)  
	{
		if( (*rit) > input) continue; //ツ妥・ツつォツつ「ツ甘板づ債暗クツつッツづ按つ「ツづ個づ姪淞つキ
		if( (*rit) < input / maxConbination) break; //ツ表ツつオツつォツづェツづ按つ「
		if(input - (*rit) == 0) return 1; //ツ暗ェツづつづ個青板づ表ツつケツつス

		int conbi = GetMinCombination(numbers,input - (*rit),(minConbi == INT_MAX) ? maxConbination - 1 : minConbi - 1);
		if(conbi != INT_MAX)
			minConbi = conbi + 1; //conbiツ青板更ツ新
	}

	return minConbi;
}

void solve(int inputs)
{
	vector<int> tNumbers;
	tNumbers.push_back(0);
	for(int i = 1; inputs > tNumbers[tNumbers.size() - 1]; i++){
		tNumbers.push_back(tetrahedralNumber(i));
	}
	tNumbers.erase(tNumbers.begin());

	int conbi = GetMinCombination(tNumbers,inputs,5);

	vector<int>::iterator rem = remove_if(tNumbers.begin(),tNumbers.end(),isEven);
	tNumbers.erase( rem, tNumbers.end());

	int oddConbi = GetMinCombination(tNumbers,inputs,inputs);

	cout << conbi << ' ' << oddConbi << endl;
}

void C()
{
	int input = GetIntVector()[0];
	while(input){
		solve(input);
		input = GetIntVector()[0];
	}
}
int main()
{
	C();

	return 0;
}