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>
using namespace std;

#define for_(i,a,b) for(int i=(a);i<(b);++i)

int cnt1[1000100], cnt2[1000100];

int main() {
	vector< int > nums;
	
	int a = 2, c = 1, num = 1;
	
	while (num < 1000100) {
		nums.push_back(num);
		c += a;
		++a;
		num += c;
	}
	
	for_(j,0,(int)nums.size()) {
		cnt1[nums[j]] = 1;
		if (nums[j] % 2) cnt2[nums[j]] = 1;
	}
	
	for_(i,1,1000100) {
		for_(j,0,(int)nums.size()) {
			if (i - nums[j] <= 0) break;
			
			if (cnt1[i] == 0) cnt1[i] = cnt1[i - nums[j]] + 1;
			else cnt1[i] = min(cnt1[i], cnt1[i - nums[j]] + 1);
			
			if (nums[j] % 2) {
				if (cnt2[i] == 0) cnt2[i] = cnt2[i - nums[j]] + 1;
				else cnt2[i] = min(cnt2[i], cnt2[i - nums[j]] + 1);
			}
		}
	}
	
	int n;
	while (cin >> n, n) {
		cout << cnt1[n] << " " << cnt2[n] << endl;
	}
}

C++: #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (int)1e9 + 7;
const int MAX = (int)1e6 + 1;

int main() {
    // pre
    vector<int> tetras(1, 0);
    for (int i = 1; ; i++) {
        int t = [](int n){ return n * (n + 1) * (n + 2) / 6; }(i);
        if (t > 1e6) break;
        tetras.push_back(t);
    }
    // cout << tetras.size() << endl;  // 180

    // dp_all, dp_odd
    vector<int> dp_all(MAX, INF), dp_odd(MAX, INF);
    dp_all[0] = dp_odd[0] = 0;
    for (int cur : tetras) {
        for (int j = cur; j < MAX; j++) {
            dp_all[j] = min(dp_all[j], dp_all[j - cur] + 1);
            if (cur % 2) dp_odd[j] = min(dp_odd[j], dp_odd[j - cur] + 1);
        }
    }

    // post
    int n;
    while (cin >> n, n) {
        cout << dp_all[n] << " " << dp_odd[n] << endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
const int MAX=1e6+10;
using namespace std;
int main(){
    vector<int>precal;
    vector<int>dp(MAX,MAX);
    vector<bool>flag(MAX+10,false);
    int n;
    precal.push_back(0);
    dp[0]=0;
    for(int i=1;;i++){
        int cnt=((i)*(i+1)*(i+2))/6;
        if(cnt>MAX)break;
        precal.push_back(cnt);
        flag[cnt]=true;
    }
    for(int i=1; i<=MAX-9;i++){
        if(flag[i]){dp[i]=1; continue;}
        int index=(int)(upper_bound(precal.begin(),precal.end(),i)-precal.begin());
        for(int j=0; j<=index;j++)
            dp[i]=min(dp[i],dp[precal[j]]+dp[i-precal[j]]);
    }
    vector<int>oddcal;
    vector<int>odp(MAX,MAX);
    vector<bool>oddflag(MAX+10,false);
    oddcal.push_back(0);
    odp[0]=0;
    for(int i=1;;i++){
        int cnt=(i*(i+1)*(i+2))/6;
        if(cnt>MAX)break;
        if(!(cnt%2))continue;
        oddcal.push_back(cnt);
        oddflag[cnt]=true;
    }
    for(int i=1; i<=MAX-9;i++){
        if(oddflag[i]){odp[i]=1;continue;}
        int index=(int)(upper_bound(oddcal.begin(), oddcal.end(), i)-oddcal.begin());
        for(int j=0;j<=index;j++)
            odp[i]=min(odp[i],odp[oddcal[j]]+odp[i-oddcal[j]]);
        
    }
    while(cin>>n,n){
        cout<<dp[n]<<" "<<odp[n]<<endl;
    }
}

C++: #include <iostream>
using namespace std;
int main(void){
    long long i;
    int n;
    long long j = 0;
    int a[84];
    int b[22];
    long long t[1000010];
    for(i = 0; i < 83; i++){
        a[i] = (i+1)*(i+2)*(i+3)/6;
        if(a[i] % 2 == 1){
            b[j] = a[i];
            j++;
        }
    }
    //cout << a[82] << b[20] << endl;
    /*for(i = 0; i < 83; i++){
        cout << "a[i] = " << a[i] << endl;
    }
    for(i = 0; i < 21; i++){
        cout << "b[i] = " << b[i] << endl;
    }*/
    while(1){
        cin >> n;
        if(n == 0){
            break;
        }
        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 82; i++){
            for(j = a[i]; j <= n; j++){
                if(t[j] > t[j - a[i]] + 1){
                    t[j] = t[j -a[i]] + 1;
                }
            }
        }
        cout << t[n] << " ";

        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 20; i++){
            for(j = b[i]; j <= n; j++){
                if(t[j] > t[j - b[i]] + 1){
                    t[j] = t[j - b[i]] + 1;
                }
            }
        }
        cout << t[n] << endl;
    }
    return 0;
}

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

const int INF = 1 << 30;

int dp1[1010101], dp2[1010101];

void solve(int n) {
    for (int i = 1; i <= n; i++) {
        dp1[i] = INF;
        dp2[i] = INF;
    }
    dp1[0] = dp2[0] = 0;
    for (int i = 1; i < 202; i++) {
        int polloc = i * (i + 1) * (i + 2) / 6;
        if (polloc > n) break;
        for (int j = polloc; j <= n; j++) {
            dp1[j] = min(dp1[j], dp1[j - polloc] + 1);
        }
        if (polloc % 2) {
            for (int j = polloc; j <= n; j++) {
                dp2[j] = min(dp2[j], dp2[j - polloc] + 1);
            }
        }
    }
    cout << dp1[n] << ' ' << dp2[n] << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    while (true) {
        cin >> N;
        if (N == 0) break;
        solve(N);
    }
    return 0;
}