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>
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 = nums[j];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 = nums[j];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 <bits/stdc++.h>

using namespace std;

int all[1000001];
int odd[1000001];

int const INF = 1<<29;

int main() {
  
  fill(all, all+1000001, INF);
  fill(odd, odd+1000001, INF);
  
  all[0] = odd[0] = 0;
  
  for(int i=1; ; i++) {
    int n = i*(i+1)*(i+2);
    for(int j=n; j<=1000000; j++) {
      all[j] = min(all[j-n]+1, all[j]);
      if(n % 2) {
	odd[j] = min(odd[j-n]+1, odd[j]);
      }
    }
  }
  
  int N;
  while(cin >> N && N) {
    cout << all[N] << ' ' << odd[N] << endl;
  }
  
  return 0;
}

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 dps[190][1000010] = { 0 };
vector<vector<int>> dp;

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

void input(void) {
	CI N;

	return;
}


int main(void) {
	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++;
	}

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

		for(int i = 1; i <= N + 1; i++) {
			dp[0][i] = 1001000;
		}
		
		for (int j = 1; j <= C_N; j++) {
			for (int i = 1; i <= N; 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);
				}
			}
		}

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

		for (int i = 1; i <= N; i++) {
			dp[0][i] = 1001000;
		}
		for (int i = 0; i < 50; i++) {
			if (Codd[i] > N) {
				C_N = i;
				break;
			}
		}
		for (int j = 1; j <= C_N; j++) {
			for (int i = 1; i <= N; i++) {
				if (i < Codd[j - 1]) {
					dp[j][i] = dp[j - 1][i];
				}
				else {
					dp[j][i] = min(dp[j - 1][i], dp[j][i - Codd[j - 1]] + 1);
				}
			}
		}

		CO dp[C_N][N] E

		dp.clear();
		dp.shrink_to_fit();
	}
	
	
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define rep(i, n) REP(i, 0, (n))
#define REP(i, a, n) for(int i=(a); i<(n); i++)

int main(){
	int N;
	int f[200];
	static int dp1[1000000], dp2[1000000];
	rep(i, 200) f[i] = i*(i+1)*(i+2)/6;
	dp1[0] = dp2[0] = 0;
	REP(i, 1, 1000000){
		dp1[i] = dp2[i] = i;
		for(int j=0; f[j]<=i; j++){
			dp1[i] = min(dp1[i], dp1[i-f[j]]+1);
			if(f[j]%2==1) dp2[i] = min(dp2[i], dp2[i-f[j]]+1);
		}
	}
	while(cin >> N, N)
		cout << dp1[N] << " " << dp2[N] << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
    vector<int> num(200), numodd;
    rep(i, 200) {
        num[i] = ((i + 1) * (i + 2) * (i + 3)) / 6;
        if (num[i] % 2) numodd.push_back(num[i]);
    }
    int len = (int)numodd.size();

    vector<int> dp1(1000001, 1e9);
    vector<int> dp2(1000001, 1e9);
    dp1[0] = 0;
    dp2[0] = 0;

    rep(i, 200) {
        repd(j, num[i], 1000001) {
            chmin(dp1[j], dp1[j - num[i]] + 1);
        }
    }

    rep(i, len) {
        repd(j, numodd[i], 1000001) {
            chmin(dp2[j], dp2[j - numodd[i]] + 1);
        }
    }


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