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 <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define rep(i,x) for(int i=0;i<(x);++i)
#define rep1(i,x) for(int i=1;i<=(x);++i)
#define rrep(i,x) for(int i=(x)-1;i>=0;--i)
#define rrep1(i,x) for(int i=(x);i>=1;--i)
#define FOR(i,a,x) for(int i=(a);i<(x);++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

#define omajinai ios::sync_with_stdio(false);cin.tie(0)

template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>istream&operator>>(istream&is,vector<T>&vec){rep(i,vec.size())is>>vec[i];return is;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

int dp[1000001], dp_odd[1000001];

signed main()
{
    omajinai;

    vi tet, tet_odd;

    for (int i = 1; ; ++i) {
        tet.PB(i * (i + 1) * (i + 2) / 6);
        if (tet.back() >= 1000000) break;
    }

    for (int i = 0; i < tet.size(); ++i) {
        if (tet[i] & 1) tet_odd.PB(tet[i]);
    }

    for (int i = 1; i <= 1000000; ++i) dp[i] = dp_odd[i] = inf;

    for (int i = 1; i <= 1000000; ++i) {
        for (int j = 0; j < tet.size(); ++j) {
            if (i >= tet[j]) {
                dp[i] = min(dp[i], dp[i - tet[j]] + 1);
            }
            if (i < tet[j]) break;
        }

        for (int j = 0; j < tet_odd.size(); ++j) {
            if (i >= tet_odd[j]) {
                dp_odd[i] = min(dp_odd[i], dp_odd[i - tet_odd[j]] + 1);
            }
            if (i < tet_odd[j]) break;
        }
    }

    int N;
    while (cin >> N, N) cout << dp[N] << ' ' << dp_odd[N] << endl;
}

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++)
template<class T> void pp(T a, T b){ for(T i = a; i != b; ++i) cout << *i << ' '; cout << endl; }

#define INF (1<<29)

int N;
int d[200];
int dp[1000010][2];

void init(){
  int n;
  rep(n,200) d[n] = n * (n+1) * (n+2) / 6;
}


int main(){
  int i,j;

  init();

  // pp(d,d+200);

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

  dp[0][0] = dp[0][1] = 0;
  rep(i,1000010) for(j = 1; d[j] <= i+1; j++){
    if(i - d[j] >= 0){
      dp[i][0] = min(dp[i][0], dp[i-d[j]][0] + 1);
      if(d[j] % 2 == 1){
        dp[i][1] = min(dp[i][1], dp[i-d[j]][1] + 1);
      }
    }
  }


  while(1){
    scanf("%d",&N);
    if(N == 0) break;

    printf("%d %d\n",dp[N][0],dp[N][1]);
  }

  return 0;
}

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

using namespace std;

int N;
int dp[1000001], dpodd[1000001];

int main() {

	//前計算でdpテーブルを計算。8sもあるのでオーダーは怪しいけど大丈夫のはず
	for (int i = 1; i <= 1000000; i++)dp[i] = 1 << 29, dpodd[i] = 1 << 29;

	dp[0] = 0, dpodd[0] = 0;
	for (int i = 1;; i++) {
		int cur = i * (i + 1) * (i + 2) / 6;
		
		if (cur > 1000000)break;

		for (int j = cur; j <= 1000000; j++) {
			if (cur % 2 == 1) {

				dpodd[j] = min(dpodd[j], dpodd[j - cur] + 1);
			}

			dp[j] = min(dp[j], dp[j - cur] + 1);
		}

	}

	while (1) {
		cin >> N;
		if (N == 0)break;
		cout << dp[N] << " " << dpodd[N] << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

int main(){

  int a[200];
  int b[50];
  for(int i=0;i<200;i++)a[i]=i*(i+1)*(i+2)/6;
  for(int i=0;i<50;i++)b[i]=(4*i+1)*(4*i+2)*(4*i+3)/6;

  vector<int> dp1;
  dp1.assign(1500000,0);

  for(int i=0;i<1500000;i++)dp1[i]=i;
  for(int i=1;i<1500000;i++){
    for(int j=0;j<200;j++){
      if(i>=a[j])dp1[i]=min(dp1[i],dp1[i-a[j]]+1);
    }
  }

  vector<int> dp2;
  dp2.assign(1500000,0);
  for(int i=0;i<1500000;i++)dp2[i]=i;
  for(int i=0;i<1500000;i++){
    for(int j=0;j<50;j++){
      if(i>=b[j])dp2[i]=min(dp2[i],dp2[i-b[j]]+1);
    }
  }

  int n;
  cin >> n;
  while(n!=0){
    cout << dp1[n] <<" " << dp2[n] << endl;
    cin >> n;
  }


}