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;
    int n;
    int j = 0;
    int a[84];
    int b[22];
    int t[100010];
    for(i = 0; i < 83; i++){
        a[i] = (i+1)*(i+2)*(i+3)/6;
        if(a[i] % 2 == 1){
            b[j] = a[i];
            j++;
        }
    }
    /*for(i = 0; i < 83; i++){
        cout << "a[i] = " << a[i] << endl;
    }
    for(i = 0; i < 21; i++){
        cout << "b[i] = " << b[i] << endl;
    }*/
    while(1){
        cin >> n;
        if(n == 0){
            break;
        }
        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 82; i++){
            for(j = a[i]; j <= n; j++){
                if(t[j] > t[j - a[i]] + 1){
                    t[j] = t[j -a[i]] + 1;
                }
            }
        }
        cout << t[n] << " ";

        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 20; i++){
            for(j = b[i]; j <= n; j++){
                if(t[j] > t[j - b[i]] + 1){
                    t[j] = t[j - b[i]] + 1;
                }
            }
        }
        cout << t[n] << endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n) ; i++)
#define rrep(i,n) for(int i = n-1; i >= 0 ; i--)
constexpr auto INF = 2147483647;
typedef long long ll;

int tri(int a){
  return a*(a+1)/2*(a+2)/3;
};

static const int MAX = 1000005;

int main(){
  int x, max_n;
  int DP[MAX], DP_ODD[MAX], tri_list[200];
  vector<int> tri_list_odd;
  fill(DP, DP+MAX,INF);
  fill(DP_ODD,DP_ODD+MAX,INF);
  rep(i,200){
    tri_list[i] = tri(i+1);
    if(tri_list[i]%2 != 0) tri_list_odd.emplace_back(tri_list[i]);
  } 
  DP[0] = 0;
  DP_ODD[0] = 0;
  rep(i,200){
    for(int j = tri_list[i];j<MAX;j++){
      DP[j] = min(DP[j], DP[j-tri_list[i]]+1);
    }
  }
  rep(i,tri_list_odd.size()){
    for(int j = tri_list_odd[i];j<MAX;j++){
      DP_ODD[j] = min(DP_ODD[j],DP_ODD[j-tri_list_odd[i]]+1);
    }
  }

  while(true){
    cin >> x;
    if(x == 0)break;
    cout << DP[x] << " " << DP_ODD[x] << endl;
  }

  return 0;
}

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

int main(){
  int i,j,n,three[1000],four[1000],four_2[1000],c[1000],c_2[1000];

  three[0] = 1;
  four[0] = 1;
  for( i = 1; i < 1000; i++ )three[i] = i+1 + three[i-1];
  for( i = 1; i < 1000; i++ )four[i] = three[i] + four[i-1];
  
  int k = 0;
  for( i = 0; i < 1000; i++ ){
    if(four[i] %2 == 1 ){
      four_2[k] = four[i];
      k++;
    }
  }
  
  while(1){
    int n; cin >> n;
    if(n==0)break;
    for( i = 0; i <= n; i++ ){
      c[i] = 2000000;
      c_2[i] = 2000000;
    }

    c[0] = 0;
    for( i = 0; i*i < n; i++ ){
      for( j = four[i]; j <= n; j++ ){
	c[j] = min( c[j],c[j-four[i]] + 1 );
      }
    }

    c_2[0] = 0;
    for( i = 0; i*i < n; i++ ){
      for ( j = four_2[i]; j <= n; j++ ){
	c_2[j] = min( c_2[j],c_2[j-four_2[i]] + 1 );
      }
    }
    cout << c[n] << " " << c_2[n] << endl;
  }
    return 0;
}

C++: #include<cstdio>
#include<cstring>

#define MIN(X,Y) ((X)<(Y) ? (X) : (Y))

short tbl[2000000], otbl[2000000];

int main(void) {
    memset(tbl,0x7F, sizeof(tbl));
    memset(otbl,0x7F, sizeof(otbl));

    for(int i=1; i*(i+1)*(i+2)/6<1050000; i++)
        tbl[i*(i+1)*(i+2)/6] = 1;
    for(int i=1; i<1005000; i++)
        for(int j=1; i-j*(j+1)*(j+2)/6>=0; j++)
            tbl[i] = MIN(tbl[i], 1+tbl[i-j*(j+1)*(j+2)/6]);

    for(int i=1; i*(i+1)*(i+2)/6<1050000; i+=4)
        otbl[i*(i+1)*(i+2)/6] = 1;
    for(int i=1; i<1005000; i++)
        for(int j=1; i-j*(j+1)*(j+2)/6>=0; j+=4)
            otbl[i] = MIN(otbl[i], 1+otbl[i-j*(j+1)*(j+2)/6]);

    while(1) {
        int n;
        scanf("%d",&n);
        if(!n) break;
        printf("%d %d\n",tbl[n],otbl[n]);
    }
    return 0;
}

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

#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)

const int MAX = 1000000;

int dp[MAX + 1];
int dp2[MAX + 1];

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

int solve(int n)
{
  for(int i = 1; tetra(i) <= n; i++){
    if(tetra(i) & 1)
      dp2[tetra(i)] = 1;
    dp[tetra(i)] = 1;
  }
  for(int i = 1; i <= n; i++)
    for(int j = i; j <= n; j++)
      if(dp[j] == i || dp2[j] == i)
        for(int k = 1; j + tetra(k) <= n; k++){
          if((dp2[j] != MAX) && (tetra(k) & 1))
            dp2[j + tetra(k)] = min(i + 1, dp2[j + tetra(k)]);
          dp[j + tetra(k)] = min(i + 1, dp[j + tetra(k)]);
        }
}

int main()
{
  int n;
  while(1){
    cin >> n;
    if(n == 0){
      break;
    }else{
      fill(dp, dp + n + 1, MAX);
      fill(dp2, dp2 + n + 1, MAX);
      solve(n);
      cout << dp[n] << " " << dp2[n] << endl;
    }
  }
}