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

int main()
{
  static const int N = 1000000;

  vector<int> vs;
  for (int i = 1; ; i++) {
    const int x = i*(i+1)*(i+2)/6;
    if (x >= N) {
      break;
    }
    vs.push_back(x);
  }

  vector<int> dp(N, numeric_limits<int>::max()), dp_odd(N, numeric_limits<int>::max());
  dp[0] = dp_odd[0] = 0;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < vs.size(); j++) {
      if (i + vs[j] < N) {
        dp[i+vs[j]] = min(dp[i+vs[j]], dp[i]+1);
        if (vs[j] % 2 == 1) {
          dp_odd[i+vs[j]] = min(dp_odd[i+vs[j]], dp_odd[i]+1);
        }
      } else {
        break;
      }
    }
  }

  int n;
  while (cin >> n && n != 0) {
    cout << dp[n] << ' ' << dp_odd[n] << endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

typedef long long ll;


ll memo[250000];
ll memo2[250000];

ll calc(int n) {
  return n * (n + 1) * (n + 2) / 6;
}

int dfs(int depth, int n) {
  int ans = 9999;
  if (memo[n] != 0) return memo[n];
  for (int i = n; i >= 1; i--) {
    ll t = calc(i);
    if (n - t < 0) continue;
    if (n - t == 0) {
      memo[n] = depth;
      return depth;
    }
    ans = min(ans, dfs(depth + 1, n - t));
  }
  memo[n] = ans;
  return ans;
}

int dfs_odd(int depth, int n) {
  int ans = 9999;
  if (memo2[n] != 0) return memo2[n];
  for (int i = n; i >= 1; i--) {
    if (i % 2 == 0) continue;
    ll t = calc(i);
    if (t % 2 == 0) continue;
    if (n - t < 0) continue;
    if (n - t == 0) {
      memo2[n] = depth;
      return depth;
    }
    ans = min(ans, dfs_odd(depth + 1, n - t));
  }
  memo2[n] = ans;
  return ans;
}
  
int main() {
  int N;
  while (cin >> N, N != 0) {
    for (int i = 0; i < 110; i++) {
      memo[i] = 0;
      memo2[i] = 0;
   }
    cout << dfs(1, N) << " " << dfs_odd(1, N) << endl;
  }

  return 0;
}

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

const int INF = 1e9;

int main(){
  int lim = 1e6;
  vector<int> cube;
  for(int i=1;;i++){
    int c = i*(i+1)*(i+2)/6;
    if(c>lim)break;
    cube.push_back(c);
  }

  vector<int> dp1(lim+1,INF), dp2(lim+1,INF);
  dp1[0] = dp2[0] = 0;

  for(int i=0;i<=lim;i++){
    for(int c : cube){
      if(i+c<=lim){
	dp1[i+c] = min(dp1[i+c], dp1[i]+1);
	if(c%2==1){
	  dp2[i+c] = min(dp2[i+c], dp2[i]+1);
	}
      }
    }
  }

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

C++: #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265

int c[300];
vector<int> d;
int a[10000000],b[10000000];

void f(int n){

  int j=1;
  FOR(i,1,n+1){
    if(c[j+1]==i){
      a[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,1,j+1){
        res = min(res,(i/c[k])+a[i%c[k]]);
      }
      a[i] = res;
    }
  }

  cout<<a[n]<<' ';

  j = 0;
  FOR(i,1,n+1){
    if(d[j+1]==i){
      b[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,1,j+1){
        res = min(res,(i/d[k])+b[i%d[k]]);
      }
      b[i] =res;
    }
  
  }

  cout<<b[n]<<endl;



}

void g(int n){
  cout<<a[n]<<' '<<b[n]<<endl;
}


int main(){

  for(int i=1;i<200;i++){
    c[i] = (i*(i+1)*(i+2))/6;
   if(c[i]%2){
     d.push_back(c[i]);
   }
  }

  f(1000000);

  while(1){
    int n;
    cin>>n;
    if(n==0) break;
    g(n);
  }

  return 0;
}

C++: #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define chmin(a,b)  a=min(a,b);

using namespace std;
int main(void)
{
  vector<int> oddp;
  oddp.assign(2048576,33554432);
  oddp[0]=0;
  vector<int> natp;
  natp.assign(2048576,33554432);
  natp[0]=0;
  for(int d=0;d<200;++d){
    for(int i=0;i<1048576;++i){
      if(i+d*(d+1)*(d+2)/6>1048576) break;
      chmin(natp[i+d*(d+1)*(d+2)/6],natp[i]+1);
      if(d*(d+1)*(d+2)/6%2) chmin(oddp[i+d*(d+1)*(d+2)/6],oddp[i]+1);
    }
  }
  for(;;){
    int n;
    cin >> n;
    if(!n) return 0;
    cout << natp[n] << ' ' << oddp[n] << endl;
  }
}

C++: #include <stdio.h>
#include <vector>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define INF (1<<28)

int dp[2][1000001];

int main() {
    vector<int> a[2];
    for(int i=1;; i++) {
        const int k = i*(i+1)*(i+2)/6;
        if(k>1000000) break;
        a[0].push_back(k);
        if(k%2) a[1].push_back(k);
    }
    rep(x, 2) {
        rep(i, 1000001) dp[x][i] = INF;
        dp[x][0] = 0;
        rep(k, a[x].size()) rep(i, 1000001-a[x][k]) {
            dp[x][i+a[x][k]] = min(dp[x][i+a[x][k]], dp[x][i]+1);
        }
    }
    for(;;) {
        int n;
        scanf("%d", &n);
        if(n==0) return 0;
        printf("%d %d\n", dp[0][n], dp[1][n]);
    }
}