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>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1111111];
int memo2[1111111];
 
int solve(int n){
   
  if(!n) return 0;
  if(n<0) return INF;
  if(~memo[n]) return memo[n];
 
  int ans = INF;
  for(int i=1;p[i]<=n;i++) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(n<0) return INF;
  if(~memo2[n]) return memo2[n];
 
  int ans = INF;
  for(int i=1;p[i]<=n;i++) if(p[i]&1) ans = min(ans, solve2(n-p[i])+1);
 
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  memset(memo, -1, sizeof(memo));
  memset(memo2, -1, sizeof(memo2));
 
  for(int i=0;i<185;i++) p[i] = i*(i+1)*(i+2)/6;
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
 
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#define X first
#define Y second
using namespace std;
int index;
int fourth[201];
int odd[201];
int mintable[1500000];
int mintableOdd[1500000];

void init(){
	fourth[0] = 0;
	odd[0] = 0;
	index = 0;
	for(int i = 1; i <= 200; i++){
		fourth[i] = (i*(i+1)*(i+2))/6;
		mintable[fourth[i]] = 1;
		if(fourth[i]%2){
			odd[++index] = fourth[i];
			mintableOdd[odd[index]] = 1;
		}
	}
}

int dfs(int n){
	for(int i = 2; i <= n/i; i++){
		if(n%i==0){
			return min(dfs(n/i)*i, mintable[n]);
		}
	}
	return mintable[n];
}

int dfsOdd(int n){
	for(int i = 3; i <= n/i; i+=2){
		if(n%i==0){
			return min(dfsOdd(n/i)*i, mintableOdd[n]);
		}
	}
	return mintableOdd[n];
}

int countFourth(int n){
	int min = 10000;
	for(int i = 200; i >= 1; i--){
		if(n>=fourth[i]){
			int tmp = n;
			int count = 0;
			for(int j = i; j >= 1; j--){
				while(tmp>=fourth[j]){
					count++;
					tmp -= fourth[j];
				}
			}
			min = min>count?count:min; 
		}
	}
	return min;
}

int countFourthOdd(int n){
	int min = 10000;
	for(int i = index; i >= 1; i--){
		if(n>=odd[i]){
			int tmp = n;
			int count = 0;
			for(int j = i; j >= 1; j--){
				while(tmp>=odd[j]){
					count++;
					tmp -= odd[j];
				}
			}
			min = min>count?count:min; 
		}
	}
	return min;
}

int main(){
	memset(mintable, 0, sizeof(mintable));
	init();
	int n = 0;
	while(cin >> n && n != 0){
		for(int i = 1; i <= n; i++){
			if(mintable[i]&&mintableOdd[i]) continue;		
			mintable[i] = countFourth(i);
			mintable[i] = dfs(i);
			mintableOdd[i] = countFourthOdd(i);
			mintableOdd[i] = dfsOdd(i);
		}
		cout << mintable[n] << " " << mintableOdd[n] << endl;
	}
	return 0;
}

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

const double pi  = 2 * acos(0.0);
const double eps = 1e-8;

#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef int Cost;
struct Edge {
  int src, dst; Cost cost;
  Edge(int s, int d, Cost c) : src(s), dst(d), cost(c) {}
};
typedef vector<Edge>  Edges;
typedef vector<Edges> Graph;
typedef vector<Cost>  Array;
typedef vector<Array> Matrix;

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

#define MAX_N 1000000
int memo[MAX_N+1];
int memo_odd[MAX_N+1];

int plc(int n) { return n * (n + 1) * (n + 2) / 6; }

void create_table() {
  fill(memo, memo+MAX_N+1, 1<<30);
  fill(memo_odd, memo_odd+MAX_N+1, 1<<30);
  for (int i = 1; plc(i) <= MAX_N+1; i++) {
    memo[plc(i)] = 1;
    if (plc(i) % 2 == 0) continue;
    memo_odd[plc(i)] = 1;
  }
  for (int i = 1; i <= MAX_N; i++) {
    for (int j = 1; plc(j) <= i; j++) {
      memo[i] = min(memo[i], memo[i-plc(j)] + 1);
      if (plc(j) % 2 == 0) continue;
      memo_odd[i] = min(memo_odd[i], memo_odd[i-plc(j)] + 1);
    }
  }
}

int main(void) {
  ios_base::sync_with_stdio(false); cin.tie(0);
  int n;
  create_table();
  while (cin >> n, n) {
    cout << memo[n] << " " << memo_odd[n] << endl;
  }
  return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;

int pollock[190]; //(i+1)の正四面体数
int dp[2][1000001]; //jのポロック数を作る最小四面体数個数
int main()
{
	for(int i=0;i<190;i++)
		pollock[i]=(i+1)*(i+2)*(i+3)/6;
	fill(dp[0],dp[2],1e8-1);
	dp[0][0]=0;
	//start dp
	for(int i=0;i<190;i++)
	{
		for(int j=0;j+pollock[i]<1000001;j++)
		{
			dp[0][j+pollock[i]]=min(dp[0][j+pollock[i]],dp[0][j]+1);
		}
	}
	dp[1][0]=0;
	for(int i=0;i<190;i++)
	{
		if((pollock[i]&1)==0)
			continue;
		for(int j=0;j+pollock[i]<1000001;j++)
		{
			dp[1][j+pollock[i]]=min(dp[1][j+pollock[i]],dp[1][j]+1);
		}
	}
	int n;
	while(1)
	{
		cin>>n;
		if(n==0)
			break;
		cout<<dp[0][n]<<" "<<dp[1][n]<<endl;
	}
	return 0;
}