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 <algorithm>
#include <vector>
using namespace std;

const int MAX_N = 1000001;
const int INF = 1<<27;
vector<int> N3, N4;
int T[2][MAX_N];

void makeN4() {
  for(int n = 1; ; ++n) {
    int s = n*(n+1)*(n+2)/6;
    if(s >= MAX_N) break;
    N4.push_back(s);
  }
}

void solve(bool oddOnly) {
  int *t = T[oddOnly];
  fill(t, t+MAX_N, INF);
  t[0] = 0;

  for(int j = 0; j < N4.size(); ++j) {
    if(oddOnly && N4[j]%2 == 0) continue;
    for(int i = N4[j]; i < MAX_N; ++i) {
      t[i] = min(t[i], t[i-N4[j]] + 1);
    }
  }
  /*
  for(int i = 1; i < MAX_N; ++i) {
    for(int j = 0; j < N4.size() && N4[j] <= i; ++j) {
      if(oddOnly && N4[j]%2 == 0) continue;
      t[i] = min(t[i], t[i-N4[j]] + 1);
    }
  }
  */
}

int main() {
  makeN4();
  solve(false);
  solve(true);
  int N;
  while(cin >> N && N) {
    cout << T[0][N] << " " << T[1][N] << endl;
  }
  return 0;
}

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

using namespace std;

int tetrahedron(int);

int index_direct_match(int);
int index_direct_match_odd(int);
int index_number(int);
int index_number_odd(int);

int main(int argc, char const *argv[]) {

  int n;
  int cnt_min;
  int cnt_only_odd;

  for(cin >> n;n != 0;cin >> n){

    cout << index_number(n) << " " <<  index_number_odd(n) << endl;

  }

  //

  return 0;
}

int tetrahedron(int k){

  return k*(k+1)*(k+2)/6;

}

int index_number(int index){
  static int memo[1000]={};
  if(index>=1 && index<=3) return index;
  else if(index_direct_match(index)) return 1;
  else if(memo[index] != 0) return memo[index];
  else{
    vector<int> comp_array;
    for(int i=1;index > tetrahedron(i);i++){
      //cout << "index:" << index << endl;
      //cout << "tetra:" << tetrahedron(i) << endl;
      comp_array.push_back(1+index_number( index - tetrahedron(i) ));
    }
    memo[index]=(int)*min_element(comp_array.begin(),comp_array.end());
    return *min_element(comp_array.begin(),comp_array.end());
  }

}

int index_direct_match(int index){

  for(int i=1;i<200;i++){
    if(index == tetrahedron(i)){
      return 1;
    }
  }
  return 0;
}

int index_direct_match_odd(int index){

  for(int i=1;i<200;i+=4){
    if(index == tetrahedron(i)){
      return 1;
    }
  }
  return 0;
}

int index_number_odd(int index){
  static int memo2[1000]={};
  if(index>=1 && index<=34) return index;
  else if(index_direct_match_odd(index)) return 1;
  else if(memo2[index] != 0) return memo2[index];
  else{
    vector<int> comp_array;
    for(int i=1;index > tetrahedron(i);i+=4){
      //cout << "index:" << index << endl;
      //cout << "tetra:" << tetrahedron(i) << endl;
      comp_array.push_back(1+index_number_odd( index - tetrahedron(i) ));
    }
    memo2[index]=(int)*min_element(comp_array.begin(),comp_array.end());
    return *min_element(comp_array.begin(),comp_array.end());
  }
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[190]={0},b[100]={0},c[1000001]={0,1,2,3},d[1000001],k=0,i,j,n;
  for(i=1;i<190;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<189;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

int a[201];
int dp1[1000001],dp2[1000001];
int main(){
    FOR(i,1,201){
        a[i-1]=i*(i+1)*(i+2)/6;
    }
    int n;
    while(cin>>n,n){
        rep(i,n+1) dp1[i]=dp2[i]=1000100010;
        dp1[n]=0,dp2[n]=0;
        rep(i,200)for(int j=n;j>=0;--j){
            if(j>=a[199-i]) dp1[j-a[199-i]]=min(dp1[j-a[199-i]],dp1[j]+1);
            if(j>=a[199-i]&&a[199-i]%2==1) dp2[j-a[199-i]]=min(dp2[j-a[199-i]],dp2[j]+1);
        }
        cout<<dp1[0]<<" "<<dp2[0]<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#define N 1000
#define INFINITY 2000000000
using namespace std;
int dp[N][N],data[N];
vector<int> data2;
int DP(int);
int DP2(int);
int main(){
  int i,out,out2,n;
  data2.push_back(0);
  for(i=1;i<N;i++){
    data[i]=i*(i+1)*(i+2)/6;
    if(data[i]%2==1){
      data2.push_back(data[i]);
    }
  }
  while(1){
    cin >> n;
    if(n==0) break;
    out=DP(n);
    out2=DP2(n);
    cout << out << ' ' << out2 << endl;
  }
  return 0;
}
int DP(int n){
  int i,j,minret,s;
  for(i=1;i<N;i++){
    if(data[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}
int DP2(int n){
  int i,j,minret,s,len;
  len=data2.size();
  for(i=1;i<len;i++){
    if(data2[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data2[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data2[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}