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

using std::cout;
using std::cin;
using std::endl;
using std::vector;

vector<int> make_table(vector<int> v) {
    vector<int> dp(1000000, 0);
    dp[1] = 1;
    int j;
    int min;
    for (int i = 2; i < dp.size(); i++) {
        //std::cout << "HERE" << std::endl;
        //std::cout << "I = " << i << std::endl;
        j = 0;
        min = 1e09;
        //std::cout << i << ", " << v[j] << ", " << dp[v[j]] << endl;
        while (i >= v[j]) {
            if (min > dp[i - v[j]]) {
                min = dp[i - v[j]];
            }
            j++; 
        }
        dp[i] = min + 1;
        //std::cout << "DP" << i << " = " << dp[i] << std::endl;
        //std::cout << "-------------------------=" << endl;
    }
    return dp; 
}

int main(void) {
    vector<int> all;
    vector<int> odd;

    int tetra = 0;
    int times = 1;
    while (1) {
        tetra = times * (times + 1) * (times + 2) / 6;
        all.push_back(tetra);
        if (tetra % 2 == 1) {
            odd.push_back(tetra);
        }
        times++;
        if (tetra > 1000000) {
            break;
        }
    }
    vector<int> dp_all = make_table(all);
    vector<int> dp_odd = make_table(odd);
    int input;
    while (1) {
        cin >> input;
        if (input == 0) {
            break;
        }
        cout << dp_all[input] << " " << dp_odd[input] << endl;
    }

    return 0;
}

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

using namespace std;

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

int oddrec(int target, int sum, int cnt, int maxcnt) {
    int res=0xFFFF;
    if(maxcnt<cnt) return 0xFFFE;
    if(sum == target) return cnt;
    for(int i=oddlistcnt-1; 0<=i; i--) {
        if(sum+oddlist[i] > target) continue;
        res = min(res, oddrec(target, sum+oddlist[i], cnt+1, maxcnt));
        if(res==0xFFFE) break;
    }
    return res;
}
int ress;
void mama(int x){
    if(x==0) return;
    int tmp[oddlistcnt];
    memset(tmp,0,sizeof(tmp));
    for(int i=0;i<oddlistcnt;i++){
        tmp[i]=x/oddlist[i];
        if(tmp[i]==0) {
            ress+=tmp[i-1];
            mama(x%tmp[i-1]);
            break;
        }
    }
}


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

        /*        if((oddres=oddrec(n, 0, 0, 1))>=0xFFFE) {
                  for(int i=2; ; i=i*3/2) {
                  if((oddres=oddrec(n, 0, 0, i))<0xFFFE)
                  break;
                  }
                  }

                  printf("%d %d\n",res,oddres);

         * p    */
        ress=0;
        mama(n);
        printf("%d %d\n",res,ress);
    }





    return 0;
}

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

using namespace std;

int dp[1000001],dp2[1000001];

int main(void){

  vector<int>p;

  for(int i=1;i*(i+1)*(i+2)/6<1000001;i++){
    p.push_back(i*(i+1)*(i+2)/6);
  }

  fill(dp,dp+1000001,10000000);
  fill(dp2,dp2+1000001,10000000);
  dp[0]=dp2[0]=0;

  for(int i=0;i<1000001;i++){
    for(int j=0;j<p.size();j++){
      if(i-p[j]<0)break;
      dp[i]=min(dp[i],dp[i-p[j]]+1);
      if(p[j]%2==1)dp2[i]=min(dp2[i],dp2[i-p[j]]+1);
    }
  }

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


  return 0;
}