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"
 
#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
 
const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };
 
 
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(??´????????`)(??´????????`)(??´????????`)(??´????????`)(??´????????`)(??´????????`)///
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector < vector<bool> >dp(6, vector < bool>(1000001, 0));
    dp[0][0] = 1;
    REP(i, 5) {
        REP(j, INF) {
            int k = j*(j + 1)*(j + 2) / 6;
            if (k > 100001)break;
            REP(l, 100001 - k) {
                if (dp[i][l])dp[i + 1][l + k] = 1;
            }
        }
    }
    vector<vector<bool>> dp2(101, vector<bool>(1000001, 0));
    REP(i, 100) {
        REP(j, INF) {
            int k = j*(j + 1)*(j + 2) / 6;
            if (k % 2 == 0)continue;
            if (k > 100001)break;
            REP(l, 100001 - k) {
                if (dp2[i][l])dp2[i + 1][l + k] = 1;
            }
        }
    }
    while (1) {
        int n;
        cin >> n;
        if (!n)break;
        REP(i, 5) {
            if (dp[i + 1][n]) {
                cout << i + 1;
                break;
            }
        }
        cout << " ";
        REP(i, 100) {
            if (dp2[i + 1][n]) {
                cout << i + 1 << endl;
                break;
            }
        }
    }
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int x[9999999][2], a[999], b[999], s, n;
int main() {
	a[0] = 1; b[0] = 1;
	for (int i = 1; i < 300; i++) {
		a[i] = a[i - 1] + (i + 1)*(i + 2) / 2;
		if (a[i] % 2 == 1) {
			s++; b[s] = a[i];
		}
	}
	n = 1200000;
	memset(x, 127, sizeof(x));
	x[0][0] = 0; x[0][1] = 0;
	for (int i = 0; i < 200; i++) {
		for (int j = 0; j < n; j++) {
			x[j + a[i]][0] = min(x[j + a[i]][0], x[j][0] + 1);
		}
	}
	for (int i = 0; i < 50; i++) {
		for (int j = 0; j < n; j++) {
			x[j + b[i]][1] = min(x[j + b[i]][1], x[j][1] + 1);
		}
	}
	while (true) {
		cin >> n; if (!n) { break; }
		cout << x[n][0] << x[n][1] << endl;
	}
}

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][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 <bits/stdc++.h>
using namespace std;

const int MAX = int(1e6);

int dp[MAX + 1];
int odp[MAX + 1];

int main(void)
{
    int n;

    fill(dp, dp + MAX + 1, MAX);
    fill(odp, odp + MAX + 1, MAX);
    dp[0] = odp[0] = 0;
    for (int i = 0; i < 100; i++){
        int tetra = i * (i + 1) * (i + 2) / 6;
        for (int j = 0; j <= MAX - tetra; j++){
            dp[j + tetra] = min(dp[j + tetra], dp[j] + 1);
        }
        if (tetra % 2 == 1){
            for (int j = 0; j <= MAX - tetra; j++){
                odp[j + tetra] = min(odp[j + tetra], odp[j] + 1);
            }
        }
    }
    while (cin >> n, n){
        printf("%d %d\n", dp[n], odp[n]);
    }

    return 0;
}