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 <string>
#include <vector>
#include <algorithm>
#include <functional>
#include<numeric>
#include<cmath>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int maxn = 1100000;


int main(){
    //cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	//cout << fixed << setprecision(15);
    vector<int> tetra, tetra_odd;
    int i = 0;
    while(i *(i+1)*(i+2) / 6 < 1100000){
        i++;
        int a = i *(i+1)*(i+2) / 6;
        tetra.push_back(a);
        if(i % 4 == 1) tetra_odd.push_back(a);
    }
    /*REP(i,7){
        cout << tetra_odd[i] << endl;
    }*/
    vector<int> dp(maxn+1);
    vector<int> dp_odd(maxn+1);
    dp[0] = 0;
    dp[1] = 1;
    FOR(i,2,maxn+1){
        dp[i] = dp[i-1] + 1;
        int j = 0;
        while(tetra[j] <= i && j < tetra.size()){
            dp[i] = min(dp[i], dp[i - tetra[j]] + 1);
            j++;
        }
    }

    dp_odd[0] = 0;
    dp_odd[1] = 1;
    /*REP(i,maxn+1){
        dp_odd[i] = i;
    }*/
    FOR(i,2,maxn){
        dp_odd[i] = dp_odd[i-1] + 1;
        int j = 0;
        while(j < tetra_odd.size()){
            if(tetra_odd[j] <= i) dp_odd[i] = min(dp_odd[i], dp_odd[i - tetra_odd[j]] + 1);
            //else break;
            j++;
        }
    }
    /*REP(i,40){
        cout << dp_odd[i] << endl;
    }*/

    vector<int> ans1,ans2;
    while(true){
        int N; cin >> N;
        if(N == 0){
            REP(i,ans1.size()){
                cout << ans1[i] << " " <<  ans2[i] << endl;
            }
            return 0;
        }
        else{
            ans1.push_back(dp[N]);
            ans2.push_back(dp_odd[N]);
        }
    }
}

C++: 
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 1000000;
const int INF = 1<<29;
int main(){
  vector<int> dp_1(MAX+1,INF);
  vector<int> dp_2(MAX+1,INF);
  vector<int> poll(1000,0);
  for(int i = 0;i < 200;i++)poll[i] = i*(i+1)*(i+2)/6;
  dp_1[0] = 0;
  dp_2[0] = 0;
  for(int i = 1;i < MAX;i++){
    dp_1[i] = i;
    dp_2[i] = i;
    for(int j = 0;i-poll[j]>=0;j++){
      dp_1[i] = min(dp_1[i],dp_1[i-poll[j]]+1);
      if(poll[j] % 2 == 1)dp_2[i] = min(dp_2[i],dp_2[i-poll[j]]+1);
    }
  }
  int n;
  //  cout << "aaaaaa" << endl;
  while(cin >> n,n != 0){
    cout << dp_1[n] << " " << dp_2[n] << endl;
    
  }
  
  return 0;
}