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 <fstream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <list>
#include <utility>
#include <cmath>
using namespace std;
vector<int> v;
short memo[1000000][100];
int a;
int dp(int now,int j)
{
	if(now>a||j>5)return 9999999;
	if(now==a)return j;
	if(memo[now][j]!=-1)return memo[now][j];
	int ans =9999999;
	for(int i=1;i<v.size();i++)
	{
		ans=min(ans,dp(now+v[i],j+1));
	}
	return memo[now][j]=ans;
}
int dp2(int now,int j)
{
	if(now>a)return 9999999;
	if(now==a)return j;
	if(memo[now][j]!=-1)return memo[now][j];
	int ans =9999999;
	for(int i=1;i<v.size();i+=2)
	{
		ans=min(ans,dp2(now+v[i],j+1));
	}
	return memo[now][j]=ans;
}
int main ()
{
	v.push_back(0);
	for(int i=1;i<1000;i++)
	{
		v.push_back(i*(i+1)*(i+2)/6);
	}

	while(cin>>a&&a)
	{
		memset(memo,-1,sizeof(memo));
		cout<<dp(0,0)<<" ";
		memset(memo,-1,sizeof(memo));
		cout<<dp2(0,0)<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <queue>
#include <algorithm>
using namespace std;

struct P{
  int sum;
  char k,n;
  P(){}
  P(int S,int K,int N){ sum=S;k=K;n=N; }
};

int a[200];

int main(){
  int n, ans1,ans2;
  queue<P> q;
  P p;

  for( int i=1;i<200 ; i++ )
    if( (a[i]=i*(i+1)*(i+2)/6)>1000000 )
      break;

  int size,n2;
  while( cin>>n && n ){

    ans1=0;
    while( !q.empty() ) q.pop();
    for( int i=1;i<200;i++ ){
      if( a[i]==n ){
	ans1=1; size=i+1;
	break;
      }
      if( a[i]<n ) q.push( P(a[i],i,1) );
      else{
	size=i; break;
      }
    }
    while( !ans1 ){
      p=q.front(); q.pop();
      n2=p.n+1;
      if( binary_search( a,a+size, n-p.sum ) ){
	ans1=n2; break;
      }
      for( int i=p.k,j;i<size;i++ ){
	j=p.sum+a[i];
	if( j>n ) break;
	q.push( P(j,i,n2) );
      }
    }

    ans2=0;
    while( !q.empty() ) q.pop();
    for( int i=1;i<size;i++ ){
      if( a[i]%2==1 ){
	if( a[i]==n ){ ans2=1; break; }
	q.push( P(a[i],i,1) );
      }
    }
    while( !ans2 ){
      p=q.front(); q.pop();
      n2=p.n+1;
      int mm=n-p.sum;
      if( mm%2==1 && binary_search( a,a+size,mm ) ){
	ans2=n2; break;
      }
      for( int i=p.k,j;i<size;i++ ){
	if( a[i]%2==1 ){
	  j=p.sum+a[i];
	  if( j>n ) break;
	  q.push( P(j,i,n2) );
	}
      }
    }
    
    cout << ans1 << " " << ans2 << endl;
  }
    
  return 0;
}

C++: #include <stdio.h>
#include <string.h>
#define INF 1000001

int main(void){
	int i, j, n ,c, small1, small2;
	int dp1[1000000],dp2[1000000];
	scanf("%d",&n);
	while(n != 0){
		for(i = 0;i <= n;i++)
			dp1[i] = dp2[i] = INF;
		dp1[0] = dp2[0] = 0;
		for(i = 0;i < n;i++){
			small1 = dp1[n];
			if(small1 > dp1[i] + 1 && dp1[i] != INF){
				for(j = 1,c = j * (j + 1) * (j + 2);c / 6 + i <= n;j++,c = j * (j + 1) * (j + 2)){
					if(dp1[c / 6 + i] > dp1[i] + 1 && dp1[i] != INF){
						dp1[c / 6 + i] = dp1[i] + 1;
					}
				}
			}
		}
		for(i = 0;i < n;i++){
			small2 = dp2[n];
			if(small2 > dp2[i] + 1 && dp2[i] != INF){
				for(j = 1,c = j * (j + 1) * (j + 2);c / 6 + i <= n;j++,c = j * (j + 1) * (j + 2)){
					if(dp2[c / 6 + i] > dp2[i] + 1 && (c / 6) % 2 == 1 && dp2[i] != INF)
						dp2[c / 6 + i] = dp2[i] + 1;
				}
			}
		}
		printf("%d %d\n",dp1[n],dp2[n]);
		scanf("%d",&n);
	}
	return 0;
}

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

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

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

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

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

	}

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

	}

	//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]]);
		}
		for (int j = 1; i > fourodd[j]; j++){
			odd[i] = min(odd[i], 1 + odd[i - fourodd[j]]);
		}

	}

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

	return 0;

}

C++: #include <iostream>
#include <vector>
using namespace std;
int INF = 100000000;
int main(){
  int n, M = 1000000;
  vector<int> A(M,INF), A_odd(M,INF);
  int t = 1, k = 3;
  A[0] = 0;
  A_odd[0] = 0;
  for(int i = 0; i < M; ++i){
    A[i] = i;
    A_odd[i] = i;
  }
  while(t < 1000000){
    for(int k = 0; k+t < M; ++k){
      A[k+t] = min(A[k]+1,A[k+t]);
      if(t%2) A_odd[k+t] = min(A_odd[k]+1,A_odd[k+t]);
    }
    ++k;
    t *= k;
    t /= (k-3);
  }
  while(cin >> n, n){
    cout << A[n] << " " << A_odd[n] << endl;
  }
  return 0;
}