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>

using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define MP make_pair
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
#define fst first
#define snd second

#define INF 1000000

int t(int x) { return x*(x+1)*(x+2)/6; }

int dp[1000010];

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  Vi one, two, odd;
  for (int i = 1; t(i) <= 1000000; i++) {
    one.push_back(t(i));
    if (t(i)%2) odd.push_back(t(i));
  }

  for (int a : one) {
    for (int b : one) {
      two.push_back(a+b);
    }
  }
  sort(ALL(two));

  REP(i, 1000001) dp[i] = INF;
  dp[0] = 0;
  REP(i, 1000000) {
    for (int a : odd) {
      if (i+1-a < 0) break;
      dp[i+1] = min(dp[i+1-a]+1, dp[i+1]);
    }
  }  

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

    if (n == *lower_bound(ALL(one), n)) {
      cout << 1;
    } else if (n == *lower_bound(ALL(two), n)) {
      cout << 2;
    } else {
      bool flag = false;
      for (int a : one) {
	if (n - a == *lower_bound(ALL(two), n - a)) {
	  flag = true;
	  break;
	}
      }
      if (flag) {
	cout << 3;
      } else {
	for (int a : two) {
	  if (n - a == *lower_bound(ALL(two), n - a)) {
	    flag = true;
	    break;
	  }
	}
	cout << (flag ? 4 : 5);
      }
    }

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

  }    
  return 0;
}

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

using namespace std;

const int N=1000000;
const int INF=1<<30;

int main(){
  static int dp[N];
  static int dpo[N];
  fill(begin(dp),end(dp),INF);
  fill(begin(dpo),end(dpo),INF);
  dp[0]=dpo[0]=0;
  for(int i=0;;i++){
    int q=i*(i+1)*(i+2)/6;
    if(q>N)break;
    for(int j=q;j<N;j++){
      dp[j]=min(dp[j],dp[j-q]+1);
      if(q%2){
	dpo[j]=min(dpo[j],dpo[j-q]+1);
      }
    }
  }
  for(int n;cin>>n,n;){
    cout<<dp[n]<<' '<<dpo[n]<<endl;
  }
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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


int dp[190][1000010] = { 0 };
int dpodd[190][1000010] = { 0 };


long int N = 0;
long int C[191];
long int Codd[51];

void input(void) {
	CI N;

	return;
}


int main(void) {
	long int C_N;
	for (int i = 1; i <= 190;i++) {
		C[i - 1] = i * (i + 1) * (i + 2) / 6;
	}
	int ii = 1, jj = 0;
	while (true) {
		if (ii * (ii + 1) * (ii + 2) / 6 > 1000000) {
			break;
		}
		if ((ii * (ii + 1) * (ii + 2) / 6) % 2 == 1) {
			Codd[jj] = ii * (ii + 1) * (ii + 2) / 6;
			jj++;
		}
		ii++;
	}

	for (long int i = 1; i <= N; i++) {
		dp[0][i] = 1001000;
	}
	for (long int i = 1; i <= N; i++) {
		dpodd[0][i] = 1001000;
	}

	for (int j = 1; j <= 189; j++) {
		for ( long int i = 1; i <= 1000002; i++) {
			if (i < C[j - 1]) {
				dp[j][i] = dp[j - 1][i];
			}
			else {
				dp[j][i] = min(dp[j - 1][i], dp[j][i - C[j - 1]] + 1);
			}
		}
	}

	for (int j = 1; j <= 50; j++) {
		for ( long int i = 1; i <= 1000002; i++) {
			if (i < Codd[j - 1]) {
				dpodd[j][i] = dpodd[j - 1][i];
			}
			else {
				dpodd[j][i] = min(dpodd[j - 1][i], dpodd[j][i - Codd[j - 1]] + 1);
			}
		}
	}

	while (true) {
		input();
		if (N == 0) {
			break;
		}
		for (int i = 0; i < 190; i++) {
			if (C[i] > N) {
				C_N = i;
				break;
			}
		}
	

		

		CO dp[C_N][N] << " ";

		
		for (int i = 0; i < 50; i++) {
			if (Codd[i] > N) {
				C_N = i;
				break;
			}
		}
		

		CO dpodd[C_N][N] E
		
		
	}
	
	
	return 0;
}

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

int dp[1000001], dp2[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] = dp2[i] = 100002;
        dp[0] = dp2[0] = 0;

        for(int j = 1;nums[j] <= n;j++) {
            for(int i = nums[j];i <= n;i++) {
                if(dp[i] > dp[i - nums[j]] + 1) {
                    dp[i] = dp[i - nums[j]] + 1;
                }
            }
        }
        for(int j = 1;nums[j] <= n;j++) {
            for(int i = nums[j];i <= n;i++) {
                if(dp2[i] > dp2[i - nums[j]] + 1) {
                    if(nums[j] % 2 == 1) dp2[i] = dp2[i - nums[j]] + 1;
                }
            }
        }
        cout << dp[n] << ' ' << dp2[n] << endl;
    }
}