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 "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
/*
using ll = long long;
using P = pair<int, int>;
*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int INF = 1e9;

int a[205];
int dp[1000005];
int dp2[1000005];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> odd;
    rep(i,200){
        a[i] = i*(i+1)*(i+2)/6;
        if(a[i]%2 == 1) odd.push_back(a[i]);
    }
    rep(i,1000001){
        dp[i] = INF;
        dp2[i] = INF;
    }
    dp[0] = 0;
    dp2[0] = 0;
    rep(i,200)rep(j,1000001){
        if(j+a[i] > 1000000) break;
        chmin(dp[j+a[i]], dp[j]+1);
    }
    rep(i,odd.size())rep(j,1000001){
        if(j+odd[i] > 1000000) break;
        chmin(dp2[j+odd[i]], dp2[j]+1);
    }
    while(1){
        int n;
        cin >> n;
        if(n == 0) break;
        cout << dp[n] << " " << dp2[n] << endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lpin(a,i,n) for(int i=0;i<n;i++){cin>>a[i];}

void calc(int a[],int f){
  for(int i=f*(f+1)*(f+2)/6;i<=1000000;i++){
    if(a[i]==0) a[i]=a[i-f*(f+1)*(f+2)/6]+1;
    else if(a[i]>a[i-f*(f+1)*(f+2)/6]+1) a[i]=a[i-f*(f+1)*(f+2)/6]+1;
  }
}

int x[1000000],b[1000000];
int main(){
  for(int i=1;i*(i+1)*(i+2)/6<1000000;i++){
    calc(x,i);
  }
  for(int i=1;i*(i+1)*(i+2)/6<1000000;i++){
    if(i*(i+1)*(i+2)/6%2==1)
    calc(b,i);
  }
  while(1){
    int z;
    cin>>z;
    if(z==0) break;
    cout<<x[z]<<" "<<b[z]-3<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
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 ans_tmp=0;
    int ans2_tmp=0;

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<100000;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];
    
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    dp[0]=0;
    for(int i = 0;i<x;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);
	  //printf("dp[%d]=%d\n",i+coin[j],dp[i+coin[j]]);
	}
      }
    }


    int ans1=dp[x];

    int dp2[100000];
    
    for(int i=0;i<100000;i++)
      dp2[i]=100000;


    

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

    //for(int i=0;i<count;i++)
      //printf("coin[%d]=%d\n",i,coin[i]);
      //for(int i=0;i<count_ki;i++)
      //printf("coin_ki[%d]=%d\n",i,coin_ki[i]);


    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}

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

int i,j,n,three[1000000],four[1000000],four_2[1000000],c[1000000],c_2[1000000];

int main(){
  
  three[0] = 1;
  four[0] = 1;
  for( i = 1; i < 1000000; i++ )three[i] = i+1 + three[i-1];
  for( i = 1; i < 1000000; i++ )four[i] = three[i] + four[i-1];
  
  int k = 0;
  for( i = 0; i < 1000000; i++ ){
    if(four[i] %2 == 1 ){
      four_2[k] = four[i];
      k++;
    }
  }
  
  for( i = 0; i < 1000000; i++ ){
    c[i] = 2000000;
    c_2[i] = 2000000;
  }

  c[0] = 0;
  for( i = 0; i < 1000; i++ ){
    for( j = four[i]; j <= 1000000; j++ ){
      c[j] = min( c[j],c[j-four[i]] + 1 );
    }
  }

  c_2[0] = 0;
  for( i = 0; i < 1000; i++ ){
    for ( j = four_2[i]; j <= 1000000; j++ ){
      c_2[j] = min( c_2[j],c_2[j-four_2[i]] + 1 );
    }
  }
  
  while(1){
    int n; cin >> n;
    if(n==0)break;
   
    cout << c[n] << " " << c_2[n] << endl;
  }
  return 0;
}

C++: // 2013/06/29 Tazoe

#include <iostream>
using namespace std;

int main()
{
	int DP[1000000];
	int DP2[1000000];
	DP[0] = 0;
	DP2[0] = 0;
	for(int i=1; i<1000000; i++){
		DP[i] = 1000000;
		DP2[i] = 1000000;
	}

	for(int i=1; ; i++){
		int p = i*(i+1)*(i+2)/6;

		if(p>=1000000)
			break;

		DP[p] = 1;

		if(p%2==1){
			DP2[p] = 1;
		}
	}
/*
	for(int i=0; i<P.size(); i++){
		cout << P[i] << endl;
	}
*/
	for(int i=0; i<1000000; i++){
		if(DP[i]!=1)
			continue;

		for(int j=0; j+i<1000000; j++){
			if(DP[j]+1<DP[j+i]){
				DP[j+i] = DP[j]+1;
			}

			if(DP2[i]==1 && DP2[j]+1<DP2[j+i]){
				DP2[j+i] = DP2[j]+1;
			}
		}
	}

	while(true){
		int n;
		cin >> n;

		if(n==0)
			break;

		cout << DP[n] << ' ' << DP2[n] << endl;
	}

	return 0;
}