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

using namespace std;

typedef vector<int> vi;

#define PB push_back

const int inf = 1e9;

int dp[1000001], dp_odd[1000001];

int main()
{
	vi tet, tet_odd;

	for (int i = 1; ; ++i) {
		tet.PB(i * (i + 1) * (i + 2) / 6);
		if (tet.back() >= 1000000) break;
	}

	for (int i = 0; i < tet.size(); ++i) {
		if (tet[i] & 1) tet_odd.PB(tet[i]);
	}

	for (int i = 1; i <= 1000000; ++i) dp[i] = dp_odd[i] = inf;

	for (int i = 1; i <= 1000000; ++i) {
		for (int j = 0; j < tet.size(); ++j) {
			if (i >= tet[j]) {
				dp[i] = min(dp[i], dp[i - tet[j]] + 1);
			}
			if (i < tet[j]) break;
		}

		for (int j = 0; j < tet_odd.size(); ++j) {
			if (i >= tet_odd[j]) {
				dp_odd[i] = min(dp_odd[i], dp_odd[i - tet_odd[j]] + 1);
			}
			if (i < tet_odd[j]) break;
		}
	}

	int N;
	while (scanf("%d", &N), N) printf("%d %d\n", dp[N], dp_odd[N]);
}

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

const int N = 1000000;
int dp[2][N+1];

int main(){
  for(int i=0;i<=N;i++)dp[0][i] = dp[1][i] = N;
  dp[0][0] = dp[1][0] = 0;

  int val = 1;
  for(int i=1;val<=N;i++){
    for(int j=0;j+val<=N;j++){
      int nxt = j+val;
      if(dp[0][nxt]>dp[0][j]+1)dp[0][nxt] = dp[0][j] + 1;
      if( (val&1) && (dp[1][nxt]>dp[1][j]+1))dp[1][nxt] = dp[1][j] + 1;
    }
    val = i*(i+1)*(i+2)/6;
  }

  int n;
  while(scanf("%d",&n),n)printf("%d %d\n",dp[0][n],dp[1][n]);
}

C++: #include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include<map>//map(辞書)
#include<numeric>//iota(整数列の生成),gcdとlcm(c++17)
#include<queue>//キュー
#include<set>//集合
#include<stack>//スタック
#include<string>//文字列
#include<utility>//pair
#include<list>
#include<vector>//可変長配列
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define ll __int64
#define __int64 long long
#define P pair<int,int>
#define PP pair<P,int>
#define F first
#define S second


int n;
vector<int>simen;
vector<int>ki_simen;
const int MAX_N = 1e6;
int dp[MAX_N + 1];
int dp2[MAX_N + 1];

void init() {

    for (int i = 1; i * (i + 1) * (i + 2) / 6 <= MAX_N; i++) {
        int now = i * (i + 1) * (i + 2) / 6;
        simen.pb(now);
        if (now % 2)
            ki_simen.pb(now);
    }
}


void solve() {
    rep(i, MAX_N+ 1)dp[i] = MAX_N;
    dp[0] = 0;

    rep(i, simen.size()) {
        rep(j, MAX_N+1) {
            if (j + simen[i] <= MAX_N)
                dp[j + simen[i]] = min(dp[j + simen[i]], dp[j] + 1);
            else break;
        }
    }


    rep(i, MAX_N+ 1)dp2[i] = MAX_N;
    dp2[0] = 0;
    rep(i, ki_simen.size()) {
        rep(j, MAX_N+1) {
            if (j + ki_simen[i] <= MAX_N)
                dp2[j + ki_simen[i]] = min(dp2[j + ki_simen[i]], dp2[j] + 1);
            else break;
        }
    }
}

int main() {

    init();       
    solve();

    while (cin >> n, n) {
        cout << dp[n] << " " << dp2[n] << endl;
    }
    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)



int main() {
    ll s4[101];
    vector<ll> s4_k;
    for(ll i = 0; i < 101; i++){
        s4[i] = i * (i + 1) * (i + 2) / 6;
        if(s4[i] & 1){
            s4_k.push_back(i * (i + 1) * (i + 2) / 6);
            // cout << s4[i] << endl;
        }
    }
    vector<ll> dp1(1000001, INF), dp2(1000001, INF);
    dp1[0] = 0;
    REP(i, 101){
        REP(j, 1000001){
            if(s4[i] <= j){
                dp1[j] = min(dp1[j], dp1[j - s4[i]] + 1);
            }
        }
    }
    
    dp2[0] = 0;
    REP(i, s4_k.size()){
        REP(j, 1000001){
            if(s4_k[i] <= j){
                dp2[j] = min(dp2[j], dp2[j - s4_k[i]] + 1);
            }
        }
    }
    
    ll n;
    cin >> n;
    
    while(n != 0){
        cout << dp1[n] << ' ' << dp2[n] << endl;
        
        cin >> n;
    }
}