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;

const int MAX_NUM = 1000000;
const int INF = 1000000000;

int table[2][MAX_NUM];
int tet[2][1000];

int calc(int num,int m)
{
    if(table[m][num]!=INF) {
        return table[m][num];
    } else {
        for(int i=1; tet[m][i]<=num; i++) {
            table[m][num]=min(table[m][num],calc(num-tet[m][i],m)+1);
        }
        return table[m][num];
    }
}

int main()
{
    for(int i=0; i<MAX_NUM; i++) {
        table[0][i] = INF;
        table[1][i] = INF;
    }

    for(int i=1; i*(i+1)*(i+2)/6<MAX_NUM; i++) {
        int t=i*(i+1)*(i+2)/6;
        table[0][t] = 1;
        tet[0][i] = t;

        if(t%2 == 1) {
            table[1][t] = 1;
            tet[1][i] = t;
        }
    }

    int in;
    while(cin>>in && in!=0) {
        cout<<calc(in,0)<<" "<<calc(in,1)<<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 dp[190][1000010] = { 0 };
int dpodd[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++;
	}

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

	for (int j = 1; j <= 189; j++) {
		for (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 <= 189; j++) {
		for (int i = 1; i <= 1000002; 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);
			}
		}
	}

	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 dp[C_N][N] E
		
		
	}
	
	
	return 0;
}

C++: #include<iostream>
using namespace std;
#define MAX 1000000
main(){
    int T1[MAX], T2[MAX];
    for ( int i = 0; i < MAX; i++ ) T1[i] = T2[i] = i;
    int  n = 1;
    while(1){
	int i = n*(n+1)*(n+2)/6;
	if ( i >= MAX ) break;

	for ( int j = i; j < MAX; j++ ) T1[j] = min(T1[j], T1[j-i]+1);
	if ( i % 2 ){
	    for ( int j = i; j < MAX; j++ ) T2[j] = min(T2[j], T2[j-i]+1);
	}
	n++;
    }

    while(1){
	cin >> n;
	if ( n == 0 ) break;
	cout << T1[n] << " " << T2[n] << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<int ,P> P3;
typedef pair<P ,P> PP;
const ll MOD = ll(1e9+7);
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e6 + 5);
const double EPS = 1e-6;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rbegin(), (v).rend())
#define ALL(v) (v).begin(), (v).end()

int main() {
    vector<int> a, b;
    for(int i=1;i<200;i++){
        int x = i*(i+1)*(i+2)/6;
        a.push_back(x);
        if(x%2)b.push_back(x);
    }
    reverse(ALL(a));
    reverse(ALL(b));

    int dp1[MAX_N], dp2[MAX_N];
    fill(dp1,dp1+MAX_N,IINF);
    fill(dp2,dp2+MAX_N,IINF);
    dp1[0] = dp2[0] = 0;
    for(int i=1;i<MAX_N;i++){
        for(auto j : a){
            if(i >= j){
                dp1[i] = min(dp1[i], dp1[i-j]+1);
            }
        }
    }
    for(int i=1;i<MAX_N;i++){
        for(auto j : b){
            if(i >= j){
                dp2[i] = min(dp2[i], dp2[i-j]+1);
            }
        }
    }

    int n;
    while(cin >> n, n){
        cout << dp1[n] << " " << dp2[n] << endl;
    }
    return 0;
}

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

#define M 1000000
#define INF 10000000

#define min(a,b) (a<b?a:b)

int main() {
	int n;
	vector<int> fn, fno;
	static int dp[M+1], odp[M+1];
	for(int i=1; i<=100; ++i) {
		fn.push_back(i*(i+1)*(i+2)/6);
		if(fn[i-1]%2==1) fno.push_back(fn[i-1]);
	}
	for(int i=0; i<=M; ++i) dp[i] = odp[i] = INF;
	dp[0] = 0; dp[1] = 1; odp[0] = 0; odp[1] = 1;
	for(int i=2; i<=M; ++i) {
		for(int j=0; j<100; ++j) {
			if(i-fn[j]>=0) dp[i] = min(dp[i], dp[i-fn[j]]+1);
			else break;
		}
		for(int j=0; j<(signed)fno.size(); ++j) {
			if(i-fno[j]>=0) odp[i] = min(odp[i], odp[i-fno[j]]+1);
			else break;
		}
	}
	
	while(1) {
		cin >> n;
		if(!n) break;
		cout << dp[n] << " " << odp[n] << endl;
	}
	return 0;
}