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<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
 
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;
 
using namespace std;
 
const int MAX = 1000100;
 
vector<int> list;
vector<int> odd;
 
void init()
{
    for(int i=1;;i++)
    {
        int num = i*(i+1)*(i+2)/6;
        if(num > MAX){ break; }
        list.push_back(num);
        if(num % 2){ odd.push_back(num); }
    }
 
    return;
}
 
int main()
{
    init();
     
    vector<int> dp(MAX,MAX);
    vector<int> odd_dp(MAX,MAX);
     
    dp[0] = 0;
    odd_dp[0] = 0;
    
    cout << list.size() << endl;

    rep(i,list.size()){
        rep(j,MAX){
            dp[j] = min(dp[j], dp[j - list[i]] + 1);    
        }
    }
 
    rep(i,odd.size()){
        rep(j,MAX){
            odd_dp[j] = min(odd_dp[j], odd_dp[j - odd[i]] + 1); 
        }
    }
     
    int N;
    while(cin >> N && N){
        cout << dp[N] << " " << odd_dp[N] << endl;  
    }
 
    return 0;
}

C++: #include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)(テつエテ」ツδサテ渉嘉」ツδサ`)///

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	while (cin >> n, n) {
		vi v;
		FOR(i, 1, INF) {
			v.push_back(i*(i + 1)*(i + 2) / 6);
			if (v[i - 1] >= n)break;
		}
		int m = v.size();
		vi dp(n + 1,INF);
		dp[0] = 0;
		REP(i, m) {
			REP(j, n + 1) {
				if (j >= v[i]) dp[j] = min(dp[j], dp[j - v[i]] + 1);
			}
		}
		cout << dp[n] << " ";

		REP(j, n + 1) {
			dp[j] = INF;
		}

		dp[0] = 0;
		REP(i, m) {
			if (v[i] % 2 == 0) continue;

			REP(j, n + 1) {
				if(j>=v[i])dp[j] = min(dp[j], dp[j - v[i]] + 1);
			}

		}
		cout << dp[n] << endl;
	}
}

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

int main(){
  const int N = 1000000;
  int dp[2][N+1],n;

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

  int val = 1;
  for(int i=1;val<=N;i++){
    for(int j=0;j+val<=N;j++){
      int nxt = j+val;
      dp[0][nxt] = min(dp[0][nxt],dp[0][j] + 1);
      if(val&1)dp[1][nxt] = min(dp[1][nxt],dp[1][j] + 1);
    }
    val = i*(i+1)*(i+2)/6;
  }

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

C++: #include <iostream>
using namespace std;
int main(){
  int a[200],b[200],c[1000001]={0,1,2,3},d[1000001],k=0,i,j,n;
  for(i=1;i<200;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<195;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(void){
  int size;
  vector<ll> v(200);
  for(ll i=1;;i++){
    if((i*(i+1)*(i+2))/6 > 1000000) break;
    v[i-1] = (i*(i+1)*(i+2))/6;
    size = i-1;
  }
  int dp1[1000000]; // dp[i] := number of tetrahedron with value i
  int dp2[1000000]; // dp[i] := number of tetrahedron with value i
  fill(dp1, dp1+1000000+1, INT_MAX);
  fill(dp2, dp2+1000000+1, INT_MAX);
  dp1[0] = dp2[0] = 0;

  for(int i = 0; i <= 1000000; i++){
    for(int j = 0; j < size; j++){
      if(i+v[j] > 1000000) continue;
      dp1[i + v[j]] = min(dp1[i+v[j]], dp1[i]+1);
    }
  }


  for(int i = 0; i <= 1000000; i++){
    for(int j = 0; j < size; j++){
      if(i+v[j] > 1000000) continue;
      if(v[j] % 2 == 0) continue;
      dp2[i + v[j]] = min(dp2[i+v[j]], dp2[i]+1);
    }
  }

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