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<cstdio>
#include<algorithm>
using namespace std;
const int INF = 1000000000;

int d[110], dNumber = 1;
int f(int c) { return c * (c + 1) * (c + 2) / 6; }
int dp1[1000000], dp2[1000000];

int main() {
  while (1) {
    d[dNumber] = f(dNumber);
    if (d[dNumber] > 1000000) break;
    dNumber++;
  }
  for (int i = 0; i < 1000000; i++) dp1[i] = dp2[i] = INF;
  dp1[0] = dp2[0] = 0;
  for (int i = 1; i < 1000000; i++) {
    for (int j = 1; j < dNumber; j++) {
      if (d[j] > i) break;
      dp1[i] = min(dp1[i], dp1[i - d[j]] + 1);
      if (d[j] % 2 == 1) dp2[i] = min(dp2[i], dp2[i - d[j]] + 1);
    }
  }
  int N;
  while (1) {
    scanf("%d", &N);
    if (N == 0) break;
    printf("%d %d\n", dp1[N], dp2[N]);
  }
}

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

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

#define N_MAX 1000000

int main(){
  vl tetra;
  ll i = 1;
  while(i*(i+1)*(i+2)/6 < N_MAX){
    tetra.push_back( i*(i+1)*(i+2)/6 );
    ++i;
  }
  vl alldp(N_MAX,1e18);
  alldp[0] = 0;
  REP(x,tetra.size()){
    ll tt = tetra[x];
    ll t = 1;
    ll b = tt*t;
    while(b<N_MAX){
      REP(_a,N_MAX){
        ll a = N_MAX-1-_a;
        if(a+b>=N_MAX)continue;
        alldp[a+b] = min(alldp[a+b],alldp[a]+t);
      }
      t<<=1;
      b = tt*t;
    }
  }
  vl odddp(N_MAX,1e18);
  odddp[0] = 0;
  REP(x,tetra.size()){
    ll tt = tetra[x];
    if(tt%2==0)continue;
    ll t = 1;
    ll b = tt*t;
    while(b<N_MAX){
      REP(_a,N_MAX){
        ll a = N_MAX-1-_a;
        if(a+b>N_MAX)continue;
        odddp[a+b] = min(odddp[a+b],odddp[a]+t);
      }
      t<<=1;
      b = tt*t;
    }
  }
  while(true){
    ll n;
    cin>>n;
    if(n==0)break;
    cout << alldp[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);
  dp[0] = dp[2] = 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 <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define prime 1000000007
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int dy8[8] = {1, 1, 1, 0, -1, -1, -1, 0};
int dx4[4] = {-1, 0, 1, 0};
int dy4[4] = {0, -1, 0, 1};
vector<int> V;
vector<int> V1;
int s, s1;
int dp0[1000005];
int dp1[1000005];
int solve0(int n) {
    if(n == 0) {
        return dp0[0] = 0;
    }
    if(dp0[n] != -1) return dp0[n];
    int res = INF;
    rep(i, s) {
        if(V[i] > n) break;
        res = min(res, solve0(n - V[i]) + 1);
    }
    return dp0[n] = res;
}

int solve1(int n) {
    if(n == 0) {
        return dp1[0] = 0;
    }
    if(dp1[n] != -1) return dp1[n];
    int res = INF;
    rep(i, s1) {
        if(V1[i] > n) break;
        res = min(res, solve1(n - V1[i]) + 1);
    }
    return dp1[n] = res;
}
signed main(void) {
    for(int i = 1;; i++) {
        int n = i * (i + 1) * (i + 2) / 6;
        if(n < 1000000) {
            V.push_back(n);
            if(n % 2 == 1) V1.push_back(n);
        } else
            break;
    }
    s = V.size();
    s1 = V1.size();
    rep(i, 1000005) dp0[i] = -1;
    rep(i, 1000005) dp1[i] = -1;
    while(true) {
        int n;
        cin >> n;
        if(n == 0) return 0;
        cout << solve0(n) << ' ' << solve1(n) << endl;
    }
}

C++: // ------------------
// author: MatsuTaku
// date  : 27/02/2020
// ------------------

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);

  constexpr int MAX = 1e6;
  vector<int> dp(MAX+1, MAX), dpo(MAX+1, MAX);
  dp[0] = dpo[0] = 0;
  vector<int> nf, nfo;
  for (int i = 1; i*(i+1)*(i+2)/6 <= MAX; i++) {
    const int v = i*(i+1)*(i+2)/6;
    nf.push_back(v);
    if (v%2==1)
      nfo.push_back(v);
  }
  for (int i = 1; i <= MAX; i++) {
    for (auto f : nf) {
      if (i-f<0) break;
      dp[i] = min(dp[i], dp[i-f]+1);
    }
    for (auto f : nfo) {
      if (i-f<0) break;
      dpo[i] = min(dpo[i], dpo[i-f]+1);
    }
  }

  int n;
  while (cin>>n and n > 0) {
    cout << dp[n]<<" "<<dpo[n]<<endl;
  }

  return 0;
}