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>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265

int c[300];
vector<int> d;
int a[10000000],b[10000000];

void f(int n){

  int j=1;
  FOR(i,1,n+1){
    if(c[j+1]==i){
      a[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,1,j+1){
        res = min(res,(i/c[k])+a[i%c[k]]);
      }
      a[i] = res;
    }
  }


  j = 0;
  FOR(i,1,n+1){
    if(d[j+1]==i){
      b[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,1,j+1){
        res = min(res,(i/d[k])+b[i%d[k]]);
      }
      b[i] =res;
    }
  
  }




}

void g(int n){
  cout<<a[n]<<' '<<b[n]<<endl;
}


int main(){

  for(int i=1;i<200;i++){
    c[i] = (i*(i+1)*(i+2))/6;
   if(c[i]%2){
     d.push_back(c[i]);
   }
  }

  f(1000000);

  while(1){
    int n;
    cin>>n;
    if(n==0) break;
    g(n);
  }

  return 0;
}

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

int dp[2][1000001];

int f(int n)
{
    return n * (n + 1) * (n + 2) / 6;
}

int main()
{
    int n;
    for(int k = 0; k < 2; k++)
        fill(dp[k], dp[k] + 1000001, 1000000);
    
    dp[0][0] = dp[1][0] = 0;
    for(int i = 1; i <= 1000000; i++) {
        for(int k = 1; ; k++) {
            int num = f(k);
            if(i - num >= 0) {
                dp[0][i] = min(dp[0][i], dp[0][i - num] + 1);
                if((num % 2) == 1) {
                    dp[1][i] = min(dp[1][i], dp[1][i - num] + 1);
                }
            } else {
                break;
            }
        }
    }
    
    while(cin >> n && n) {
        cout << dp[0][n] << " " << dp[1][n] << endl;
    }
}

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

using namespace std;
static const int INF = 999999999;
vector<int> tetrahedral;
int min_depth;
int min_odd_depth;
int n;

void DFS(int pos, int depth, int sum)
{
	if(sum == n)
	{
		if(depth < min_depth)
		{
			min_depth = depth;
		}
		return;
	}
	else if(sum > n)
	{
		return;
	}
	else
	{
		for(int i = pos; i >= 0; --i)
		{
			DFS(i, depth + 1, sum + tetrahedral[i]);
		}
	}
}

void DFS2(int pos, int depth, int sum)
{
	if(sum == n)
	{
		if(depth < min_odd_depth)
		{
			min_odd_depth = depth;
		}
		return;
	}
	else if(sum > n)
	{
		return;
	}
	else
	{
		for(int i = pos; i >= 0; --i)
		{
			if(tetrahedral[i] % 2)
			{
				DFS2(i, depth + 1, sum + tetrahedral[i]);
			}
		}
	}
}

void solve()
{
	for(int i = 1; i * (i + 1) * (i + 2) / 6 <= 1000000; ++i)
	{
		tetrahedral.push_back(i * (i + 1) * (i + 2) / 6);
	}
	while(cin >> n, n)
	{
		min_depth = INF;
		min_odd_depth = INF;
		int pos = 0;
		while(tetrahedral[pos] < n)
		{
			++pos;
		}
		for(int i = pos; i >= 0; --i)
		{
			DFS(i, 1, tetrahedral[i]);
		}
		while(tetrahedral[pos] % 2 == 0)
		{
			--pos;
		}
		for(int i = pos; i >= 0; --i)
		{
			if(tetrahedral[i] % 2)
			{
				DFS2(i, 1, tetrahedral[i]);
			}
		}
		cout << min_depth << " " << min_odd_depth << endl;
	}
}

int main()
{
	solve();
	return(0);
}

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

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }
    ////
    int dp[100000];
    //fill(dp,dp + x+1,100000);
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count-1;j++){
	if(i+coin[j]<=x){
	  //dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	  tmp=min(dp[i+coin[j]],dp[i]+1);
	  //dp[i+coin[j]]=tmp;
	}
      }
    }

    cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1); 
	  tmp=min(dp[i+coin_ki[j]],dp[i]+1);
	  //dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
  int i,j,k,b[1000001],c[1000001],a[200],n;
  for(i=0;a[i-1]<1000000;i++)a[i]=i*(i+1)*(i+2)/6;
  for(j=0;j<=1000000;j++)b[j]=c[j]=j;
  for(j=2;j<i;j++)for(k=a[j];k<=1000000;k++){
    if(a[j+1]<k)break;
    b[k]=min(b[k],b[k-a[j]]+1);
    if(a[j]%2)c[k]=min(c[k],c[k-a[j]]+1);
  }
while(cin>>n,n)cout<<b[n]<<' '<<c[n]<<endl;
return 0;
}