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 <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) {
	memset(dp, 0, sizeof(dp));

	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;
		}
	}

	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++)
			dp[i%2][j] = 0;
		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;
		}
	}

	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;
}

C++: #include <iostream>

using namespace std;

int p(int i){
  return i * (i + 1) * (i + 2) / 6;
}


int main(void){

  /* ???????¨??????? */
      int ans1[100001];
      int ans2[100001];
      for(int i = 1 ; i < 100001 ; i++){
        ans1[i+1] = -1;
        ans2[i+1] = -1;
      }

      for(int i = 1 ; p(i) < 100001 ; i++){
        ans1[p(i)] = 1;
        if(p(i) % 2 == 1){ ans2[p(i)] = 1; }
      }

      for(int i = 2 ; i <= 100001 ; i++){
        if(ans1[i] == 1){
        }else{
          int min = 1000000;
          for(int j = 1 ; j < i ; j++){
            if(ans1[j] + ans1[i - j] < min){
              min = ans1[j] + ans1[i - j];
            }
          }
          ans1[i] = min;
        }
      }

      for(int i = 2 ; i <= 100001 ; i++){
        if(ans2[i] == 1){
        }else{
          int min = 1000000;
          for(int j = 1 ; j < i ; j++){
            if(ans2[j] + ans2[i - j] < min){
              min = ans2[j] + ans2[i - j];
            }
          }
          ans2[i] = min;
        }
      }

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

    cout << ans1[n] << " " << ans2[n] << endl;
  }
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <stdlib.h>
using namespace std;
int main(){
	int *a=new int[1000000];
	int *b=new int[1000000];
	for(int i=0;i<1000000;i++){
		a[i]=100000;
		b[i]=100000;
	}
	for(int i=1;i<pow(6000000,0.333334)+5;i++){
		if((i*(i+1)*(i+2))/6<1000000){
			int aa=(i*(i+1)*(i+2))/6;
			a[aa]=1;
		}
	}
	a[0]=0;
	a[2]=2;
	a[3]=3;
	for(int i=4;i<1000000;i++){
		if(a[i]==1){
			for(int j=1;j<=5;j++){
				for(int k=0;k<i;k++){
					if(j*i+k<1000000){
						a[j*i+k]=min(a[j*i+k],j+a[k]);
					}
				}
			}
		}
	}
	for(int i=0;i<pow(6000000,0.333334)/4+5;i++){
		if(((4*i+1)*(4*i+2)*(4*i+3))/6<1000000){
			int bb=((4*i+1)*(4*i+2)*(4*i+3))/6;
			b[bb]=1;
		}
	}
	b[0]=0;
	for(int i=2;i<35;i++){
		b[i]=i;
	}
	for(int i=4;i<1000000;i++){
		if(b[i]==1){
			for(int j=1;j<=20;j++){
				for(int k=0;k<i;k++){
					if(j*i+k<1000000){
						b[j*i+k]=min(b[j*i+k],j+b[k]);
					}
				}
			}
		}
	}
	int n;
	while(cin>>n){
		if(n==0) break;
		cout<<a[n]<<" "<<b[n]<<endl;
	}
    return 0;
    delete[] a;
    delete[] b;
}

C++: #include <iostream>
#include <vector>
using namespace std;
int INF = 100000000;
int main(){
  int n, M = 1000000;
  vector<int> T, T_odd, A(M,INF), odd(M,INF);
  int t = 1, k = 3;
  A[0] = 0;
  odd[0] = 0;
  T.push_back(1);
  T_odd.push_back(1);
  while(t < 1000000){
    T.push_back(t);
    if (t%2) T_odd.push_back(t);
    ++k;
    t *= k;
    t /= (k-3);
  }
  odd.push_back(M);
  for(int i = 0; i < T.size(); ++i){
    for(int j = 1; j <= 5; ++j){
      for(int k = 0; k+T[i]*j < M; ++k){
	A[k+T[i]*j] = min(A[k+T[i]*j],A[k]+j);
      }
    }
  }
  for(int i = 0; i < T_odd.size()-1; ++i){
    for(int j = 1; j < 10; ++j){
      for(int k = 0; k+T_odd[i]*j < M; ++k){
	odd[k+T_odd[i]*j] = min(odd[k+T_odd[i]*j],odd[k]+j);
      }
    }
  }
  while(cin >> n, n){
    cout << A[n] << " " << odd[n] << endl;
  }
  return 0;
}