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>
using namespace std;
static const int MAX =1000000;
int Pollock[MAX];
int T[MAX];
static const int INF (1<<29);
int min(int n){
   /*
     Same as problem 17.1 in the book Algo and Data Struct
     http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_1_A

    */
    
    int i=1;
    Pollock[i]=1;
    while(Pollock[i]<=n){
	i++;
	Pollock[i]=(i*(i+1)*(i+2)/6);
    }
    // Pollock to i-1 th element is used
    int j,k;
    for(j=0;j<MAX;j++)T[j]=INF;
    T[0]=0;
    for(j=1;j<i;j++){
	for(k=Pollock[j];k<=n;k++){
	    T[k]=min(T[k],T[k - Pollock[j]]+1);

		}
    }
    //DP?????£???????°????
    
    
    return T[n];
}

int is_odd(int n){
    if (n % 2 == 1)return 1;
    return 0;
}

int cal_pollock(int i){
    return (i*(i+1)*(i+2)/6);
}
int odd(int n){
    int i=1;
    Pollock[i]=1;
    int j=1;
    while(cal_pollock(i)<=n){
	if(is_odd(cal_pollock(i))){
	    Pollock[j]=cal_pollock(i);
	    j++;
	}
	i++;
    }
    // Pollock to i-1 th element is used
    int k,l;
    for(l=0;l<MAX;l++)T[l]=INF;
    T[0]=0;
    for(l=1;l<j;l++){
	for(k=Pollock[l];k<=n;k++){
	    T[k]=min(T[k],T[k - Pollock[l]]+1);

		}
    }
    //DP?????£???????°????
    
    
    return T[n];
}

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

	cout << min(n) << " " << odd(n) << endl;
    }

    return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for(ll i = a; i < b; ++i)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int qx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int qy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

vector<ll> p;
vector<ll> o;
vector<ll> memo(1000001, INF);

ll cal(ll n) {
	if(memo[n] != INF) return memo[n];
	else {
		ll ans = INF;
		ll i = o.size() - 1;
		while(i >= 0) {
			if(n - o[i] > 0)
			ans = min(ans, 1 + cal(n - o[i]));
			--i;
		}
		return memo[n] = ans;
	}
}

int main(void) {

	for(ll i = 0; i * (i + 1) * (i + 2) / 6 <= 1000000; ++i) {
		p.pb(i * (i + 1) * (i + 2) / 6);
		if((i * (i + 1) * (i + 2) / 6) % 2 == 1) o.pb(i * (i + 1) * (i + 2) / 6);
	}
	vector<P> nf;
	vector<P> nb;
	REP(i, p.size()) {
		REP(j, p.size()) {
			if(p[i] + p[j] > 1000000) break;
			nf.pb(P(p[i] + p[j], (ll)(p[i] != 0) + (ll)(p[j] != 0)));
			REP(k, p.size()) {
				nb.pb(P(p[i] + p[j] + p[k], (ll)(p[i] != 0) + (ll)(p[j] != 0) + (ll)(p[k] != 0)));
			}
		}
	}
	sort(ALL(nb));
	memo[0] = 0;
	REP(i, o.size()) {
		memo[o[i]] = 1;
	}
	while(true) {
		ll n;
		cin>>n;
		if(n == 0) break;
		ll ans1 = INF, ans2 = INF;
		vector<P>::iterator ite1;
		vector<P>::iterator ite2;
		for(ll i = 0; i < nf.size(); ++i) {
			ite1 = lower_bound(ALL(nb), P(n - nf[i].first, -1));
			ite2 = upper_bound(ALL(nb), P(n - nf[i].first, INF));
			if(ite1 != nb.end() && ite2 - ite1 > 0) {
				ans1 = min(ans1, (*ite1).second + nf[i].second);
			}
		}
		ans2 = cal(n);
		cout<<ans1<<" "<<ans2<<endl;
	}
}

C++: #include<iostream>
#include<vector>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int dp[2][1000001];
int main()
{
	int n;
	for (int i = 0; i < 2; i++)
	{
		for (int j = 0; j <= 1000000; j++)
		{
			if (j == 0)dp[i][j] = 0;
			else dp[i][j] = 999999;
		}
	}
	while (cin >> n && n != 0)
	{
		vector<int> v;
		for (int i = 1;; i++)
		{
			int k = i * (i + 1) * (i + 2) / 6;
			if (k > n)break;
			v.push_back(k);
		}
		for (int i = 0; i <= 1000000; i++)
		{
			for (int j = 0; j < v.size(); j++)
			{
				if (i + v[j] > 1000000)break;
				dp[0][i + v[j]] = min(dp[0][i + v[j]],dp[0][i] + 1);
			}
		}

		for (int i = 0; i <= 1000000; i++)
		{
			for (int j = 0; j < v.size();j++)
			{
				if (v[j] % 2 == 0)continue;
				if (i + v[j] > 1000000)break;
				dp[1][i + v[j]] = min(dp[1][i + v[j]], dp[1][i] + 1);
			}
		}
		cout << dp[0][n] << " " << dp[1][n] << endl;
	}
	return 0;
}

C++: #include<stdio.h>
#include<algorithm>
using namespace std;
int b[200];
int dp1[1000001];
int dp2[1000001];
int main(){
    int a;
    for(int i=0;i<200;i++){
        b[i]=i*(i+1)*(i+2)/6;
    }
    for(int i=0;i<1000001;i++)dp1[i]=dp2[i]=99999999;
    dp1[0]=dp2[0]=0;
    for(int i=0;i<1000001;i++){
        for(int j=1;j<200;j++){
            if(i+b[j]<=1000000)dp1[i+b[j]]=min(dp1[i+b[j]],dp1[i]+1);
            if(b[j]%2&&i+b[j]<=1000000)dp2[i+b[j]]=min(dp2[i+b[j]],dp2[i]+1);
        }
    }
    while(scanf("%d",&a),a){
        printf("%d %d\n",dp1[a],dp2[a]);
    }
}