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 D[182] = {} ; // 10^6 越え → 181
int dp_map[2][1000002] = {} ;

void t(){
	for( int i=1 ; i<182 ; i++ ){
		D[i] = i * (i+1) * (i+2) / 6 ;
	}
}

int cal_2( int x , int c ){
	if( x==0 ) return 0 ;
	else{
		//if( dp_map[0][x] != 0 ) return dp_map[0][x] ;
		//else 
		return x/D[c] + cal_2( x%D[c] , c-1 ) ;
	}
}

int cal( int m , int q ){
	int ans = m ;
	for( int j=q ; j>1 ; j-- ){
		ans = min( ans , cal_2( m , j ) ) ;
	}
	return ans ;
}

int cal_odd_2( int x , int c ){
	if( x==0 ) return 0 ;
	else{
		if( D[c]%2 == 0 ) return cal_odd_2( x , c-1 ) ;
		else{
			//if( dp_map[1][x] != 0 ) return dp_map[1][x] ;
			//else 
			return x/D[c] + cal_odd_2( x%D[c] , c-1 ) ;
		}
	}
}

int cal_odd( int m , int q ){
	int ans_2 = m ;
	for( int j=q ; j>1 ; j-- ){
		ans_2 = min( ans_2 , cal_odd_2( m , j ) ) ;
	}
	return ans_2 ;
}

void dp(){
	int p = 1 ;
	for( int i=1 ; i<=1000000 ; i++ ){
		if( p < 182 && i >= D[p] ) p++ ;
		dp_map[0][i] = cal(i,p) ;
		dp_map[1][i] = cal_odd(i,p) ;
	}
}

int main(){
	
	t() ;
	dp() ;
	
	int n ;
	
	while( cin >> n , n ){
		cout << dp_map[0][n] << ' ' ;
		cout << dp_map[1][n] << endl ;
	}
	
return 0 ;
}

C++: #include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int a[1001],ta[1001],tta[1001];
int dp[1000021],dp2[1000010];
const int INF=99999999;
int main(){
	a[1]=1,ta[1]=1,tta[1]=1;
	int cnt=1;
	for(int i=2;i<=1000;i++)a[i]=i+a[i-1];
	for(int i=2;i<=1000;i++){
	ta[i]=a[i]+ta[i-1];
	if(ta[i]%2==1)tta[++cnt]=ta[i];
	}

	fill(dp,dp+1000001,INF);
	fill(dp2,dp2+1000001,INF);
	dp[0]=0,dp2[0]=0;
	for(int i=1;i<=200;i++){
		for(int j=1;j<=1000000;j++){
		if(j>=ta[i])dp[j]=min(dp[j],dp[j-ta[i]]+1);
		}//
	}//endfor
	for(int i=1;i<=100;i++){
		for(int j=1;j<=1000000;j++){
		if(j>=tta[i])dp2[j]=min(dp2[j],dp2[j-tta[i]]+1);
		}
	}//endfor
	int n;
	while(true){
	cin>>n;
	if(n==0)break;
	cout<<dp[n]<<" "<<dp2[n]<<endl;
	}//endwhile
	return 0;
}

C++: #include<cstdio>
#include<algorithm>
#define N (int)1e6
using namespace std;

int main(){
  int n,tmp,dp[N],dp_odd[N];
  int plc[1000],num;

  for(int i=0;i<N;i++)dp[i] = dp_odd[i] = N+1;
  dp[0] = dp_odd[0] = 0;

  tmp = 1;
  for(num=1;;num++){
    plc[num] = tmp;
    tmp *= num+3; tmp /= num;
    if(tmp>=N)break;
  }
  
  for(int i=0;i<N;i++){
    for(int j=1;j<num;j++){
      if(i<plc[j])break;
      dp[i] = min(dp[i],dp[i-plc[j]]+1);
      if(plc[j]&1)dp_odd[i] = min(dp_odd[i],dp_odd[i-plc[j]]+1);
    }
  }

  while(scanf("%d",&n) && n)printf("%d %d\n",dp[n],dp_odd[n]);
}

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

long dp[1000000];

int main(){
    int N;
    dp[0] = 0;
    for(int i = 1;i < 1000000;i++){
            dp[i] = 1000000;
        }
    for(int i= 0;i < 1000;i++){
        long a = (i * (i + 1) * (i + 2)) / 6;
        for(int j = a;j < 1000000;j++){
            dp[j] = min(dp[j],dp[j - a] + 1);
        }
    }
    for(int i = 0;;i++){
        scanf("%d",&N);
        if(N == 0){
            break;
        }
        printf("%ld\n",dp[N]);
    }
    return 0;
}

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

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

const int MAX = 1000000;

int dp[MAX + 1];
int dp2[MAX + 1];

void solve()
{
  fill(dp, dp + MAX + 1, MAX);
  fill(dp2, dp2 + MAX + 1, MAX);
  dp[0] = dp2[0] = 0;
  vector<int> v;
  for(int i = 0; ; i++){
    int t = i * (i + 1) * (i + 2) / 6;
    if(t <= MAX)
      v.push_back(t);
    else
      break;
  }
  for(int i = 0; i <= MAX; i++){
    for(int j = 0; j < v.size(); j++){
      if(i + v[j] <= MAX){
        if(v[j] & 1)
          dp2[i + v[j]] = min(dp2[i + v[j]], dp2[i] + 1);
        dp[i + v[j]] = min(dp[i + v[j]], dp[i] + 1);
      }
    }
  }
}
    
int main()
{
  solve();
  while(1){
    int n;
    cin >> n;
    if(n == 0)
      break;
    cout << dp[n] << " " << dp2[n] << endl;
  }
}

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

using namespace std;

int f[1000001];

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 j=0;j<181;++j)
		{
			for (int i=t_num[j];i<=n;++i)
			{
				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 j=0;j<k;++j)
		{
			for (int i=t_num_odd[j];i<=n;++i)
			{
				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;
	
}