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 <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
#define MAXN 1000000

typedef long long ll;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};

int dp[MAXN+1];
int dp2[MAXN+1];

int main(void) {
    for (int j = 0; j <= MAXN; j++) {
        dp[j] = INF;
        dp2[j] = INF;
    }
    dp[0] = 0; dp[1] = 1;
    dp2[0] = 0; dp2[1] = 1;
    // DP
    for (int i = 1; i < 200; i++) {
        int plus = i * (i+1) * (i+2) / 6;
        for (int j = 1; j <= MAXN; j++) {
            if (j - plus >= 0) dp[j] = min(dp[j], dp[j-plus] + 1);
            else dp[j] = dp[j];
        }
        if (plus % 2 == 1) {
            for (int j = 1; j <= MAXN; j++) {
                if (j - plus >= 0) dp2[j] = min(dp2[j], dp2[j-plus] + 1);
                else dp2[j] = dp2[j];
            }
        } else {
            for (int j = 1; j <= MAXN; j++) {
                dp2[j] = dp2[j];
            }
        }
    }
//    for (int i = 1; i < 5; i++) {
//        for (int j = 1; j <= 10; j++) {
//            cout << dp2[i][j] << " ";
//        }
//        cout << endl;
//    }
    int n;
    while (1) {
        cin >> n;
        if (n == 0) break;
        cout << dp[n] << " " << dp2[n] << endl;
    }
    return 0;
}

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

using namespace std;

int dp[1000001];
int dp2[1000001];
vector<int> vi;

void solve(){
	for(int i=1;i*(i+1)*(i+2)/6 <= 1000000;i++){
		vi.push_back(i*(i+1)*(i+2)/6);
	}
	fill(dp,dp+1000001,9999999);
	fill(dp2,dp2+1000001,9999999);
	
	dp[0] = 0;
	dp2[0] = 0;
	for(int i=0;i<1000000;i++){
		if(dp[i] != 9999999){
			for(int j=0;j<vi.size();j++){
				if(i+vi[j] <= 1000000){
					dp[i+vi[j]] = min(dp[i+vi[j]],dp[i]+1);
				}else{
					break;
				}
			}
		}
		if(dp2[i] != 9999999){
			for(int j=0;j<vi.size();j++){
				if(i+vi[j] <= 1000000 && vi[j]%2 == 1){
					dp2[i+vi[j]] = min(dp2[i+vi[j]],dp2[i]+1);
				}
			}
		}
	}
}

int main(){
	int n;
	solve();
	while(true){
		cin >> n;
		if(n==0){
			break;
		}

		cout << dp[n] << " " << dp2[n] << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

//#define int long long
using ll = long long;
using ld = long double;
using intpair = pair<int, int>;
const int MOD = 1e9 + 7;
inline int mod (ll a, int m = MOD) { return (a % m + m) % m; }
//struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define ceiv(a, b) ((ll)((a) + (b) - 1)/(ll)(b))

const int INF = 2e9;

bool chmin(int &a, int b){
    if(a > b){a = b; return true;}
    return false;
}

inline int tetrahedra(int n){
    return n*(n+1)/2*(n+2)/3;
}

signed main(){
    vector<int> tetra_table, tetra_odd;
    
    for(int i = 1; tetrahedra(i) <= 1000000; i++){
        int t = tetrahedra(i);
        tetra_table.emplace_back(t);
        if(t % 2){
            tetra_odd.emplace_back(t);
        }
    }
    
    int dp[1000001], dp_odd[1000001];
    
    for(int &i : dp)     i = INF;
    for(int &i : dp_odd) i = INF;
    dp[0] = dp_odd[0] = 0;
    
    for(int i : tetra_table){
        reps(j,i,1000000){
            chmin(dp[j], dp[j-i] + 1);
        }
    }
    
    for(int i : tetra_odd){
        reps(j,i,1000000){
            chmin(dp_odd[j], dp_odd[j-i] + 1);
        }
    }
    
    while(true){
        int n; cin >> n;
        if(n == 0) break;
        printf("%d %d\n", dp[n], dp_odd[n]);
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)

int A[1000];
int dp1[1000001];
int dp2[1000001];

int main() {
    A[0] = 0;
    A[1] = 1;
    REP2(i, 1, 200) A[i+1] = A[i] * (i+3) / i;

    dp1[0] = 0;
    dp1[1] = 1;
    REP2(i, 2, 1000001) dp1[i] = 1 << 29;
    REP2(i, 2, 1000001) REP(j, 200) {
        if (i < A[j]) break;
        dp1[i] = min(dp1[i], dp1[i-A[j]] + 1);
    }

    dp2[0] = 0;
    dp2[1] = 1;
    REP2(i, 2, 1000001) dp2[i] = 1 << 29;
    REP2(i, 2, 1000001) REP(j, 200) {
        if (i < A[j]) break;
        if (A[j] % 2 == 0) continue;
        dp2[i] = min(dp2[i], dp2[i-A[j]] + 1);
    }

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

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

using namespace std;

int f[1000000];

int main()
{
	int t_num[182];
	int t_num_odd[182];
	
	int k=0;
	for (int i=1;i<182;++i)
	{
		t_num[i-1] = i*(i+1)*(i+2)/6;
		if (t_num[i-1] % 2 == 1)
		{
			t_num_odd[k] = t_num[i-1];
			++k;
		}		
	}
	
	int n;
	cin >> n;
	
	while (n)
	{
		memset(f,1000001,sizeof(f));
		f[0] = 0;
		for (int i=1;i<=n;++i)
		{
			for (int j=0;j<181;++j)
			{
				if (i>=t_num[j]) f[i] = min(f[i],f[i-t_num[j]]+1);
			}
		}
		cout << f[n] << " ";
		
		memset(f,1000001,sizeof(f));
		f[0] = 0;
		for (int i=1;i<=n;++i)
		{
			for (int j=0;j<k;++j)
			{
				if (i>=t_num_odd[j]) f[i] = min(f[i],f[i-t_num_odd[j]]+1);
			}
		}
		cout << f[n] << endl;
		
		cin >> n;
		
		
	}
	return 0;
}