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

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }
    ////
    int dp[100000];
    //fill(dp,dp + x+1,100000);
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    /*dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count;j++){
	if(i+coin[j]<=x){
	  dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	}
      }
    }

    cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	}
      }
    }
   
    cout << dp[x] << endl;*/
  
    ///*/
  }
  return 0;
}

C++: #include <iostream>
#include <cmath>
#include <string.h>

using namespace std;

int f[1000000];

int main()
{
	int t_num[182];
	int t_num_odd[182];
	
	int k=0;
	for (int i=1;i<182;++i)
	{
		t_num[i-1] = i*(i+1)*(i+2)/6;
		if (t_num[i-1] % 2 == 1)
		{
			t_num_odd[k] = t_num[i-1];
			++k;
		}		
	}
	
	int n;
	cin >> n;
	
	while (n)
	{
		memset(f,1000001,sizeof(f));
		f[0] = 0;
		for (int i=1;i<=n;++i)
		{
			for (int j=0;j<181;++j)
			{
				if (i>=t_num[j]) f[i] = min(f[i],f[i-t_num[j]]+1);
			}
		}
		cout << f[n] << " ";
		
		memset(f,1000001,sizeof(f));
		f[0] = 0;
		for (int i=1;i<=n;++i)
		{
			for (int j=0;j<k;++j)
			{
				if (i>=t_num_odd[j]) f[i] = min(f[i],f[i-t_num_odd[j]]+1);
			}
		}
		cout << f[n] << endl;
		
		cin >> n;
		
		
	}
	return 0;
}

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

#define MAXNUM 1000001
#define MAX 100
using namespace std;

int all[MAXNUM], odd[MAXNUM], fourall[1000], fourodd[1000];


int main()
{
	int n;
	int counter = 0;

	//配列の初期化
	for (int i = 1; i < MAXNUM; i++){
		all[i] = MAX;
		odd[i] = MAX;

	}

	//1からMAXNUMまでの中に存在する正四面体数を洗い出す．
	int now = 0, four, allcounter = 1, oddcounter = 1;
	while (1){
		now++;
		four = now  *(now + 1)*(now + 2) / 6;
		if (four > MAXNUM * 2)
			break;
		all[four] = 1;
		fourall[allcounter++] = four;
		if (four % 2 == 1){
			odd[four] = 1;
			fourodd[oddcounter++] = four;
		}

	}
	//cout << "ok" << endl;
	//cout << allcounter << endl;

	//1からMAXNUMまで，配列を埋める.
	for (int i = 1; i < MAXNUM; i++){
		for (int j = 1; i > fourall[j]; j++){
			all[i] = min(all[i], 1 + all[i - fourall[j]]);
		}
		//cout << i << ":" << all[i] << endl;

		for (int j = 1; i > fourodd[j]; j++){
			odd[i] = min(odd[i], 1 + odd[i - fourodd[j]]);
		}

	}

	//cout << "aaa" << endl;


	//入力
	while (cin >> n, n)
		cout << all[n] << " " << odd[n] << endl;

	return 0;

}

C++: #include<iostream>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define MAX 1000000

int calc(int n) { return n*(n + 1)*(n + 2) / 6; }
int p[200];
int p1[200];
int dp[MAX] = { 0 };
int dp1[MAX] = { 0 };

int func(int n, int P[], int DP[])
{
	if (n <= 0)return MAX;
	if (DP[n] != 0)return DP[n];
	else
	{
		int min_t = MAX;
		int i = 0;
		while (1)
		{
			if (P[i] <= n && n <= P[i + 1])break;
			if (P[i] == 1004731)
			{
				i--;
				break;
			}
			i++;
		}
		for (int t = i; t>0; t--)
		{
			if (min_t > func(n - P[t], P, DP) + 1)
			{
				min_t = func(n - P[t], P, DP) + 1;
			}
		}
		DP[n] = min_t;
		return DP[n];
	}
}

int main()
{
	int index = 1;
	FOR(i, 1, 200)
	{
		int temp = calc(i);
		if (temp > 1004731)break;
		p[i] = temp;
		dp[p[i]] = 1;
		if (temp % 2 == 1)
		{
			p1[index] = temp;
			dp1[p1[index]] = 1;
			index++;
		}
	}
	while (1)
	{
		int N;
		cin >> N;
		if (N == 0)return 0;
		cout << func(N, p, dp) << " " << func(N, p1, dp1) << endl;
	}
}

C++: #include<iostream>
#include<vector>
using namespace std;
int x,y;
int m[1000005]={};
int memo[1000005]={};
vector<int> odd;
void saiki(int n,int d){
  int i,j;
  //cout << n << ":" << d << endl;
  if(n==0) {
    x=min(x,d);
  }else if(n>0) {
    for(i=1;m[i]<=n;i++);
    i--;
    //cout << i << ":" << n << ":" << m[i] << endl;
    for(j=i;j>0;j--){
      if(x>d+1){
	saiki(n-m[j],d+1);
      }
    }
  }
}
void saiki2(int n,int d){
  int i,j;
  //cout << n << ":" << d << endl;
  if(n==0) {
    y=min(y,d);
  }else if(n>0) {
    for(i=0;odd[i]<=n;i++);
    i--;
    //cout << i << ":" << n << ":" << odd[i] << endl;
    for(j=i;j>=0;j--){
      if(y>d+1){
	saiki2(n-odd[j],d+1);
      }
    }
  }
}
int main(){
  int i,j,k;
  for(i=1;i<1000005;i++) {
    m[i]=i*(i+1)*(i+2)/6;
    if(m[i]%2==1) odd.push_back(m[i]);
  }
  int n;
  cin >> n;
  while(n!=0){
    x=1<<10;y=x;
    saiki(n,0);saiki2(n,0);
    cout << x << " " <<  y << endl;
    cin >> n;
  }
  return 0;
}