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>
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;  /* input???0??§break */
    int temp = input; /* input??????????????? */
    int j = 1, min = 1000;
    /* tetras????????§input??\?????§????????§??????????????¢??? */
    while (tetras[j] <= input) j++;
    j--;
    int l = j; /* j ??????????????? */
      
    /* ?????????????????¢?????° */
    while (j > 0) {
        int n = 0;
        int k = j;
        while (input > 0) {
            /* tetras[k] > input???????£???°??? */
            if (tetras[k] > input) {
                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][0] = min;
      
    /* ?\???°?????£?????¢?????°?????? */
    j = l;  /* j??????????????? */
    min = 1000; /* min??????????????? */
    while (j > 0) {
        /* ??¶??°?????£?????¢?????°????£???°??? */
        if (tetras[j] % 2 == 0) {
            j--;
            continue;
        }
        int n = 0;
        int k = j;
        while (input > 0) {
            /* ??¶??°?????£?????¢?????°????£???°??? */
            if (tetras[k] % 2 == 0 || tetras[k] > input) {
                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++: #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
vector<int> pol;
vector<int> pol_odd;
int dp1[1000100],dp2[1000100];
int main()
{
	for(int i=0;i<=1000000;i++)dp1[i]=dp2[i]=INF;
	dp1[0]=dp2[0]=0;
	for(int i=1;;i++)
	{
		int k=i*(i+1)*(i+2)/6;
		if(k>1000000)break;
		pol.pb(k);
		if(k%2)pol_odd.pb(k);
	}
	for(int i=0;i<=1000000;i++)
	{
		for(int j=0;j<pol.size();j++)
		{
			if(i<pol[j])break;
			dp1[i]=min(dp1[i],dp1[i-pol[j]]+1);
		}
	}
	for(int i=0;i<=1000000;i++)
	{
		for(int j=0;j<pol_odd.size();j++)
		{
			if(i<pol_odd[j])break;
			dp2[i]=min(dp2[i],dp2[i-pol_odd[j]]+1);
		}
	}
	while(1)
	{
		int n;
		scanf("%d",&n);
		if(n==0)break;
		printf("%d %d\n",dp1[n],dp2[n]);
	}
	return 0;
}

C++: #include <iostream>
#define MAX 1000000
#define INF 1000000000
using namespace std;

int dp1[MAX+1],dp2[MAX+2];

int main(){
    //INFで初期化
    for(int i = 0;i <= MAX;i++){
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1;n * (n + 1) * (n * 2) /6 <= MAX;n++){
        int a = n * (n + 1) * (n + 2) / 6;  //ポロック数の生成
        for(int i = a;i <= MAX;i++)     //正四面体数の個数dp(a以下は必要ない)
            dp1[i] = min(dp1[i],dp1[i-a] + 1);  //更新しないor左側から更新する
        if(a % 2 == 0)continue;     //偶数の時は次のroopへ
        for(int i = a;i <= MAX;i++)     //奇数の正四面体数の個数dp(a以下は必要ない)
            dp2[i] = min(dp2[i],dp2[i-a] + 1);  //更新しないor左側から更新する
    }

    //入出力
    while(true){
        int n;
        cin >> n;
        if(n == 0)break;
        cout << dp1[n] << " " << dp2[n] << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)

const int MAX_N=1e6;
const int MAX_M=180;

int dp[MAX_N];
int dp2[MAX_N];

int main(){
	REP(i,MAX_N){
		dp[i]=dp2[i]=i;
	}
	FOR(i,2,MAX_M+1){
		int p=i*(i+1)*(i+2)/6;
		FOR(j,p,MAX_N){
			dp[j]=min(dp[j],dp[j-p]+1);
			if (p&1){
				dp2[j]=min(dp2[j],dp2[j-p]+1);
			}
		}
	}
	int N;
	do{
		scanf("%d",&N);
		if (N){
			printf("%d %d\n",dp[N],dp2[N]);
		}
	}while(N);
	return 0;
}