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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define sz size()
#define pb push_back
#define mp make_pair
#define ALL(X) (X).begin(),(X).end()

using namespace std;

const int INF = 1000000000;
const double eps = 1e-8;

vector<int> tetlist(const int n)
{
	vector<int> ary;
	int i = 1;
	while(1)
	{
		if(i*(i+1)*(i+2)/6 > n)
			break;
		else
		{
			ary.pb(i*(i+1)*(i+2)/6);
		  i++;
		}
	}
	return ary;
}

vector<int> search(const int n)
{
	vector<int> ary(n+1,INF);
	const vector<int> tet = tetlist(n);
	const int len = tet.size();
	ary[0] = 0;
	FOR(i,1,n+1)
	{
		REP(j,len)
		{
			if(tet[j] > i)
				break;
			else
				ary[i] = min(ary[i],ary[i-tet[j]]+1);
		}
	}
	return ary;
}

vector<int> tetlist_o(const int n)
{
	vector<int> ary;
	int i = 1;
	while(1)
	{
		if(i*(i+1)*(i+2)/6 > n)
			break;
		else if(((i*(i+1)*(i+2)/6) % 2) == 1)
			ary.pb(i*(i+1)*(i+2)/6);
		i++;
	}
	return ary;
}

vector<int> search_o(const int n)
{
	vector<int> ary(n+1,INF);
	const vector<int> tet = tetlist_o(n);
	const int len = tet.size();
	ary[0] = 0;
	FOR(i,1,n+1)
	{
		REP(j,len)
		{
			if(tet[j] > i)
				break;
			else
				ary[i] = min(ary[i],ary[i-tet[j]]+1);
		}
	}
	return ary;
}

int main(void) {
  vector<int> a1 = search(1000000);
  vector<int> a2 = search_o(1000000);
  while(1)
  {
  	int n;
  	cin>>n;
  	if(!n)break;
  	cout<<a1[n]<<' '<<a2[n]<<endl;
  }
  return 0;
}

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

int main(void){
  
  int i, input, tetras[200] = {0}, ans[1000][2] = {{0}, {0}};
  int a = 0, b = 0; /* a, b ???ans??????????????????????????? */

  for (i = 1; i < 200; i++) {
    tetras[i] = i * (i+1) * (i+2) / 6;
  }

  while (cin >> input) {
    if (input == 0) break;
    int temp = input;
    int j = 1, min = 1000000000;
    /* tetras????????§input??\?????§????????§??????????????¢??? */
    while (tetras[j] <= input) j++;
    j--;
    int l = j; /* j ??????????????? */
    while (j > 0) {
      int n = 0;
      int k = j;
      while (input > 0) {
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j--;
      input = temp;
    }
    ans[a][0] = min;
    j = l; 
    min = 1000000000;
    while (j > 0) {
      if (tetras[j] % 2 == 0) {
	j--;
	continue;
      }
      int n = 0;
      int k = j;
      while (input > 0) {
	if (tetras[k] % 2 == 0) {
	  k--;
	  continue;
	}
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j--;
      input = temp;
    }
    ans[a][1] = min;
    a++;
  }

  for (b = 0; b < a; b++) {
    cout << ans[b][0] << ' ' << ans[b][1] << endl;
  }
  
  return 0;
}

C++: // AOJ1167      
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v) //vectorの中身を見る
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}

vector<int> simen;
vector<int> simen_odd;
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int max_n=pow(10,6);
    int i=1;
    int cur=i*(i+1)*(i+2)/6;
    while(cur<=max_n){
        simen.emplace_back(cur);
        if(cur%2==1) simen_odd.emplace_back(cur);
        i++;
        cur=i*(i+1)*(i+2)/6;
    }
    int n;
    int l=simen.size();
    int l_odd=simen_odd.size();
    int max_=pow(10,7);
    vector<int> dp1(max_n+10,max_);
    dp1[0]=0;
    for(int i=0;i<l;i++){ //もらうDP
        for(int j=1;j<=max_n;j++){
            if(0<=j-simen[i]) dp1[j]=min(dp1[j-simen[i]]+1,dp1[j]);
        }
    }
    vector<int> dp2(max_n+10,max_);
    dp2[0]=0;
    for(int i=0;i<l_odd;i++){
        for(int j=1;j<=max_n;j++){
            if(0<=j-simen_odd[i]) dp2[j]=min(dp2[j-simen_odd[i]]+1,dp2[j]);
        }
    }
    while(cin>>n){
        if(n==0) break;
        cout<<dp1[n]<<" "<<dp2[n]<<endl;
    }
    return 0;
}