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<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int a[1001],ta[1001],tta[1001];
int dp[1000021];
const int INF=99999999;
int main(){
	a[1]=1,ta[1]=1,tta[1]=1;
	int cnt=1;
	for(int i=2;i<=1000;i++)a[i]=i+a[i-1];
	for(int i=2;i<=1000;i++){
	ta[i]=a[i]+ta[i-1];
	if(ta[i]%2==1)tta[++cnt]=ta[i];
	}
	int n;
	while(true){
	cin>>n;
	if(n==0)break;
	ta[1]=1;
	int am=0,bm=0;
	for(int i=0;i<200;i++)	{if(n<=ta[i]){am=ta[i];break;}}
	for(int i=0;i<100;i++){if(n<=tta[i]){bm=tta[i];break;}}
	fill(dp+1,dp+1000021,INF);
	for(int i=0;i<=am;i++){
		for(int j=1;j<=n;j++){
		if(j>=ta[i])dp[j]=min(dp[j],dp[j-ta[i]]+1);
		}
	}//endfor
	cout<<dp[n]<<" ";
	fill(dp+1,dp+1000021,INF);
	for(int i=0;i<=bm;i++){
		for(int j=1;j<=n;j++){
		if(j>=tta[i])dp[j]=min(dp[j],dp[j-tta[i]]+1);
		}
	}//endfor
	cout<<dp[n]<<endl;
	}//endwhile
	return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define INF (1<<25)
int N;
int pr[182];
int dp[1000002];
void init(){
  for(int i=0;i<=N;i++) dp[i]=INF;
}
int solve(int g){
  dp[0]=0;
  for(int i=0;i<=N;i++){
    if(dp[i]==INF) continue;
    for(int j=0;i+pr[j]<=N;j++){
      if(g==2 && pr[j]%g==0) continue;
      dp[i+pr[j]] = min(dp[i+pr[j]],dp[i]+1);
    }
  }
  return dp[N];
}

int main(){
  for(int i=0;i<182;i++) pr[i] = (i+1)*(i+2)*(i+3)/6;
  //  for(int i=0;i<102;i++) printf("%d\n",pr[i]);
  //  for(int i=0;i<102;i++) if(!(i%2)) printf("%d\n",pr[i]);
  while(1){
    scanf("%d",&N);
    if(!N) break;
    init();
    int res1 = solve(1);
    init();
    int res2 = solve(2);
    printf("%d %d\n",res1,res2);
  }
}

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

using namespace std;

const int MAX_N = 1000000;

int main(){
	vector<int> tetrahedral, odd_tetrahedral;
	for(int i = 0; ; ++i){
		int y = i * (i + 1) * (i + 2) / 6;
		if(y > MAX_N){ break; }
		tetrahedral.push_back(y);
		if(y % 2 == 1){ odd_tetrahedral.push_back(y); }
	}
	vector<int> dp(MAX_N, -1), odd_dp(MAX_N, -1);
	dp[0] = odd_dp[0] = 0;
	for(int i = 0; i < MAX_N; ++i){
		for(int j = 0; j < tetrahedral.size(); ++j){
			int next = i + tetrahedral[j];
			if(next >= MAX_N){ break; }
			if(dp[next] < 0){
				dp[next] = dp[i] + 1;
			}else if(dp[next] > dp[i] + 1){
				dp[next] = dp[i] + 1;
			}
		}
		for(int j = 0; j < odd_tetrahedral.size(); ++j){
			int next = i + odd_tetrahedral[j];
			if(next >= MAX_N){ break; }
			if(odd_dp[next] < 0){
				odd_dp[next] = odd_dp[i] + 1;
			}else if(odd_dp[next] > odd_dp[i] + 1){
				odd_dp[next] = odd_dp[i] + 1;
			}
		}
	}
	while(true){
		int n;
		cin >> n;
		if(n == 0){ break; }
		cout << dp[n] << " " << odd_dp[n] << endl;
	}
	return 0;
}

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;
}