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<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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


int dp[1000010] = { 0 };
int dpodd[1000010] = { 0 };


int N = 0;
int C[191];
int Codd[51];

void input(void) {
	CI N;

	return;
}


int main(void) {
	int C_N;
	for (int i = 1; i <= 190;i++) {
		C[i - 1] = i * (i + 1) * (i + 2) / 6;
	}
	int ii = 1, jj = 0;
	while (true) {
		if (ii * (ii + 1) * (ii + 2) / 6 > 1000000) {
			break;
		}
		if ((ii * (ii + 1) * (ii + 2) / 6) % 2 == 1) {
			Codd[jj] = ii * (ii + 1) * (ii + 2) / 6;
			jj++;
		}
		ii++;
	}

	for (int i = 1; i <= 1000009; i++) {
		dp[i] = 1001000;
	}
	for (int i = 1; i <= 1000009; i++) {
		dpodd[i] = 1001000;
	}

	for (int j = 1; j <= 189; j++) {
		for (int i = 1; i <= 1000002; i++) {
			if (i < C[j - 1]) {
				dp[i] = dp[i];
			}
			else {
				dp[i] = min(dp[i], dp[i - C[j - 1]] + 1);
			}
		}

	}

	for (int j = 1; j <= 50; j++) {
		for (int i = 1; i <= 1000002; i++) {
			if (i < Codd[j - 1]) {
				dpodd[i] = dpodd[i];
			}
			else {
				dpodd[i] = min(dpodd[i], dpodd[i - Codd[j - 1]] + 1);
			}
		}
	}

	while (true) {
		input();
		if (N == 0) {
			break;
		}
		/*for (int i = 0; i < 190; i++) {
			if (C[i] > N) {
				C_N = i;
				break;
			}
		}*/
	

		

		CO dp[N] << " ";

		
		/*for (int i = 0; i < 50; i++) {
			if (Codd[i] > N) {
				C_N = i;
				break;
			}
		}*/
		

		CO dpodd[N] E
		
		
	}
	
	
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <algorithm>
#include <functional>

using namespace std;

#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define foreach(itr,c) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

#define INF (1<<29)

int N;
int a[1010],dp[2][1000010];

void make(){
  int n;
  for(n = 1; n <= 1000; n++) a[n] = n * (n+1) * (n+2) / 6;
}

int main(){
  int i,j,k;

  make();

  for(;;){
    scanf("%d",&N); if(N == 0) break;

    rep(i,2) rep(j,1000010) dp[i][j] = INF;

    dp[0][0] = dp[1][0] = 0;
    for(i = 1; a[i] <= N && i < 1010; i++){
      for(j = 0; j <= N; j++){
        if(j - a[i] >= 0) dp[0][j] = min(dp[0][j], dp[0][j - a[i]] + 1);
        if(a[i] % 2 == 1 && j - a[i] >= 0) dp[1][j] = min(dp[1][j], dp[1][j - a[i]] + 1);
      }
    }

    cout << dp[0][N] << ' ' << dp[1][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(int n)
{
  vector<int> v;
  for(int i = 0; ; i++){
    int t = i * (i + 1) * (i + 2) / 6;
    if(t <= n)
      v.push_back(t);
    else
      break;
  }
  for(int i = 0; i <= n; i++){
    for(int j = 0; j < v.size(); j++){
      if(i + v[j] <= n){
        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()
{
  int n;
  while(1){
    cin >> n;
    if(n == 0){
      break;
    }else{
      fill(dp, dp + n + 1, MAX);
      fill(dp2, dp2 + n + 1, MAX);
      solve(n);
      cout << dp[n] << " " << dp2[n] << endl;
    }
  }
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>

constexpr int N=1000000;

int main() {
  std::vector<int> all, odd;

  for (int i=1; true; ++i) {
    int n=i*(i+1)*(i+2)/6;
    if (n > 1000000)
      break;

    all.push_back(n);
    if (n % 2 == 1)
      odd.push_back(n);
  }

  std::vector<int> dp_all(N, N), dp_odd(N, N);
  dp_all[0] = dp_odd[0] = 0;
  dp_all[1] = dp_odd[1] = 1;
  for (int i=1; i<N; ++i) {
    for (int a: all) {
      if (a > i) break;

      dp_all[i] = std::min(dp_all[i], dp_all[i-a]+1);
    }

    for (int o: odd) {
      if (o > i) break;

      dp_odd[i] = std::min(dp_odd[i], dp_odd[i-o]+1);
    }
  }

  while (true) {
    int q;
    scanf("%d", &q);
    if (q == 0)
      break;

    printf("%d %d\n", dp_all[q], dp_odd[q]);
  }

  return 0;
}