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<stdio.h>
#include<algorithm>
using namespace std;
int list[181],dp[999999],dq[999999];
int main(){
    for(int i=0;i<999999;i++){
        dp[i]=1000000;
        dq[i]=1000000;
    }
    for(int i=0;i<181;i++){
        list[i]=(i+1)*(i+2)*(i+3)/6;
        dp[list[i]-1]=1;
        if(list[i]%2==1) dq[list[i]-1]=1;
    }
    for(int i=0;i<999999;i++){
        for(int j=0;list[j]<=i;j++){
            dp[i]=min(dp[i],dp[i-list[j]]+1);
            if(list[j]%2==1) dq[i]=min(dq[i],dq[i-list[j]]+1);
        }
    }
    while(1){
        int n;
        scanf("%d",&n);
        if(n==0) return 0;
        printf("%d %d\n",dp[n-1],dq[n-1]);
    }
}

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

int main(void){
  
  int i, input, tetras[200] = {0}, ans[10000][2] = {{0}, {0}};
  int a = 0, b = 0; /* a, b ???ans??????????????????????????? */

  for (i = 1; i <= 180; i++) {
    tetras[i] = i * (i+1) * (i+2) / 6;
  }

  while (cin >> input) {
    if (input == 0) break;
    int temp = input;
    int j = 1, min = 1000000000;
    /* tetras????????§input??\?????§????????§??????????????¢??? */
    while (tetras[j] <= input) j++;
    j--;
    int l = j; /* j ??????????????? */
    while (j > 0) {
      int n = 0;
      int k = j;
      while (input > 0) {
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j--;
      input = temp;
    }
    ans[a][0] = min;
    j = l; 
    min = 1000000000;
    while (j > 0) {
      if (tetras[j] % 2 == 0) {
	j--;
	continue;
      }
      int n = 0;
      int k = j;
      while (input > 0) {
	if (tetras[k] % 2 == 0) {
	  k--;
	  continue;
	}
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j--;
      input = temp;
    }
    ans[a][1] = min;
    a++;
  }

  for (b = 0; b < a; b++) {
    cout << ans[b][0] << ' ' << ans[b][1] << endl;
  }
  
  return 0;
}

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

#define INF 1e9
#define rep(i,n) for(int i=0;i<n;i++)

int p[200],q[50],dp1[1000000],dp2[1000000],n;

int main(){
	rep(i,200)p[i]=(i+1)*(i+2)*(i+3)/6;
	rep(i,50)q[i]=(4*i+1)*(4*i+2)*(4*i+3)/6;
	for(int i=1;i<1e6;i++){
		dp1[i]=dp2[i]=INF;
		rep(j,200)if(p[j]<=i)dp1[i]=min(dp1[i],dp1[i-p[j]]+1);
		rep(j,50)if(q[j]<=i)dp2[i]=min(dp2[i],dp2[i-q[j]]+1);
	}
	while(cin>>n&&n){
		cout<<dp1[n]<<" "<<dp2[n]<<endl;
	}
}

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

#define INF 10000000

#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

int main(void){
	
	static int dp1[1000001],dp2[1000001],n,four[501];
	
	fill(four,four+501,0);
	fill(dp1,dp1+1000001,INF);
	fill(dp2,dp2+1000001,INF);
	
	rep(i,501)four[i]=i*(i+1)*(i+2)/6;
	
	dp1[0]=dp2[0]=0;
	
	for(int i=1;i<1000001;i++){
		for(int j=1;four[j]<=i;j++){
			dp1[i]=min(dp1[i],dp1[i-four[j]]+1);
			if(four[j]%2)dp2[i]=min(dp2[i],dp2[i-four[j]]+1);
		}
	}
	
	while(cin >> n,n)cout << dp1[n] << " " << dp2[n] << endl;
	
	
	return 0;
}

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

    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] << " ";
}
     return 0;
}

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

using namespace std;

typedef long long ll;

const int INF = 1 << 30;
const int SIZE = 300;
const int N = 1000000;
int p[SIZE+1];
int dp1[N+1], dp2[N+1];

void make_pollock (void )
{
	for (int i = 0; i <= SIZE; i++ ){
		ll ans = (ll)i*(i+1LL)*(i+2LL)/6LL;
		p[i] = (int)ans;
	} // end for
}

void make_dp (void )
{
	dp1[0] = 0;
	for (int i = 1; i <= SIZE; i++ ){
		int m = p[i];
		for (int j = m; j <= N; j++ ){
			if (dp1[j] > dp1[j - m] + 1 ){
				dp1[j] = dp1[j - m] + 1;
			} // end if
		} // end for
	} // end for

	dp2[0] = 0;
	for (int i = 1; i <= SIZE; i++ ){
		if (p[i] % 2 == 0 ) continue;
		int m = p[i];
		for (int j = m; j <= N; j++ ){
			if (dp2[j] > dp2[j - m] + 1 ){
				dp2[j] = dp2[j - m] + 1;
			} // end if
		} // end for
	} // end for	
}
	
int main()
{
	memset (p, 0, sizeof (p ) );
	fill (dp1, dp1+N+1, INF );
	fill (dp2, dp2+N+1, INF );

	make_pollock();
	make_dp ();

	int n;
	while (cin >> n && n ){
		cout << dp1[n] << ' ' << dp2[n] << endl;
	} // end while
	
	return 0;
}