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>
#include <vector>

using namespace std;

namespace Solver {

    int N;
    vector<int> m1, m2;
    inline bool Read() {
        cin >> N;
        return N != 0;
    }

    inline void PreWork() {
        m1.resize(1000000, 1000000);
        m2.resize(1000000, 1000000);
        m1[0] = m2[0] = 0;
        for (int i = 1; i < 1000000; i++) {
            for (int j = 0;; j++) {
                int vol = vol = ((j * (j + 1) * (j + 2)) / 6);
                if (i < vol) break;
                m1[i] = min(m1[i], m1[i - vol] + 1);
                if (vol % 2 == 1) {
                    m2[i] = min(m2[i], m2[i - vol] + 1);
                }
            }
        }
    }

    inline void Work() {
        cout << m1[N] << " " << m2[N] << endl;
    }

    inline void Solve() {
        PreWork();
        while (Read()) Work();
    }
}

int main() {
    Solver::Solve();
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

typedef vector<int> vi;

#define PB push_back

const int inf = 1e9;

int dp[1000000], dp_odd[1000000];

int main()
{
	vi tet;

	for (int i = 1; ; ++i) {
		tet.PB(i * (i + 1) * (i + 2) / 6);
		if (tet.back() > 1000000) break;
	}

	for (int i = 1; i < 1000000; ++i) dp[i] = dp_odd[i] = inf;

	for (int i = 0; i < tet.size(); ++i) {
		for (int j = tet[i]; j < 1000000; ++j) {
			dp[j] = min(dp[j], dp[j - tet[i]] + 1);
			if (tet[i] & 1) {
				dp_odd[j] = min(dp_odd[j], dp_odd[j - tet[i]] + 1);
			}
			if (j < tet[i]) break;
		}
	}

	int N;
	while (scanf("%d", &N), N) printf("%d %d\n", dp[N], dp_odd[N]);
}

C++: #include<cstdio>
#include<algorithm>
#include<vector>

using namespace std;

vector<long long int> list,oddlist;
int listcnt, oddlistcnt;

int oddrec(int target, int sum, int cnt) {
    int res=0xFFFF;
    if(cnt>100) return 0xFFFF;
    if(sum == target) return cnt;
    for(int i=oddlistcnt-1; 0<=i && res>cnt; i--) {
        if(sum+oddlist[i] > target) continue;
        res = min(res, oddrec(target, sum+oddlist[i], cnt+1));
    }
    return res;
}

int main(void) {
    for(long long int i=1; i*(i+1)*(i+2)/6<1e6; i++) {
        list.push_back(i*(i+1)*(i+2)/6);
        if(i*(i+1)*(i+2)/6 % 2)
            oddlist.push_back(i*(i+1)*(i+2)/6);
    }


    listcnt = list.size();
    oddlistcnt = oddlist.size();
    while(true) {
        int n;
        scanf("%d",&n);
        if(!n) break;

        int res=5, oddres=1000;
        for(int i=listcnt-1; 0<=i; i--) {
            if(list[i]>n) continue;
            if(list[i]==n){ res=1; break; }
            if(res<=2) continue;
            for(int j=listcnt-1; 0<=j; j--) {
                if(list[i] + list[j]>n) continue;
                if(list[i] + list[j]==n) res=2;
                if(res<=3) continue;
                for(int k=listcnt-1; 0<=k; k--) {
                    if(list[i] + list[j] + list[k]>n) continue;
                    if(list[i] + list[j] + list[k]==n) res=3;
                    if(res<=4) continue;
                    for(int l=listcnt-1; 0<=l; l--) {
                        if(list[i] + list[j] + list[k] + list[l]>n) continue;
                        if(list[i] + list[j] + list[k] + list[l]==n) res=4;
                        if(res<=4) break;
                    }
                }
            }
        }

        printf("%d %d\n",res,oddrec(n, 0, 0));
    }





    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1e9;
const int MOD = 1e9+7;

const int MINT = 1000000;
int dp[MINT]; // 正四面体の番号、正整数
int dpodd[MINT]; // 正四面体の番号、正整数

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n = 200;
    vector<int> a(n);
    rep(i, n) a[i] = (i+1)*(i+2)*(i+3)/6;

    rep(j, MINT) { dp[j]=INF; dpodd[j]=INF; }
    dp[0] = 0; dpodd[0] = 0;

    rep(i, n) {
        ll num = a[i];
        rep(j, MINT) {
            if (j>=num) dp[j] = min(dp[j-num]+1, dp[j]);
            else dp[j] = dp[j];
            if (num%2) {
                if (j>=num) dpodd[j] = min(dpodd[j-num]+1, dpodd[j]);
                else dpodd[j] = dpodd[j];
            } else {
                dpodd[j] = dpodd[j];
            }
        }
    }

    while (true) {
        int x; cin >> x;
        if (!x) break;
        cout << dp[x] << " " << dpodd[x] << endl;
    }
}