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<bits/stdc++.h>
const int MAX=1e6+10;
using namespace std;
int main(){
    vector<int>precal;
    vector<int>dp(MAX,MAX);
    vector<bool>flag(MAX,false);
    int n;
    precal.push_back(0);
    dp[0]=0;
    for(int i=1;;i++){
        int cnt=((i)*(i+1)*(i+2))/6;
        if(cnt>MAX)break;
        precal.push_back(cnt);
        flag[cnt]=true;
    }
    for(int i=1; i<=MAX-9;i++){
        if(flag[i]){dp[i]=1; continue;}
        int index=upper_bound(precal.begin(),precal.end(),i)-precal.begin();
        for(int j=0; j<=index;j++)
            dp[i]=min(dp[i],dp[precal[j]]+dp[i-precal[j]]);
    }
    vector<int>oddcal;
    vector<int>odp(MAX,MAX);
    vector<bool>oddflag(MAX,false);
    oddcal.push_back(0);
    odp[0]=0;
    for(int i=1;;i++){
        int cnt=(i*(i+1)*(i+2))/6;
        if(cnt>MAX)break;
        if(!(cnt%2))continue;
        oddcal.push_back(cnt);
        oddflag[cnt]=true;
    }
    for(int i=1; i<=MAX-9;i++){
        if(oddflag[i]){odp[i]=1;continue;}
        int index=upper_bound(oddcal.begin(), oddcal.end(), i)-oddcal.begin();
        for(int j=0;j<=index;j++)
            odp[i]=min(odp[i],odp[oddcal[j]]+odp[i-oddcal[j]]);
        
    }
    while(cin>>n,n){
        cout<<dp[n]<<" "<<odp[n]<<endl;
    }
}

C++: #include<iostream>
#include<vector>
#include<cstdio>
#include<cstring>
#include<cctype>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define SZ(a) ((int)((a).size()))
#define REPSZ(i,v) REP(i,SZ(v))
#define ALL(a) (a).begin(),(a).end()
typedef long long Int;

template<class T> void pv(T a, T b){for(T i=a;i!=b;++i)cout<<*i<<' ';cout<<endl;}

int dp[1000 * 1000 + 10];
int dp_odd[1000 * 1000 + 10];

int main() {
  int v[200];
  for(int i = 0; i < 200; i++) {
    v[i] = i * (i + 1) * (i + 2) / 6;
  }

  memset( dp, -1, sizeof(dp) );
  memset( dp_odd, -1, sizeof(dp_odd) );

  dp[0] = dp_odd[0] = 0;

  for(int i = 0; i < 200; i++)
    for(int j = 0; j + v[i] <= 1000 * 1000; j++) {
      if( dp[j] != -1 ) {
        if( dp[j + v[i]] == -1 || dp[j + v[i]] > dp[j] + 1 )
          dp[j + v[i]] = dp[j] + 1;
      }

      if( (v[i] & 1) && dp_odd[j] != -1 ) {
        if( dp_odd[j + v[i]] == -1 || dp_odd[j + v[i]] > dp_odd[j] + 1 )
          dp_odd[j + v[i]] = dp_odd[j] + 1;
      }

    }

  for(int N; cin >> N, N; ) {
    cout << dp[N] << " " << dp_odd[N] << endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
typedef pair<int, int> P;

int d[1000001], d2[1000001];

int main()
{
	int tet[1001];
	for (int i = 1; i <= 1000; i++){
		tet[i] = i * (i + 1) * (i + 2) / 6;
	}
	
	fill(d, d + 1000001, INF);
	queue<P> que;
	for (que.push(P(0, 0)); que.size(); que.pop()){
		P p = que.front();
		if (d[p.first] <= p.second) continue;
		d[p.first] = p.second;
		for (int i = 1; p.first + tet[i] <= 1000000; i++){
			if (d[p.first + tet[i]] <= p.second + 1) continue;
			que.push(P(p.first + tet[i], p.second + 1));
		}
	}
	
	fill(d2, d2 + 1000001, INF);
	while (!que.empty()) que.pop();
	for (que.push(P(0, 0)); que.size(); que.pop()){
		P p = que.front();
		if (d2[p.first] <= p.second) continue;
		d2[p.first] = p.second;
		
		for (int i = 1; p.first + tet[i] <= 1000000; i++){
			if (tet[i] % 2 == 0) continue;
			if (d2[p.first + tet[i]] <= p.second + 1) continue;
			que.push(P(p.first + tet[i], p.second + 1));
		}
	}
	
	int n;
	while (scanf("%d", &n), n){
		cout << d[n] << " " << d2[n] << endl;
	}
	
	return 0;
}

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

using namespace std;

int MAX;
vector<int> V;
vector<int> D;
int N;
int M;
bool dp[10][100000] = {0};

void solve(int n) {
	int ans = 1;

	for (int i=0; V[i]<=n; i++)
		dp[0][V[i]] = 1;

	for (int i=1; i<5 && !dp[i-1][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++) {
			if (!dp[i-1][j]) continue;
			for (int k=0; j+V[k]<=n; k++)
				dp[i][j+V[k]] = 1;
			if (dp[i][n]) break;
		}
	}

	cout << ans << " ";

	memset(dp, 0, sizeof(dp));

	ans = 1;

	for (int i=0; D[i]<=n; i++)
		dp[0][D[i]] = 1;

	for (int i=1; i<=100000 && !dp[1-i%2][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++) {
			//dp[i%2][j] = 0;
			if (!dp[1-i%2][j]) continue;
			for (int k=0; j+D[k]<=n; k++)
				dp[i%2][j+D[k]] = 1;
			if (dp[i%2][n]) break;
		}
	}

	cout << ans << endl;
}

int main() {
	MAX = (int)pow(10.0, 6);
	for (int i=1; i*(i+1)*(i+2)/6<=MAX; i++) {
		V.push_back(i*(i+1)*(i+2)/6);
		if ( V[i-1]%2==1 ) D.push_back(i*(i+1)*(i+2)/6);
	}
	N = (int)V.size();
	M = (int)D.size();

	int n;
	cin >> n;
	while (n!=0) { 
		solve(n);
		cin >> n;
	}
	return 0;
}