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 <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++)

#define INF (1<<29)

int N;
int a[1010];

void make(){
  int n;
  for(n = 1; n <= 1000; n++) a[n] = n * (n+1) * (n+2) / 6;
}

int dfs1(int depth, int v, int cnt){ //cout << depth << ' ' << v << endl;
  int i, ret = INF;

  if(v == 0) return cnt;
  if(v < 0 || v < a[depth]) return INF;

  int K = (v / a[depth]) + 1;
  rep(i,K) ret = min(ret, dfs1(depth + 1, v - i*a[depth], cnt + i));

  return ret;
}

int dfs2(int depth, int v, int cnt){ //cout << depth << ' ' << v << endl;
  int i, ret = INF;

  if(v == 0) return cnt;
  if(v < 0 || v < a[depth]) return INF;
  if(a[depth] % 2 == 0) return dfs2(depth + 1, v, cnt);

  int K = (v / a[depth]) + 1;
  rep(i,K) ret = min(ret, dfs2(depth + 1, v - i*a[depth], cnt + i));

  return ret;
}

int main(){

  make();

  for(;;){
    scanf("%d",&N); if(N == 0) break;
//    int i; rep(i,10) cout << a[i] << endl;
    cout << dfs1(1,N,0) << ' ' << dfs2(1,N,0) << endl;
  }

  return 0;
}

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

using namespace std;

int n;

int dp[2][1000010], adp[2][1000010];
int INF = 1e9;

void solve() {
	for (int i=0; i<2; i++) {
		fill(dp[i], dp[i]+1000010, INF);
		fill(adp[i], adp[i]+1000010, INF);
	}
	
	dp[0][0] = 0;
	adp[0][0] = 0;
	for (int i=0; i<200; i++) {
		int nw = i%2, nx = (i+1)%2;
		int add = i * (i+1) * (i+2) / 6;
		if (add > n) break;
		for (int j=0; j<=n; j++) {
			if (add <= j) {
				dp[nx][j] = min(dp[nw][j], dp[nx][j-add] + 1);
			} else {
				dp[nx][j] = dp[nw][j];
			}
			
			if (add%2==0) {
				adp[nx][j] = adp[nw][j];
			} else {
				if (add <= j) {
					adp[nx][j] = min(adp[nw][j], adp[nx][j-add] + 1);
				} else {
					adp[nx][j] = adp[nw][j];
				}
			}
		}
	}
	
	int ans1 = INF, ans2 = INF;
	for (int i=0; i<2; i++) {
		ans1 = min(ans1, dp[i][n]);
		ans2 = min(ans2, adp[i][n]);
	}
	cout << ans1 << " " << ans2 << endl;
}

int main() {
	while (1) {
		cin >> n; if (n==0) break;
		solve();
	}
	
	return 0;
}

C++: #include <stdio.h>
#define INF 0x7FFFFFFF
 
int main(void){
    int i, j, n, min1,small;
    int dp[1000000];
    scanf("%d",&n);
    while(n != 0){
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(dp[i] < small){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
            if(small > dp[n])
                small = dp[n];
        }
 
        min1 = dp[n];
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(dp[i] < small){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1 && j * (j + 1) * (j + 2) / 6 % 2 == 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
            if(small > dp[n])
                small = dp[n];
        }
        printf("%d %d\n",min1,dp[n]);
        scanf("%d",&n);
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n,i,j,k,t=0,a[250]={},b[200]={},c[1000005]={1000000},d[1000005]={1000000};
  for(i=1;i<250;i++) {
    a[i-1]=i*(i+1)*(i+2)/6;
    if(a[i-1]%2==1)b[t++]=a[i-1];
  }
  for(i=c[0]=d[0]=0;i<250;i++) {
    for(j=a[i];j<1000005;j++){
      c[j]=min(c[j],c[j-a[i]]+1);
    }
  }
  for(i=0;i<t;i++) {
    for(j=b[i];j<1000005;j++){
      d[j]=min(d[j],d[j-b[i]]+1);
    }
  }
  while(cin>>n,n)cout<<c[n]<<" "<<b[n]<<endl;
return 0;
}