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 <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define uniq(x) (x).erase(unique(all(x)),(x).end())

typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;
typedef std::priority_queue<int> IntPrioQueue; //Z->A
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z

const int MAX = 1000010;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const int MOD = 1000000007;

vector <int> sq, odsq;
int N, mn[MAX], od[MAX];

void solve(void){
    int n = 1;
    fill(mn, mn+MAX, INF);
    fill(od, od+MAX, INF);
    mn[0] = od[0] = 0;
    while(n*(n+1)*(n+2)/6<MAX) {
        sq.pb(n*(n+1)*(n+2)/6);
        mn[n*(n+1)*(n+2)/6] = 1;
        if (n*(n+1)*(n+2)/6%2) {
            odsq.pb(n*(n+1)*(n+2)/6);
            od[n*(n+1)*(n+2)/6] = 1;
        }
        n++;
    }
    Rep(1, MAX-1, k) {
        int mini = INF, miniod = INF;
        for (int q : sq) {
            if (q >= k) break;
            mini = min(mini, k/q + mn[k%q]);
        }
        for (int q : odsq) {
            if (q >= k) break;
            miniod = min(miniod, k/q + od[k%q]);
        }
        mn[k] = min(mini, mn[k]);
        od[k] = min(miniod, od[k]);
    }
    while (1) {
        scanf("%d\n", &N);
        if (N == 0) break;
        printf("%d %d\n", mn[N], od[N]);
    }
}

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

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(depth >= min_depth)
	{
		return;
	}
	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(depth >= min_odd_depth)
	{
		return;
	}
	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>
using namespace std;
const int R = 1000001;
int dp1[R],dp2[R],T[160];

void solve(void) {
    for (int i = 1; i < R; i++) dp1[i] = dp2[i] = R;
    for (int i = 1; i < 161; i++) T[i-1] = i*(i+1)*(i+2)/6;
    for (int i = 0; i < 160; i++) {
        int t = T[i];
        for (int j = t; j < R; j++) {
            if (dp1[j-t] < R) dp1[j] = min(dp1[j], dp1[j-t]+1);
            if (t%2 == 0) continue;
            if (dp2[j-t] < R) dp2[j] = min(dp2[j], dp2[j-t]+1);
        }
    }
}

int main(void){
    solve();
    while (1) {
        int N;
        cin >> N;
        if (N == 0) break;
        printf("%d %d\n",dp1[N],dp2[N]);
    }
    return 0;    
}

C++: #include<cstdio>
#include<algorithm>
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;
      dp[0][nxt] = min(dp[0][nxt],dp[0][j] + 1);
      if(val&1)dp[1][nxt] = min(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]);
}