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>
using namespace std;
int main(void){
    long long i;
    int n;
    long long j = 0;
    int a[84];
    int b[22];
    long long t[1000010];
    for(i = 0; i < 83; i++){
        a[i] = (i+1)*(i+2)*(i+3)/6;
        if(a[i] % 2 == 1){
            b[j] = a[i];
            j++;
        }
    }
    //cout << a[82] << b[20] << endl;
    /*for(i = 0; i < 83; i++){
        cout << "a[i] = " << a[i] << endl;
    }
    for(i = 0; i < 21; i++){
        cout << "b[i] = " << b[i] << endl;
    }*/
    while(1){
        cin >> n;
        if(n == 0){
            break;
        }
        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 82; i++){
            for(j = a[i]; j <= n; j++){
                if(t[j] > t[j - a[i]] + 1){
                    t[j] = t[j -a[i]] + 1;
                }
            }
        }
        cout << t[n] << " ";

        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 20; i++){
            for(j = b[i]; j <= n; j++){
                if(t[j] > t[j - b[i]] + 1){
                    t[j] = t[j - b[i]] + 1;
                }
            }
        }
        cout << t[n] << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int dp[1000001];
int odd[1000001];
const int n=1000000;

void update(int* dp,int x){
  for(int i=1;i<=n;i++){
    if(i<x)continue;
    dp[i]=min(dp[i],dp[i-x]+1);
  }
}

int main(){
  dp[0]=odd[0]=0;
  for(int i=1;i<=n;i++){
    dp[i]=99999999;
    odd[i]=99999999;
  }
  for(int i=1;i<=n;i++){
    int x=i*(i+1)*(i+2)/6;
    if(x>n)break;
    update(dp,x);
    if(x&1)update(odd,x);
  }
  int a;
  while(cin>>a,a){
    cout << dp[a] << " " << odd[a] << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int a[1000001], b[1000001];

int main(){
	
	for(int i = 0; i <= 1000000; i++){
		a[i] = 1000000;
		b[i] = 1000000;
	}
	
	a[0] = 0;
	b[0] = 0;
	
	for(int num = 1; num < 200; num++){
		int p = num * (num + 1) * (num + 2) / 6;
		if(p % 2 == 1){
			for(int i = 0; i <= 1000000 - p; i++){
				a[i + p] = min(a[i + p], a[i] + 1);
			}
		}
		for(int i = 0; i <= 1000000 - p; i++){
			b[i + p] = min(b[i + p], b[i] + 1);
		}
	}
	
	int N;
	
	while(true){
		cin >> N;
		if(N == 0){
			break;
		}
		cout << b[N] << " " << a[N] << endl;
	}
	
	return 0;
}

C++: #pragma GCC optimize ("O3")

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...)  cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif

void d_err() {
    cerr << endl;
}

template <typename H, typename... T>
void d_err(H h, T... t) {
    cerr << h << " ";
    d_err(t...);
}

template <typename T>
void print(T x) {
    cout << x << "\n";
}

#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REVFOR(i, m, n) for (int i = (n - 1); i >= (m); --i)
#define REP(i, n) FOR(i, 0, n)
#define REVREP(i, n) REVFOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> Pin;

ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9+7;


int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    vector<ll> num_all, num_odd;
    FOR(i, 1, 1000) {
        ll N = i * (i + 1) * (i + 2) / 6;
        if (N > 1e6) break;
        num_all.pb(N);
        if(N & 1) num_odd.pb(N);
    }

    const int nmax = (int)1e6 + 1;

    vi dp_all(nmax, INF), dp_odd(nmax, INF);
    dp_all[0] = 0;
    dp_odd[0] = 0;

    for(auto &e: num_all) {
        REP(i, dp_all.size()) {
            if (i + e >= nmax) break;
            dp_all[i + e] = min(dp_all[i + e], dp_all[i] + 1);
        }
    }

    for(auto &e: num_odd) {
        REP(i, dp_odd.size()) {
            if (i + e >= nmax) break;
            dp_odd[i + e] = min(dp_odd[i + e], dp_odd[i] + 1);
        }
    }

    while(1) {
        int n; cin >> n;

        if (n == 0) break;

        cout << dp_all[n] << " " << dp_odd[n] << endl;
    }

}

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

int main(){
	//正四面体数とその中から奇数のものだけを抜きとったものを用意
	int sq[200]={0};
	int oddsq[200]={0};
	//その配列のindexを保存
	int index=0;
	int indexODD=0;
	 //dp初期化用の値
	int INF=2000000;
	
	for(int i=0; (i+1)*(i+2)*(i+3)/6<=1000000; ++i){
		sq[i]=(i+1)*(i+2)*(i+3)/6;
		if(sq[i]%2==1) oddsq[indexODD++]=sq[i];	
		//printf("%3d :%7d\n",i, sq[i]);
		index=i+1;
	}
	//printf("index= %d, inODD = %d\n", index, indexODD);
	
	//dpA[i]:=数iを正四面体数の和として表すときに必要な正四面体数の数の最小値		
	int dpA[1000001];
	fill(dpA,dpA+1000001,INF);
	dpA[0]=0;
		
	for(int i=0; i<1000001; ++i){
		for(int j=0; j<index; ++j){
			if(i+sq[j]<1000001) dpA[i+sq[j]]=min(dpA[i+sq[j]],dpA[i]+1);
			else break;	
		}	
	}
		
	//dpB[i]:=数iを正四面体数の和として表すときに必要な「奇数の」正四面体数の数の最小値		
	int dpB[1000001];
	fill(dpB,dpB+1000001,INF);
	dpB[0]=0;
		
	for(int i=0; i<1000001; ++i){
		for(int j=0; j<indexODD; ++j){
			if(i+oddsq[j]<1000001) dpB[i+oddsq[j]]=min(dpB[i+oddsq[j]],dpB[i]+1);
			else break;	
		}	
	}
		
	while(1){
		int n;
		scanf(" %d", &n);
		if(n==0) break;
		printf("%d %d\n", dpA[n], dpB[n]);
	}	
}