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>
#include <algorithm>
#include <vector>
#define N 105000
#define INFINITY 2000000000
using namespace std;
int dp[N][N],data[N];
vector<int> data2;
int DP(int);
int DP2(int);
int main(){
  int i,out,out2,n;
  data2.push_back(0);
  for(i=1;i<N;i++){
    data[i]=i*(i+1)*(i+2)/6;
    if(data[i]%2==1){
      data2.push_back(data[i]);
    }
  }
  while(1){
    cin >> n;
    if(n==0) break;
    out=DP(n);
    out2=DP2(n);
    cout << out << ' ' << out2 << endl;
  }
  return 0;
}
int DP(int n){
  int i,j,minret,s;
  for(i=1;i<N;i++){
    if(data[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}
int DP2(int n){
  int i,j,minret,s,len;
  len=data2.size();
  for(i=1;i<len;i++){
    if(data2[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data2[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data2[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}

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

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

int solve1(int n, int j)
{
  int c = 0, m = 1000000;
  for(int i = j; n >= 0; i--){
    while(n >= func(i)){
      c++;
      n -= func(i);
    }
    if(n == 0)
      break;
  }
  m = min(m, c);
  return m;
}

int solve2(int n, int j)
{
  int c = 0, m = 1000000;
  for(int i = j; n >= 0; i--){
    while(n >= func(i) && (func(i) & 1)){
      c++;
      n -= func(i);
    }
    if(n == 0)
      break;
  }
  m = min(m, c);
  return m;
} 


	
	


int main()
{
  int n;
  while(1){
    cin >> n;
    if(n == 0){
      break;
    }else{
      int m1, m2;
      m1 = m2 = 1000000;
      int k = 1;
      while(n >= func(k)) 
	k++;
      for(int i = k - 1; i >= 1; i--){
	m1 = min(m1, solve1(n, i));
	m2 = min(m2, solve2(n, i));
      }
      cout << m1 << " " << m2 << endl;
    }
  }
}

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

int si[200];
int dp_k[1000000];
int dp[1000000];

void mk(){
  for(int i=0;i<200;i++){
    si[i]=(i*(i+1)*(i+2))/6;
    if(si[i]>1000000){break;}
    dp[si[i]]=1;
    if(si[i]%2==1)
      dp_k[si[i]]=1;
  }
}

int main()
{
  int x,y;
  for(int i=0;i<200;i++)si[i]=1000000;
  for(int i=0;i<1000000;i++){dp[i]=100000;dp_k[i]=100000;}
  mk();
  
  
  dp[0]=0;
  dp_k[0]=0;
  for(int i=1;i<1000000;i++){
    for(int j=1;j<200;j++){
      if((i+si[j])<1000000){
	dp[i+si[j]]=min(dp[i+si[j]],dp[i]+1);
	if(si[j]%2==1)
	  dp_k[i+si[j]]=min(dp_k[i+si[j]],dp_k[i]+1);
      }
    }
  }
    


  for(;;){
    cin >> x;
    if(x==0)return 0;
    cout << dp[x] <<" "<<dp_k[x]<<endl;
    
  }
}

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

int dp[1000001];

int nums[200] = {0};

int main(){

    for(int i = 0;i < 200;i++) nums[i] = i * (i + 1) * (i + 2) / 6;

    int n;
    while(1){
        cin >> n;
        if(n == 0) break;

        for(int i = 0;i <= n;i++) dp[i] = 100002;
        dp[0] = 0;

        for(int j = 1;nums[j] <= n;j++) {
            for(int i = 0;i <= n;i++) {
                if(i - nums[j] >= 0) {
                    dp[i] = min(dp[i], dp[i - nums[j]] + 1);
                }
            }
        }

        cout << dp[n] << ' ';

        for(int i = 0;i <= n;i++) dp[i] = 100002;
        dp[0] = 0;

        int num = 0;
        int j = 0;
        for(int j = 1;nums[j] <= n;j++) {
            if(nums[j] % 2 != 1) continue;
            //cout << num << endl;
            for(int i = 0;i <= n;i++) {
                if(i - nums[j] >= 0) {
                    dp[i] = min(dp[i], dp[i - nums[j]] + 1);
                }
                //cout << dp[i] << ' ';
            }
            //cout << endl;
        }

        cout << dp[n] << endl;
    }
}

C++: #include <iostream>
#include <vector>
#include <cmath>
#include <cstring>

using namespace std;

int MAX;
vector<int> V;
vector<int> D;
int N;
int M;
bool dp[10][1000100] = {0};

void solve(int n) {
	int ans = 1;

	for (int i=0; V[i]<=n; i++)
		dp[0][V[i]] = 1;

	for (int i=1; i<5 && !dp[i-1][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++) {
			if (!dp[i-1][j]) continue;
			for (int k=0; j+V[k]<=n; k++)
				dp[i][j+V[k]] = 1;
			if (dp[i][n]) break;
		}
	}

	cout << ans << " ";

	memset(dp, 0, sizeof(dp));

	ans = 1;

	for (int i=0; D[i]<=n; i++)
		dp[0][D[i]] = 1;

	for (int i=1; i<=1000000 && !dp[1-i%2][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++) {
			if (!dp[1-i%2][j]) continue;
			for (int k=0; j+D[k]<=n; k++)
				dp[i%2][j+D[k]] = 1;
			if (dp[i%2][n]) break;
		}
	}

	cout << ans << endl;
}

int main() {
	MAX = (int)pow(10.0, 6);
	for (int i=1; i*(i+1)*(i+2)/6<=MAX; i++) {
		V.push_back(i*(i+1)*(i+2)/6);
		if ( V[i-1]%2==1 ) D.push_back(i*(i+1)*(i+2)/6);
	}
	N = (int)V.size();
	M = (int)D.size();

	int n;
	cin >> n;
	while (n!=0) { 
		solve(n);
		cin >> n;
	}
	return 0;
}