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++: // AOJ 1167
#include<iostream>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;

typedef long long int number;

const number NMAX = 1e6 + 8;

int dp[NMAX], odp[NMAX];

int main() {
  REP(i, NMAX) {
    dp[i] = odp[i] = i;
  }
  for (number i = 2; i * (i + 1) * (i + 2) / 6 < NMAX; i++) {
    int tetr = i * (i + 1) * (i + 2) / 6;
    int limit = min(NMAX, (i + 2) * (i + 3) * (i + 4) / 6 + 8);
    for (number j = tetr; j < limit; j++) {
      dp[j] = min(dp[j], dp[j - tetr] + 1);
    }

    if (tetr % 2 != 0) {
      int limit = min(NMAX, (i + 10) * (i + 11) * (i + 12) / 6 + 8);
      for (number j = tetr; j < limit; j++) {
        odp[j] = min(odp[j], odp[j -tetr] + 1);
      }
    }
  }

  int n;
  while (cin >> n and n) {
    cout << dp[n] << " " << odp[n] << endl;
  }
}

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

#define INF 1e7

using namespace std;

int main(){
	vector<int> t(1,0),t1(1,0);
	int c=1;
	while(t[c-1]<=(int)1e6){
		int temp;
		temp=c*(c+1)*(c+2)/6;
		t.push_back(temp);
		if(temp%2==1 ){
			t1.push_back(temp);
		}
		c++;
	}
	while(true){
		int n;
		cin >> n;
		if(n==0)break;
		
		int num,num1;
		num=distance(t.begin(),upper_bound(t.begin(),t.end(),n)-1);
		num1=distance(t1.begin(),upper_bound(t1.begin(),t1.end(),n)-1);

		vector<vector<int> > s(num+1,vector<int>(n+1,INF));
		vector<vector<int> > s1(num1+1,vector<int>(n+1,INF));
		
		for(int i=0;i<=n;i++){
			s[0][i]=0;
			s[0][i]=0;
			s[1][i]=i;
			s1[1][i]=i;
		}
		for(int i=0;i<=num;i++) s[i][0]=0;
		for(int i=0;i<=num1;i++) s1[i][0]=0;

		for(int i=2;i<=num;i++){
			for(int j=1;j<=n;j++){
				if(j-t[i]>=0){
					s[i][j]=min(s[i-1][j],s[i][j-t[i]]+1);
				}
				else s[i][j]=s[i-1][j];
			}
		}

		for(int i=2;i<=num1;i++){
			for(int j=1;j<=n;j++){
				if(j-t1[i]>=0){
					s1[i][j]=min(s1[i-1][j],s1[i][j-t1[i]]+1);
				}
				else s1[i][j]=s1[i-1][j];
			}
		}
		/*
		for(int i=0;i<s.size();i++){
			for(int j=0;j<s[i].size();j++){
				if(s[i][j]==INF) cout << "0";
				else cout << s[i][j];
				cout << " ";
			}
			cout << endl;
		}
		*/
		cout << s[num][n] << " " << s1[num1][n] << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>

using namespace std;

const int INF = 1 << 29;

vector<int> a;
vector<int> memo1(1000005, -1);
vector<int> memo2(1000005, -1);

int dfs1(int s)
{
	if(s == 0) return 0;

	if(memo1[s] != -1) {
		return memo1[s];
	}

	int res = INF;

	for(int i = a.size() - 1; i >= 0; --i) {
		if(s - a[i] >= 0) {
			res = min(res, dfs1(s - a[i]) + 1);
		}
	}

	return memo1[s] = res;
}

int dfs2(int s)
{
	if(s == 0) return 0;

	if(memo2[s] != -1) {
		return memo2[s];
	}

	int res = INF;

	for(int i = a.size() - 1; i >= 0; --i) {
		if(s - a[i] >= 0 && (a[i] & 1)) {
			res = min(res, dfs2(s - a[i]) + 1);
		}
	}

	return memo2[s] = res;
}

int main()
{
	int n;

	for(int i = 1; i * (i + 1) * (i + 2) / 6 < 1000004; ++i) {
		a.push_back(i * (i + 1) * (i + 2) / 6);
	}

	//cout << a.size() << endl;

	while(cin >> n, n) {
		cout << dfs1(n) << ' ' << dfs2(n) << endl;
	}
}