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

using namespace std;

#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreach(itr,c) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

#define INF (1<<29)

int N;
int a[1010],dp[2][1000010];

void make(){
  int n;
  for(n = 1; n <= 1000; n++) a[n] = n * (n+1) * (n+2) / 6;
}

int main(){
  int i,j,k;

  make();

  rep(i,2) rep(j,1000010) dp[i][j] = INF;

  dp[0][0] = dp[1][0] = 0;
  for(i = 1; a[i] <= 1000000 && i < 1010; i++){
    for(j = 0; j <= 1000000; j++){
      if(j - a[i] >= 0) dp[0][j] = min(dp[0][j], dp[0][j - a[i]] + 1);
      if(a[i] % 2 == 1 && j - a[i] >= 0) dp[1][j] = min(dp[1][j], dp[1][j - a[i]] + 1);
    }
  }

  for(;;){
    scanf("%d",&N); if(N == 0) break;
    cout << dp[0][N] << ' ' << dp[1][N] << endl;
  }

  return 0;
}

C++: #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;

using ll = long long;

int main() {
    vector<int> v;
    for (int n = 1; n * (n + 1) * (n + 2) / 6 < 1e6; n++) v.push_back(n * (n + 1) * (n + 2) / 6);
    //rep(i, v.size()) cout << v[i] << " ";
    //cout << v.size() << "\n";
    // dp[i][j] i番目の正四面体数を使ってjを作る最小数
    // dp1[i][j] 奇数だけ使う場合
    int n = v.size(), idx = 0;
    vector<vector<int>> dp(2, vector<int>(1e6, 1e9)), dp1(2, vector<int>(1e6, 1e9));
    dp[0][0] = 0;
    dp1[0][0] = 0;
    rep(i, n) {
        rep(j, 1e6) {
            dp[(i + 1) % 2][j] = dp[i % 2][j];
            dp1[(i + 1) % 2][j] = dp1[i % 2][j];
            if (j >= v[i]) dp[(i + 1) % 2][j] = min(dp[i % 2][j], dp[(i + 1) % 2][j - v[i]] + 1);
            if (v[i] % 2) {
                if (j >= v[i]) dp1[(i + 1) % 2][j] = min(dp1[i % 2][j], dp1[(i + 1) % 2][j - v[i]] + 1);
            }
        }
    }
    int x;
    cin >> x;
    while (x != 0) {
        cout << dp[n % 2][x] << " " << dp1[n % 2][x] << "\n";
        cin >> x;
    }
}

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

using namespace std;

int main()
{
    vector<int> tri;
    vector<int> odd;
    constexpr int MAX = 1000000;
    for (int i = 1;; i++) {
        const int num = i * (i + 1) * (i + 2) / 6;
        if (num >= MAX) {
            break;
        }
        tri.push_back(num);
        if (num % 2 == 1) {
            odd.push_back(num);
        }
    }
    constexpr int INF = 1000000000;
    vector<int> num(MAX, INF);
    vector<int> oddnum(MAX, INF);
    num[0] = 0;
    oddnum[0] = 0;
    for (int i = 0; i < MAX; i++) {
        if (num[i] == INF) {
            continue;
        }
        for (const int p : tri) {
            if (i + p < MAX) {
                num[i + p] = min(num[i + p], num[i] + 1);
            }
        }
    }
    for (int i = 0; i < MAX; i++) {
        if (oddnum[i] == INF) {
            continue;
        }
        for (const int p : odd) {
            if (i + p < MAX) {
                oddnum[i + p] = min(oddnum[i + p], oddnum[i] + 1);
            }
        }
    }


    while (true) {
        int n;
        cin >> n;
        if (n == 0) {
            break;
        }
        cout << num[n] << " " << oddnum[n] << endl;
    }
    return 0;
}

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

int dp[1000001];

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

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

        int num = 0;
        for(int j = 1;(num = j * (j + 1) * (j + 2) / 6) <= n;j++) {
            for(int i = 0;i <= n;i++) {
                if(i - num >= 0) {
                    dp[i] = min(dp[i], dp[i - num] + 1);
                }
            }
        }

        cout << dp[n] << ' ';

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

        num = 0;
        int j = 0;
        while(num <= n) {
            do{
                j++;
                num = j * (j + 1) * (j + 2) / 6;
            } while(num % 2 != 1);
            //cout << num << endl;
            for(int i = 0;i <= n;i++) {
                if(i - num >= 0) {
                    dp[i] = min(dp[i], dp[i - num] + 1);
                }
                //cout << dp[i] << ' ';
            }
            //cout << endl;
        }

        cout << dp[n] << endl;
    }
}