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>
using namespace std;

int main(void){
  
  int i, input, tetras[200] = {0}, ans[1000][2] = {{0}, {0}};
  int a = 0, b = 0; /* a, b???ans??????????????????????????? */

  /* ??£?????¢?????°?¨???? */
  for (i = 1; i < 200; i++) {
    tetras[i] = i * (i+1) * (i+2) / 6;
  }

  while (cin >> input) {
    if (input == 0) break;  /* input???0??§break */
    int temp = input; /* input??????????????? */
    int j = 1, min = 1000;
    /* tetras????????§input??\?????§????????§??????????????¢??? */
    while (tetras[j] <= input) j++;
    j--;
    int l = j; /* j ??????????????? */
      
    /* ?????????????????¢?????° */
    while (j > 0) {
        int n = 0;
        int k = j;
        while (input > 0) {
            /* tetras[k] > input???????£???°??? */
            if (tetras[k] > input) {
                k--;
                continue;
            }
            input -= tetras[k];
            if (input >= 0) {
                n++;
            } else {
                input += tetras[k];
                k--;
                continue;
            }
        }
        if (min > n) min = n;
        j--;
        input = temp;
    }
    ans[a][0] = min;
      
    /* ?\???°?????£?????¢?????°?????? */
    j = l;  /* j??????????????? */
    min = 1000; /* min??????????????? */
    while (j > 0) {
        /* ??¶??°?????£?????¢?????°????£???°??? */
        if (tetras[j] % 2 == 0) {
            j--;
            continue;
        }
        int n = 0;
        int k = j;
        while (input > 0) {
            /* ??¶??°?????£?????¢?????°????£???°??? */
            if (tetras[k] % 2 == 0 || tetras[k] > input) {
                k--;
                continue;
            }
            input -= tetras[k];
            if (input >= 0) {
                n++;
            } else {
                input += tetras[k];
                k--;
                continue;
            }
        }
        if (min > n) min = n;
        j--;
        input = temp;
    }
    ans[a][1] = min;
      
    a++;
  }

  for (b = 0; b < a; b++) {
    cout << ans[b][0] << ' ' << ans[b][1] << endl;
  }
  
  return 0;
}

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define itrep(it, a) for(it = (a).begin(); it != (a).end(); it++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
#define INF (1 << 30)
using namespace std;

int dp1[2000050];
int dp2[2000050];

void solve(){
    vector<int> va;
    vector<int> vb;
    for(int i = 1; i * (i + 1) * (i + 2) / 6 <= 1000000; i++){
        int a = i * (i + 1) * (i + 2) / 6;
        va.push_back(a);
        if(a % 2 == 1) vb.push_back(a);
    }
    rep(i,1000005){
        dp1[i] = INF;
        dp2[i] = INF;
    }
    dp1[0] = dp2[0] = 0;

    rep(i,va.size()){
        rep(j, 1000000){
            if(dp1[j] != INF){
                dp1[j + va[i]] = min(dp1[j + va[i]], dp1[j] + 1);
            }
        }
    }
    rep(i,vb.size()){
        rep(j, 1000000){
            if(dp2[j] != INF){
                dp2[j + vb[i]] = min(dp2[j + vb[i]], dp2[j] + 1);
            }
        }
    }
}

int main(){
    int n;
    solve();
    while(cin >> n, n){
        cout << dp1[n] << ' ' << dp2[n] << endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
using namespace std;

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;

vector<pii> a(1000010);
//int b[5]={1,4,10,20,35};
//int c[3]={1,10,35};
int main(){
	int n;
	vint b,c;
	ll lim=1000010;
	for(ll i=0;i<lim;i++){
		a[i]=mkp(INT_MAX,INT_MAX);
		//cout<<a[i].S<<endl;
	}
	a[0]=mkp(0,0);
	rep(i,1000000){
		if(!i) continue;
		int t=i*(i+1)*(i+2)/6;
		if(t>1000000) break;
		b.PB(t);
		if(t&1) c.PB(t);//cout<<t<<endl;
	}
	// for(int i=1;i<INT_MAX;i+=2){
		// int t=i*(i+1)*(i+2)/6;
		// if(t>1000000) break;
		// c.PB(t);
		//cout<<t<<endl;
	// }
	rep(i,b.size()){
		int t=b[i];
		while(t<=lim){
			a[t].F=min(a[t].F,a[t-b[i]].F+1);
			t++;
		}
	}
	//cout<<"hoge"<<endl;
	rep(i,c.size()){
		int t=c[i];
		while(t<=lim){
			a[t].S=min(a[t].S,a[t-c[i]].S+1);
			//if(t==14) cout<<a[t].S<<" "<<c[i]<<endl;
			t++;
		}
	}
	while(cin>>n,n){
		cout<<a[n].F<<" "<<a[n].S<<endl;
	}
	return 0;
}