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 <iomanip>
#include <vector>
using namespace std;

const int inf = 1000000009;

int main() {
    vector<vector<int>> memo(85, vector<int>(1000000, inf));
    vector<vector<int>> odd_memo(85, vector<int>(1000000, inf));
    for (int i=0; i<1000000; i++) {
        memo[0][i] = 0;
        odd_memo[0][i] = 0;
    }

    for (int i=0; i<1000000; i++) {
        memo[1][i] = i;
        odd_memo[1][i] = i;
    }

    for (int l=2; l<(int)memo.size(); l++) {
        const int n = (l*(l+1)*(l+2))/6;
        for (int i=0; i<(int)memo[l].size(); i++) {
            if(i-n == 0) {
                memo[l][i] = 1;
            } else if(i-n > 0) {
                memo[l][i] = min(memo[l][i-n]+1, memo[l-1][i]);
            } else {
                memo[l][i] = memo[l-1][i];
            }

            if (l%2==1) {
                if(i-n == 0) {
                    odd_memo[l][i] = 1;
                } else if(i-n > 0) {
                    odd_memo[l][i] = min(odd_memo[l][i-n]+1, odd_memo[l-1][i]);
                } else {
                    odd_memo[l][i] = odd_memo[l-1][i];
                }
            } else {
                odd_memo[l][i] = odd_memo[l-1][i];
            }
        }
    }

    int n; 
    while (cin >> n, n!=0) {
        cout << memo[memo.size()-1][n] << " " << odd_memo[odd_memo.size()-1][n] << endl;
    }
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
  
using namespace std;

#define pi 3.141592653589793

int main()
{
	int result[1000010] = {};
	int odd_result[1000010] = {};
	fill(result, result + 1000000, 1000000);
	fill(odd_result, odd_result + 1000000, 1000000);
	int trangular_sum = 0, tetrahedral_sum = 0;
	result[0] = 0;
	odd_result[0] = 0;
	for(int i = 1; i < 1000001; i++){
		trangular_sum += i;
		tetrahedral_sum += trangular_sum;
		if(tetrahedral_sum > 1000000) break;
		// result[trangular_sum] = 1;
		result[tetrahedral_sum] = 1;
		if(tetrahedral_sum % 2 == 1) odd_result[tetrahedral_sum] = 1;
		for(int j = tetrahedral_sum + 1; j < 1000001; j++){
			result[j] = min(result[j], result[j - tetrahedral_sum] + 1);
			if(tetrahedral_sum % 2 == 1) odd_result[j] = min(odd_result[j], odd_result[j - tetrahedral_sum] + 1);
		}
	}
	int n;
	while(1){
		cin >> n;
		if(n == 0) break;
		cout << result[n] << " " << odd_result[n] << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define mp make_pair
#define i_i pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< i_i >
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; scanf("%lld", &x);
 
//int dxy[5] = {0, 1, 0, -1, 0};
// assign

vi tetra, odd_tetra;
vi table(1000001, INF), dp(1000001, INF);

void make_tetra();
void make_odd_tetra();


signed main()
{
    make_tetra();
    make_odd_tetra();

    Int(n);

    while (n) {
        cout << dp[n] << " " << table[n] << endl;
        cin >> n;
    }

    return 0;
}


void make_tetra()
{
    Rep(i, 181) {
        tetra.pb(i * (i + 1) * (i + 2) /6);
    }
    dp[0] = 0;
    Rep(x, 1000000) {
        int ret = INF;
        for (int i : tetra) {
            if (x < i) {
                break;
            } else {
                ret = min(ret, dp[x - i] + 1);
            }
        }
        dp[x] = ret;
    }
}

void make_odd_tetra()
{
    for (int i : tetra) {
        if (i % 2) {
            odd_tetra.pb(i);
            table[i] = 1;
        }
    }
    table[0] = 0;
    Rep(x, 1000000) {
        int ret = INF;
        for (int i : odd_tetra) {
            if (x < i) {
                break;
            } else {
                ret = min(ret, table[x - i] + 1);
            }
        }
        table[x] = ret;
    }
}

C++: #include <bits/stdc++.h>

using namespace std;
using ll = long long;
vector<ll> seis;
vector<ll> dp(1000000+1,190);
vector<ll> odp(1000000+1,190);

bool solve(){
    ll n;
    cin>>n;
    if(n==0)return false;

    cout<<dp[n]<<" "<<odp[n]<<"\n";
    return true;
}

int main() {
    ll t=1;
    ll n=1;
    while(t<=1000000) {
        t=n*(n+1)*(n+2)/6;
        seis.emplace_back(t);
        ++n;
    }

    dp[0]=0;
    for(int i = 1;i <= 1000000;++i) {
        dp[i]=i;
        for(int j = 0;j < 181;++j) {
            if(i<seis[j])break;

            dp[i]=min(dp[i],dp[i-seis[j]]+1);
        }
        //cerr<<dp[i]<<endl;
    }

    odp[0]=0;
    for(int i = 1;i <= 1000000;++i) {
        odp[i]=i;
        for(int j = 0;j < 181;++j) {
            if(i<seis[j])break;
            if(seis[j]%2==0)continue;

            odp[i]=min(odp[i],odp[i-seis[j]]+1);
        }
    }



    while(solve());
    return 0;
}