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>
#include <cstdio>
using namespace std;

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

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    /*for(int i=1;i<=x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)
	break;
      count++;
      if(tmp%2==1)
	count_ki++;
	}*/

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

    int dp[x+1];
    fill(dp,dp + x + 1,100000);
  

    /*for(int i=0;i<=x;i++)
      printf("dp[%d]=%d\n",i,dp[i]);
    */
    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);
  
    //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 <bits/stdc++.h>
using namespace std;

const int MAX = 1e6 + 10;
const int INF = 1e9;

int dp[2][MAX];

void solve(){
  vector<int> tetra;
  int v = 1, cnt = 2;
  while(v < MAX){
    tetra.push_back(v);
    v = cnt * (cnt+1) * (cnt+2) / 6;
    cnt++;
  }
  for(int i = 0 ; i < MAX ; i++) dp[0][i] = dp[1][i] = INF;
  
  dp[0][0] = dp[1][0] = 0;
  for(int v = 0 ; v <= MAX ; v++){  
    for(int i = 0 ; i < (int)tetra.size() ; i++){
      if(v + tetra[i] > MAX) continue;
      dp[0][v + tetra[i]] = min(dp[0][v+tetra[i]], dp[0][v] + 1);
      if(tetra[i] % 2) dp[1][v + tetra[i]] = min(dp[1][v+tetra[i]], dp[1][v] + 1);
    }
  }
}

int main(){
  solve();
  int N;
  while(cin >> N, N) cout << dp[0][N] << ' ' << dp[1][N] << endl;

  return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);

int dp[1000000] = {};
int dp_o[1000000] = {};
vector<int>n, n_o;
int DP(int num) {
	if (dp[num] != 0)return dp[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 0;
	while (1) {
		rec = min(DP(n[cnt]) + DP(num - n[cnt]), rec);
		cnt++;
		if (n[cnt] > num)break;
	}
	dp[num] = rec;
	return rec;

}
int DP_o(int num) {
	if (dp_o[num] != 0)return dp_o[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 0;
	while (1) {
		rec = min(DP_o(n_o[cnt]) + DP_o(num - n_o[cnt]), rec);
		cnt++;
		if (n_o[cnt] > num)break;
	}
	dp_o[num] = rec;
	return rec;

}

int main() {
	cin.sync_with_stdio(false);
	ll cnt1 = 0, cnt2 = 0;
	reps(i, 1, 1000000) {
		cnt1 += i;
		cnt2 += cnt1;
		if (cnt2 >= 1000000)break;
		dp[cnt2] = 1;
		n.push_back(cnt2);
		if (cnt2 % 2 == 1) {
			dp_o[cnt2] = 1;
			n_o.push_back(cnt2);
		}
	}
	while (1) {
		int Q;
		cin >> Q;
		if (Q == 0)break;
		cout << DP(Q) << " ";
		cout << DP_o(Q) << endl;
	}


	return 0;
}

C++: #include<iostream>
#include<vector>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int dp[2][1000001];
int v[1000];
int main()
{
	int n;
	for (int i = 0; i < 2; i++)
	{
		for (int j = 0; j <= 1000000; j++)
		{
			if (j == 0)dp[i][j] = 0;
			else dp[i][j] = 999999;
		}
	}
	for (int i = 1;;i++)
	{
		int k = i * (i + 1) * (i + 2) / 6;
		if (k > 1000000)break;
		v[i - 1] = k;
	}
	while (cin >> n && n != 0)
	{
		for (int i = 0; i <= 1000000; i++)
		{
			for (int j = 0;; j++)
			{
				if (i + v[j] > n)break;
				dp[0][i + v[j]] = min(dp[0][i + v[j]],dp[0][i] + 1);
			}
		}
		for (int i = 0; i <= 1000000; i++)
		{
			for (int j = 0;;j++)
			{
				if (v[j] % 2 == 0)continue;
				if (i + v[j] > n)break;
				dp[1][i + v[j]] = min(dp[1][i + v[j]], dp[1][i] + 1);
			}
		}
		cout << dp[0][n] << " " << dp[1][n] << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int a[200];
int b[200];
int pollock[1000001];
int oddpollock[1000001];
int n,count;

void f(){
	count=1;
	b[0]=1;
	a[0]=1;
	for(int i=1;i<200;i++){
		a[i]=a[i-1]*(i+3)/i;
		if(a[i]%2==1){
			b[count]=a[i];
			count++;
		}
	}
}

int main(){
	f();
	pollock[0]=oddpollock[0]=0;
	pollock[1]=oddpollock[1]=1;
	for(int i=2;i<1000000;i++){
		pollock[i]=pollock[i-1]+1;
		for(int j=1;i>=a[j];j++){
			if(pollock[i]>pollock[i-a[j]]+1)pollock[i]=pollock[i-a[j]]+1;
		}
	}
	for(int i=2;i<1000000;i++){
		oddpollock[i]=oddpollock[i-1]+1;
		for(int j=1;i>=b[j];j++){
			if(oddpollock[i]>oddpollock[i-b[j]]+1)oddpollock[i]=oddpollock[i-b[j]]+1;
		}
	}
	while(1){
		cin >>n;
		if(n==0)break;
		cout <<pollock[n] <<" " <<oddpollock[n] <<endl;
	}
}