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 "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	vvi dp(6,vi(100001,0));
	dp[0][0] = 1;
	REP(i, 5) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if ( k> 100001)break;
			REP(l, 100001 - k) {
				if (dp[i][l])dp[i + 1][l + k] = 1;
			}
		}
	}
	vvi dp2(1001, vi(100001, 0));
	REP(i, 1000) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if (k % 2 == 0)continue;
			if (k> 100001)break;
			REP(l, 100001 - k) {
				if (dp2[i][l])dp2[i + 1][l + k] = 1;
			}
		}
	}
	while (1) {
		int n;
		cin >> n;
		if (!n)break;
		REP(i, 5) {
			if (dp[i + 1][n]) {
				cout << i + 1;
				break;
			}
		}
		cout << " ";
		REP(i, 5) {
			if (dp2[i + 1][n]) {
				cout << i+1 << endl;
				break;
			}
		}
	}
	return 0;
}

C++: // -*- coding: utf-8 -*-
// Last-Updated : <2014/06/19 00:29:01 by samui>

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#define MP(a, b) make_pair(a, b)
#define X first
#define Y second
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); ++(i))
#define rer(i,l,n) for(int (i) = l; (i) <= (int)(n); ++(i))
#define reu(i,l,n) for(int (i) = l; (i) < (int)(n); ++(i))
template<typename T,typename U> inline void amin(T &x,U y){ if(y<x) x = y;}
template<typename T,typename U> inline void amax(T &x,U y){ if(x<y) x = y;}
template<typename TYPE,std::size_t SIZE>
std::size_t len(const TYPE (&array)[SIZE]){return SIZE;}


const int M = 1000000;

void refresh(std::vector<int>& arr,int x){
  rer(i,x,M){
    amin(arr[i],arr[i-x]+1);

  }
}
int main(int argc, char *argv[])
{
  std::vector<int> s(M+10);
  std::vector<int> all(M+10,10000000);
  std::vector<int> odd(M+10,10000000);
  all[0] = 0;
  odd[0] = 0;
  //odd[0] = 0;
  reu(i,1,M+100){
    int x = i*(i+1)*(i+2)/6;
    if(x > M) break;
    rer(j,x,M){
      amin(all[j],all[j-x]+1);
    }
    //refresh(all,x);
    if(x&1) refresh(odd,x);
  }
  int i;
  while(std::cin>>i){
    if(i == 0)
      break;
    std::cout<<all[i]<<" "<<odd[i]<<std::endl;

  }
  return 0;
}

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

int main (){
  int dp1[1000001];
  int dp2[1000001];
  vector<int> shi;
  vector<int> shiki;

  for(int j=0;j<=1000000;j++) dp1[j] = dp2[j] = j;
    
  for(int i=1;i*(i+1)*(i+2)/6<=1000000;i++){
    shi.push_back(i*(i+1)*(i+2)/6);
    if(shi[i-1]%2 == 1) shiki.push_back(shi[i-1]);
  }

  for(int i=0;i<shi.size();i++)
    for(int j=1;j<=1000000;j++)
      if(j>=shi[i]) dp1[j] = min(dp1[j],dp1[j-shi[i]]+1);

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


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

C++: #include <bits/stdc++.h>
#define MAX 1000000
#define INF 1000000000
using namespace std;

int main()
{
	vector<int> dp(MAX, INF), res(MAX, INF), four, odd;
	for (int i = 1; i * (i + 1) * (i + 2) / 6 < MAX; i++) {
		four.push_back(i * (i + 1) * (i + 2) / 6);
		dp[i * (i + 1) * (i + 2) / 6] = 1;
		if (i * (i + 1) * (i + 2) / 6 % 2) {
			odd.push_back(i * (i + 1) * (i + 2) / 6);
			res[i * (i + 1) * (i + 2) / 6] = 1;
		}
	}
	for (int i = 0; i < 4; i++) {
		for (int j = MAX - 1; j >= 0; j--) {
			if (dp[j] != INF) {
				for (int k = 0; k < four.size() && j + four[k] < MAX;k++) {
					dp[j + four[k]] = min(dp[j + four[k]], dp[j] + 1);
				}
			}
		}
	}
	int n;
	while (cin >> n, n) {
		cout << dp[n] << ' ';
		while (res[n] == INF) {
			for (int j = MAX - 1; j >= 0; j--) {
				if (res[j] != INF) {
					for (int k = 0; k < odd.size() && j + odd[k] < MAX; k++) {
						res[j + odd[k]] = min(res[j + odd[k]], res[j] + 1);
					}
				}
			}
		}
		cout << res[n] << endl;
	}
	return 0;
}