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 <cstring>
#include <algorithm>

using namespace std;

const int SIZE = 181 + 1;
const int MAX = 1000000;

int T[SIZE];
int cost1[MAX], cost2[MAX];

int main( void )
{	
	for(int i=0; i < SIZE; ++i) T[i] = i * (i + 1) * (i + 2) / 6;

	fill(cost1, cost1+MAX, MAX);
	fill(cost2, cost1+MAX, MAX);
	cost1[0] = cost2[0] = 0;
	for(int i=0; i < MAX; ++i) {
			for(int j=0; j < SIZE; ++j) {
				if(i + T[j] < MAX)
					cost1[i + T[j]] = min(cost1[i + T[j]], cost1[i] + 1);
				if(T[j] & 1) {
					if(i + T[j] < MAX)
						cost2[i + T[j]] = min(cost2[i + T[j]], cost2[i] + 1);
				}
			}
	}
	int n;
	while(cin >> n, n) {
		cout << cost1[n] << ' ' << cost2[n] << endl;
	}
	return 0;
}

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

constexpr ll INF = 1ll<<60;
constexpr ll MAX = 1000001;
ll dpA[MAX], dpB[MAX];

int main(int argc, char **argv)
{
	vector<ll> A, B;

	for (ll i = 1; i*(i+1)*(i+2)<=6000000; ++i)
	{
		A.push_back(i*(i+1)*(i+2)/6);
		if (A.back() & 1) B.push_back(A.back());
	}

	// DEBUG
	// for (ll i = 0; i < 10; ++i)
	// 	std::cout << A[i] << " ";
	// std::cout << std::endl;
	// for (ll i = 0; i < 10; ++i)
	// 	std::cout << B[i] << " ";
	// std::cout << std::endl;	

	fill(dpA, dpA+MAX, INF);
	dpA[0] = 0;
	for (ll i = 0; i < MAX; ++i)
	{
		for (ll j = 0; j < (ll)A.size(); ++j)
		{
			if (i+A[j]<MAX) dpA[i+A[j]] = min(dpA[i+A[j]], dpA[i]+1);
			else break;
		}
	}


	fill(dpB, dpB+MAX, INF);
	dpB[0] = 0;
	for (ll i = 0; i < MAX; ++i)
	{
		for (ll j = 0; j < (ll)B.size(); ++j)
		{
			if (i+B[j]<MAX) dpB[i+B[j]] = min(dpB[i+B[j]], dpB[i]+1);
			else break;
		}
	}

	ll n;
	while (cin >> n, n)
	{
		std::cout << dpA[n] << " " << dpB[n] << std::endl;
	}
	
}

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;

	REP(i, MAX_N) {
		m.PB((i + 1) * (i + 2) * (i + 3) / 6);
		if (m.back() > n) break;
	}
	
	REP(i, n + 1) dp[i] = dp_odd[i] = i;
	REP(i, m.size()) {
		if (i == 1) continue;
		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);
		}
	}	
	printf("%d %d\n", dp[n], dp_odd[n]);
}

int main()
{
	int n;
	while (1) {
		scanf("%d", &n);
		if (!n) break;
		solve(n);
	}

	return 0;
}

C++: #include <iostream>
#include <vector>

#define MAX_ 1000010

using namespace std;

int nml[MAX_];
int kisu[MAX_];

int main(int argc, char const *argv[])
{
	int n;
	vector<int> vn;
	vector<int> vk;

	for(int i1=0;i1<MAX_;i1++){
		nml[i1]=0;
		kisu[i1]=0;
	}

	for(int i=1;;i++){
		int p=(i*(i+1)*(i+2))/6;
		if(p>MAX_) break;

		vn.push_back(p);
		if(p%2==1) {
			vk.push_back(p);
		}
	}

	nml[0]=0;
	kisu[0]=0;
	for(int i1=1;i1<MAX_;i1++){
		int i2=0;
		int min = 10;
		while(i1-vn[i2]>=0 && i2<vn.size()){
			if(min>nml[i1-vn[i2]]){
				min=nml[i1-vn[i2]];
			}
			i2++;
		}
		nml[i1]=min+1;

		i2=0;
		min=2000000;
		while(i1-vk[i2]>=0 && i2<vk.size()){
			if(min>kisu[i1-vk[i2]]){
				min=kisu[i1-vk[i2]];
			}
			i2++;
		}
		kisu[i1]=min+1;
	}

	while(1){
		cin>>n;
		if(n==0) break;

		cout<<nml[n]<<" "<<kisu[n]<<endl;

	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#define N 10000
#define INFINITY 2000000000
using namespace std;
int dp[N][N],data[N];
vector<int> data2;
int DP(int);
int DP2(int);
int main(){
  int i,out,out2,n;
  data2.push_back(0);
  for(i=1;i<N;i++){
    data[i]=i*(i+1)*(i+2)/6;
    if(data[i]%2==1){
      data2.push_back(data[i]);
    }
  }
  while(1){
    cin >> n;
    if(n==0) break;
    out=DP(n);
    out2=DP2(n);
    cout << out << ' ' << out2 << endl;
  }
  return 0;
}
int DP(int n){
  int i,j,minret,s;
  for(i=1;i<N;i++){
    if(data[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}
int DP2(int n){
  int i,j,minret,s,len;
  len=data2.size();
  for(i=1;i<len;i++){
    if(data2[i]>n){
      s=i-1;
      break;
    }
  }
  for(i=0;i<=n;i++) dp[0][i]=INFINITY;
  for(i=0;i<=s;i++) dp[i][0]=0;
  for(i=1;i<=s;i++){
    for(j=1;j<=n;j++){
      if(j>=data2[i]) dp[i][j]=min(dp[i-1][j],dp[i][j-data2[i]]+1);
      else dp[i][j]=dp[i-1][j];
    }
  }
  minret=INFINITY;
  for(i=1;i<=s;i++) minret=min(minret,dp[i][n]);
  return minret;
}