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<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#include<cassert>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i);

using namespace std;

int cnt1[1000100], cnt2[1000100];

int main() {
	vector<int> nums;

	int a = 2, c = 1, num = 1;

	while (num < 1000100) {
		nums.push_back(num);
		c += a;
		++a;
		num += c;
	}

	rep(j,nums.size()) {
		cnt1[nums[j]] = 1;
		if (nums[j] % 2) cnt2[nums[j]] = 1;
	}

	REP(i,1,1000100) {
		rep(j,nums.size()) {
			if (i - nums[j] <= 0) break;

			if (cnt1[i] == 0) cnt1[i] = cnt1[i - nums[j]] + 1;
			else cnt1[i] = min(cnt1[i], cnt1[i - nums[j]] + 1);

			if (nums[j] % 2) {
				if (cnt2[i] == 0) cnt2[i] = cnt2[i - nums[j]] + 1;
				else cnt2[i] = min(cnt2[i], cnt2[i - nums[j]] + 1);
			}
		}
	}

	int n;
	while (cin >> n, n) {
		cout << cnt1[n] << " " << cnt2[n] << endl;
	}
}

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

#define MAXNUM 1000001
#define MAX 100
using namespace std;

int all[MAXNUM], odd[MAXNUM], fourall[MAXNUM], fourodd[MAXNUM];

int main()
{
	int n;
	int counter = 0;

	//配列の初期化
	for (int i = 1; i < MAXNUM; i++){
		all[i] = MAX;
		odd[i] = MAX;

	}

	//1からMAXNUMまでの中に存在する正四面体数を洗い出す．
	int now = 0, four, allcounter = 1, oddcounter = 1;
	while (1){
		now++;
		four = now  *(now + 1)*(now + 2) / 6;
		all[four] = 1;
		fourall[allcounter++] = four;
		if (four % 2 == 1){
			odd[four] = 1;
			fourodd[oddcounter++] = four;
		}
		if (four > MAXNUM * 2)
			break;

	}

	//1からMAXNUMまで，配列を埋める.
	for (int i = 1; i < MAXNUM; i++){
		for (int j = 1; i > fourall[j]; j++){
			all[i] = min(all[i], 1 + all[i - fourall[j]]);
		}
		for (int j = 1; i > fourodd[j]; j++){
			odd[i] = min(odd[i], 1 + odd[i - fourodd[j]]);
		}

	}

	//入力
	while (cin >> n, n)
		cout << all[n] << " " << odd[n] << endl;

	return 0;

}

C++: #include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

#define INF (1<<28)

int t[1000*1000+1];
int ot[1000*1000+1];

void init() {
    memset(t, -1, sizeof(t));
    memset(ot, -1, sizeof(ot));
    for (int i = 1; ; i++) {
        int n = i * (i+1) * (i+2) / 6;
        if (n > 1000*1000) break;
        t[n] = 1;
        if (n % 2) ot[n] = 1;
    }
}

int count_t(int n) {
    if (t[n] >= 0) return t[n];
    int ans = INF;
    for (int i = 1; ; i++) {
        int p = i * (i+1) * (i+2) / 6;
        if (n <= p) break;
        ans = min(ans, count_t(n - p)+1);
    }
    return t[n] = ans;
}

int count_odd_t(int n) {
    if (ot[n] >= 0) return ot[n];
    int ans = INF;
    for (int i = 1; ; i++) {
        int p = i * (i+1) * (i+2) / 6;
        if (n <= p) break;
        if (p % 2) ans = min(ans, count_odd_t(n - p)+1);
    }
    return ot[n] = ans;
}

int main() {
    init();
    int n;
    while (scanf("%d", &n), n) {
        printf("%d %d\n", count_t(n), count_odd_t(n));
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;

#define MAX_N 1000000

int ans[MAX_N+10];
int oddAns[MAX_N+10];

void solve(int N){
  cout<<ans[N]<<" "<<oddAns[N]<<endl;
}

int main(){
  int res=0;
  int sum=0;
  vector<int> num;
  vector<int> oddNum;
  for(int i=1;i<=185;i++){
    sum+=i;
    res+=sum;
    if(res%2) oddNum.push_back(res);
    num.push_back(res);
  }

  for(int i=1;i<=MAX_N;i++){
    ans[i]=MAX_N;
    oddAns[i]=MAX_N;
  }

  for(int j=0;j<num.size();j++){
    for(int i=0;i<=MAX_N;i++){
      if(i+num[j]<=MAX_N) ans[i+num[j]]=min(ans[i+num[j]],ans[i]+1);
    }
    if(num[j]%2){
      for(int i=0;i<=MAX_N;i++){
        if(i+num[j]<=MAX_N) oddAns[i+num[j]]=min(oddAns[i+num[j]],oddAns[i]+1);
      }
    }
  }

  while(1){
    int N;
    cin>>N;
    if(N==0) break;
    solve(N);
  }

  return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int dp1[1000001],dp2[1000001];
int main(){
  int c1[100000],c2[100000],i,m,p=0,k;
  for(i=0;i*(i+1)*(i+2)/6<=1000000;i++){
    c1[i]=i*(i+1)*(i+2)/6;
    if(c1[i]%2==1){
      c2[p]=c1[i]; 
      p++; 
    }
  }
  for(int j=0;j<=1000000;j++){
    dp1[j]=j;
    dp2[j]=j;
    for(int k=0;k<i;k++){
      if(j-c1[k]>=0)dp1[j]=min(dp1[j],dp1[j-c1[k]]+1);
      if(k<p){
	if(j-c2[k]>=0){
	dp2[j]=min(dp2[j],dp2[j-c2[k]]+1);
       }
      }
    }
  }

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

  cout << dp1[m]<<" "<<dp2[m]<<endl;
  }
 return 0;
}