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 <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int dp[1000001],Odp[1000001];
int Tn[200],OTn[200]; 

int main(){
    int count = 0;  //pollocks numberの生成
    for(int i = 1;i < 200;i++){
        Tn[i-1] = i * (i + 1) * (i + 2) / 6;
        if(Tn[i-1] % 2 == 1){
            OTn[count] = Tn[i-1];
            count++;
        }
    }
    int n = 1000000;

    //正四面体数の個数の最小値
    for(int j = 0;j <= n;j++)
        dp[j] = j;
    int k;
    for(int i = 0;i < 200;i++)
        for(int j = Tn[i];j <= 1000000;j++){
            if(j >= Tn[i])
                dp[j] = min(dp[j],dp[j-Tn[i]] + 1);
            k = i;
        }

    //奇数正四面体数の個数の最小値
    for(int j = 0;j <= n;j++)
        Odp[j] = j;
    int k1;
    for(int i = 0;i <= 200;i++)
        for(int j = OTn[i];j <= n;j++){
            if(j >= OTn[i])
                Odp[j] = min(Odp[j],Odp[j-OTn[i]] + 1);
            k1 = i;
        }
    while(cin >> n,n)
        cout << dp[n] << ' ' <<  Odp[n] << endl;


    return 0;
}

C++: #include<stdio.h>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <functional>
#include <stdio.h>
#include <array>
#include <algorithm>
#include <string>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <queue>
#include<iomanip>
#include<bitset>
#include<stack>
#include<set>
#include<limits>
#include <complex>
using namespace std;


vector<int>nums;
vector<int>oddnums;

vector<short>memo(1000001,-1);
vector<short>oddmemo(1000001,-1);

int getans(const int num,const int atime) {
	if (memo[num] != -1) {
		return memo[num];
	}
	else {
		if (num == 0)return memo[num] = 0;
		int ans = num;
		for (int i = 0; i <nums.size(); ++i) {
			int minusnum = nums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 10) {
				continue;
			}
			ans = min(ans, getans(num - minusnum, atime + 1)+1);
		}

		return memo[num] = ans;
	}
}
int getoddans(const int num, const int atime) {
	if (oddmemo[num] != -1) {
		return oddmemo[num];
	}
	else {
		if (num == 0)return oddmemo[num] = 0;
		int ans = num;
		for (int i = 0; i < oddnums.size(); ++i) {
			int minusnum = oddnums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 100) {
				continue;
			}
			ans = min(ans, getoddans(num - minusnum, atime + 1) + 1);
		}
		return oddmemo[num] = ans;
	}

}
int main() {
	for (int i = 1; i < 190; ++i) {
		nums.push_back(i*(i + 1)*(i + 2) / 6);
		if (((i*(i + 1)*(i + 2)) / 6) % 2) {

		
			oddnums.push_back((i*(i + 1)*(i + 2)) / 6);
		}
	}

	while (1) {
		int n; cin >> n;
		if (!n)break;
		int normalans = getans(n, 0);;
		int oddans = getoddans(n, 0);

		cout << normalans << " " << oddans << endl;
	}
	return 0;
}

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

using namespace std;

int main(void)
{
	int n;
	int i1,i2;
	int nn;
	int min;
	int num;
	int max;
	vector<int> v;
	
	

	max=0;

	while(1){
		cin >> n;
		if(n==0) break;
		if(max<n) max=n;
		v.push_back(n);
		
	}

	vector<int> pollock(max+1,0);
	vector<int> pollock2(max+1,0);
	vector<int> p;
	vector<int> p2;
	nn=1;
	num=(nn*(nn+1)*(nn+2))/6;

	for(i1=1;i1<=max;i1++){			

		if(i1==num) {
			if(i1%2==1){
				p.push_back(i1);
				p2.push_back(i1);
				nn++;
				num=(nn*(nn+1)*(nn+2))/6;
				pollock[i1]=1;
				pollock2[i1]=1;
			}
			else {
				nn++;
				num=(nn*(nn+1)*(nn+2))/6;
				p.push_back(i1);
				pollock[i1]=1;
				min=100000;
				for(i2=0;i2<p2.size();i2++){
					if((pollock2[i1-p2[i2]])<min){
						min=pollock2[i1-p2[i2]];
					}
				}
				pollock2[i1]=min+1;
			}
		}
		else {
			min=100000;
			for(i2=0;i2<p.size();i2++){
				if((pollock[i1-p[i2]])<min){
					min=pollock[i1-p[i2]];
				}
			}
			pollock[i1]=min+1;

			min=100000;
			for(i2=0;i2<p2.size();i2++){
				if((pollock2[i1-p2[i2]])<min){
					min=pollock2[i1-p2[i2]];
				}
			}
			pollock2[i1]=min+1;
		}
			//cout<<pollock[i1]<<" ";
	}

	for(i1=0;i1<v.size();i1++){

		cout << pollock[v[i1]] << " " << pollock2[v[i1]] << endl;
	}


	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
using namespace std;

void solution(int n)
{
    vector<int> num(n+1, -1);
    num[0] = 0;
    for(int i=1; ; ++i){
        int tmp = i*(i+1)*(i+2)/6;
        if(tmp > n)
            break;
        for(int j=0; j+tmp<=n; ++j){
            if(num[j] >= 0 && (num[j+tmp] == -1 || num[j]+1 < num[j+tmp])){
                num[j+tmp] = num[j]+1;
            }
        }
    }
    cout << num[n] << ' ';

    num.assign(n+1, -1);
    num[0] = 0;
    for(int i=1; ; ++i){
        int tmp = i*(i+1)*(i+2)/6;
        if(tmp > n)
            break;
        if(tmp % 2 == 0)
            continue;
        for(int j=0; j+tmp<=n; ++j){
            if(num[j] >= 0){
                num[j+tmp] = num[j]+1;
            }
        }
    }
    cout << num[n] << endl;
}

int main()
{
    for(;;){
        int n;
        cin >> n;
        if(n == 0)
            break;
        solution(n);
    }

    return 0;
}