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,memo(1000005,999999),memo2(1000005,999999);
int a;
int main ()
{
	v.push_back(0);
	for(int i=1;i<=100;i++)
	{
		v.push_back(i*(i+1)*(i+2)/6);
	}
	memo[0]=memo2[0]=0;
	for(int i=0;i<=100000;i++)
	{
		for(int l=0;l<v.size();l++)
		{
			if(v[l]%2==1)memo2[i+v[l]]=min(memo2[i+v[l]],memo2[i]+1);
			memo[i+v[l]]=min(memo[i+v[l]],memo[i]+1);
		}
	}
	// for(int i=1;i<100;i++)cout<<memo[i]<<" "<<memo[i]<<endl;
	while(cin>>a&&a)
	{
		cout<<memo[a]<<" "<<memo2[a]<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<vector>
using namespace std;
typedef vector<int> vi;
vi ans,ans2;
const int inf=1e9;
int polnum[205];
int dp[1000005];
int odddp[1000005];
int ntet=0;
void ready()
{
  for(;;ntet++)
  {
    polnum[ntet]=ntet*(ntet+1)*(ntet+2)/6;
    if(polnum[ntet]>=1000000) break;
  }
  for(int i=0;i<=1000000;i++)
    {
      dp[i]=odddp[i]=inf;
    }
    dp[0]=odddp[0]=0;
}

int main()
{
  ready();
  int mx=0;
  for(int i=0;i<5;i++)
  {
    for(int j=0;j<=1000000;j++)
    {
      for(int k=0;k<ntet;k++)
      {
				if(j+polnum[k]>=1000000) break;
				if(polnum[k]%2==1) odddp[j+polnum[k]]=min(odddp[j+polnum[k]],odddp[j]+1);
				dp[j+polnum[k]]=min(dp[j+polnum[k]],dp[j]+1);
				mx=max(mx,j+polnum[k]);
				mx=min(mx,1000000-1);
      }
    }
  }
  int n;
  while(cin >> n,n) cout << dp[n]<<" " << odddp[n] << endl;
  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);
  
  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<vector>
using namespace std;
int x,y;
int m[1000005]={};
int memo[1000005]={};
vector<int> odd;
void saiki(int n,int d){
  int i,j;
  //cout << n << ":" << d << endl;
  if(n==0) {
    x=min(x,d);
  }else if(n>0) {
    for(i=1;m[i]<=n;i++);
    i--;
    //cout << i << ":" << n << ":" << m[i] << endl;
    for(j=i;j>0;j--){
      if(x>d+1){
	saiki(n-m[j],d+1);
      }
    }
  }
}
void saiki2(int n,int d){
  int i,j;
  //cout << n << ":" << d << endl;
  if(n==0) {
    y=min(y,d);
  }else if(n>0) {
    for(i=0;odd[i]<=n;i++);
    i--;
    //cout << i << ":" << n << ":" << odd[i] << endl;
    for(j=i;j>=0;j--){
      if(y>d+1){
	saiki2(n-odd[j],d+1);
      }
    }
  }
}
int main(){
  int i,j,k;
  for(i=1;i<1000005;i++) {
    m[i]=i*(i+1)*(i+2)/6;
    if(m[i]%2==1) odd.push_back(m[i]);
  }
  int n;
  cin >> n;
  while(n!=0){
    x=1<<10;y=x;
    saiki(n,0);saiki2(n,0);
    cout << x << " " <<  y << endl;
    cin >> n;
  }
  return 0;
}

C++: 
#include <iostream>

using namespace std;
#define MAX 1000000
#define INF 1000000000

int dp1[MAX + 1],dp2[MAX + 2];

int main(){
    for(int i = 1; i <= MAX; i++){
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1; n * (n + 1) * (n + 2) / 6 <= MAX; n++){
        int a = n * (n + 1) * (n + 2) / 6;
        for(int i = a; i <= MAX; i++){
            dp1[i] = min(dp1[i],dp1[i - a] + 1);
        }
        if(a % 2 == 0){
            continue;
        }
        for(int i = a; i <= MAX; i++){
            dp2[i] = min(dp2[i],dp2[i -a] + 1);
        }
    }

    while(true){
        int n;
        cin >> n;
        if(n == 0){
            break;
        }
        cout << dp1[n] << " " << dp2[n] << endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-11;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

const int M=1000000;
int dp[M],DP[M];

int main(){
	fill(dp+1,dp+M,inf);
	fill(DP+1,DP+M,inf);
	for(int i=1;i*(i+1)*(i+2)/6<=M;i++){
		int t=i*(i+1)*(i+2)/6;
		for(int j=t;j<M;j++) if(dp[j-t]!=inf) dp[j]=min(dp[j],dp[j-t]+1);
		if(t%2==1) for(int j=t;j<M;j++) if(DP[j-t]!=inf) DP[j]=min(DP[j],DP[j-t]+1);
	}
	while(1){
		int n;
		cin>>n;
		if(n==0) break;
		cout<<dp[n]<<' '<<DP[n]<<endl;
	}
}