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 <cstring>
#include <vector>
#include <algorithm>
#define REP(i,n) for(int i=0;i<(n);++i)
#define SET(a,c) memset(a,c,sizeof(a))
#define PB push_back
using namespace std;

const int MAX_N = 1e6;
const int INF = 0x3f3f3f3f;

int dp[MAX_N], dp_odd[MAX_N];

void solve(int n)
{
	vector<int> m;

	SET(dp, INF);
	SET(dp_odd, INF);
	
	REP(i, MAX_N) {
		m.PB((i + 1) * (i + 2) * (i + 3) / 6);
		if (m.back() > MAX_N) break;
	}
	
	dp[0] = 0; dp_odd[0] = 0;
	REP(i, m.size()) {
		REP(j, n + 1) {
			if (j < m[i]) continue;
			dp[j] = min(dp[j], dp[j - m[i]] + 1);
			if (m[i] % 2) dp_odd[j] = min(dp_odd[j], dp_odd[j - m[i]] + 1);
		}
	}	
}

int main()
{
	int n;
	solve(MAX_N);
	while (1) {
		scanf("%d", &n);
		if (!n) break;
		printf("%d %d\n", dp[n], dp_odd[n]);
	}

	return 0;
}

C++: #include<algorithm>
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
  int i,j,k;
  int a[200],b[50],n,p;
  bool c[1000000],d[1000000];
  a[0]=0;
  p=0;
  j=0;
  for(i=1;a[i-1]<1000000;i++){
    p+=i;
    a[i]=a[i-1]+p;
    if(a[i]%2){
      b[j]=a[i];
      j++;
    }
  }
  while(cin>>n&&n){
    memset(c,0,n);
    c[0]=1;
    for(i=1;;i++){
      memset(d,0,n);
      for(j=0;j<n;j++){
	if(c[j]){
	  for(k=0;j+a[k]<n;k++)
	    d[j+a[k]]=1;
	  if(j+a[k]==n)
	    break;
	}
      }
      if(j!=n)
	break;
      memcpy(c,d,n);
    }
    cout<<i<<" ";
    for(i=0;b[i+1]<=n;i++);
    for(j=0;n;i--){
      j+=n/b[i];
      n-=n/b[i]*b[i];
    }
    cout<<j<<endl;
  }
  return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;

ll gcd(long long a,long long b) {
    if (a < b) swap(a,b);
    if (b == 0) return a;
    
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    a / gcd(a,b) * b;
}
const ll mod = 1e9 + 7;

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

const ll INF = 1e9;
/////////////////////////////////////////////////////////////////////////////////////////
int dp[1000010];
int odd_dp[1000010];

int main(){
    int n,table[183];

    for (int i = 0;i < 183;i++) table[i] = i*(i+1)*(i+2)/6;

    vector<int> num(1000010);
    int cnt = 0,a;
    while(true){
        cin >> a;
        num[cnt] = a;
        cnt++;
        if (a == 0) break;
    }

    for (int i = 0;i < 1000010;i++){
        dp[i] = 20000000;
        odd_dp[i] = 20000000;
    }

    dp[0] = 0;
    dp[1] = 1;

    odd_dp[0] = 0;
    odd_dp[1] = 1;

    for (int i = 2;i < 1000000;i++){
        for (int k = 1;table[k] <= i;k++){
            dp[i] = min(dp[i],dp[i-table[k]] + 1);
            if (table[k] % 2 != 0){
                odd_dp[i] = min(odd_dp[i],odd_dp[i-table[k]] + 1);
            }
        }
    }

    for (int i = 0;i < cnt - 1;i++){
        cout << dp[num[i]] << " " << odd_dp[num[i]] << endl;
    }
}