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 <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までの中に存在する正四面体数を洗い出す．
	long long int now = 0;
	long long int allcounter = 1, oddcounter = 1;
	while (1){
		now++;

		int four = now * (now + 1) * (now + 2) / 6;
		//cout << four << endl;

		all[four] = 1;
		fourall[allcounter++] = four;

		if (four % 2 == 1){
			odd[four] = 1;
			fourodd[oddcounter++] = four;
		}

		if (four > MAXNUM / 2)
			break;
	}

	//cout << allcounter << ", " << oddcounter << endl;

	//1からMAXNUMまで，配列を埋める.
	for (int i = 1; i < allcounter; i++){
		const int num_all = fourall[i];

		for (int j = 1; j < (MAXNUM - num_all); j++){
			all[j + num_all] = min(all[j + num_all], 1 + all[j]);
		}
	}

	for (int i = 1; i < oddcounter; i++){
		const int num_odd = fourodd[i];

		for (int j = 1; j < (MAXNUM - num_odd); j++){
			odd[j + num_odd] = min(odd[j + num_odd], 1 + odd[j]);
		}
	}


	/*
	for (int i = 1; i < MAXNUM; i++){
		for (int j = 1; fourall[j] < i; j++){
			all[i] = min(all[i], 1 + all[i - fourall[j]]);
			cout << all[i];
		}
		for (int j = 1; fourodd[j] < i; j++){
			odd[i] = min(odd[i], 1 + odd[i - fourodd[j]]);
		}

	}

	*/

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

	return 0;

}

C++: #include <bits/stdc++.h>
 
using namespace std;
 
#define MAX 181
#define MAX_N 1100000
#define INF 1e9
int arr[MAX];
int dp1[MAX_N], dp2[MAX_N];
 
void make(){
    vector<int> odd;
    for(int i = 1 ; i < MAX ; i++){
	arr[i] = i*(i+1)*(i+2)/6;
	if(arr[i] % 2) odd.push_back(arr[i]);
    }
 
    for(int i = 0 ; i < MAX_N ; i++){
	dp1[i] = dp2[i] = INF;
    }
    dp1[0] = dp2[0] = 0;
    for(int i = 0 ; i < MAX ; i++){
	for(int j = 0 ; j < MAX_N ; j++){
	    if(j + arr[i] >= MAX_N) continue;
	    dp1[j+arr[i]] = min(dp1[j+arr[i]], dp1[j]+1);
	}
    }
 
    for(int i = 0 ; i < odd.size() ; i++){
	for(int j = 0 ; j < MAX_N ; j++){
	    if(j + odd[i] >= MAX_N) continue;
	    dp2[j+odd[i]] = min(dp2[j+odd[i]], dp2[j]+1);
	}
    }
}
 
int main(){
    int n;
    make();
    while(cin >> n ,n){
	cout << dp1[n] << " " << dp2[n] << endl;
    }
    return 0;
}

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

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)

#define M 1111111
#define F 2222

#define INF 1000000000

int dp1[M];
int dp2[M];

int main(){
	
	vector<int> num;
	
	int sum=0;
	reps(i,1,M){
		sum = sum+(i+1)*i/2;
		if(sum>M)break;
		num.push_back(sum);
	}
	
	vector<int> numodd;
	rep(i,num.size()){
		if(num[i]%2==1)numodd.push_back(num[i]);
	}
	
	rep(i,M)dp1[i]=dp2[i]=INF;
	dp1[0]=dp2[0]=0;
	
	rep(i,M){
		rep(j,num.size()){
			if(i-num[j]>=0)dp1[i] = min(dp1[i] , dp1[i-num[j]]+1);
		}
	}
	rep(i,M){
		rep(j,numodd.size()){
			if(i-numodd[j]>=0)dp2[i] = min(dp2[i] , dp2[i-numodd[j]]+1);
		}
	}
	
	while(1){
		int n;
		cin>>n;
		if(n==0)break;
		printf("%d %d\n",dp1[n],dp2[n]);
	}
	
}

C++: #include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <stdio.h>
#include <string.h>

using namespace std;
#define LL long long
using VS = vector<string>;
using VI = vector<int>;
using VL = vector<LL>;
using VVI = vector<VI>;
using VVL = vector<VL>;
#define FOR(i,s,e) for(i = s; i < e; i++)
#define FORR(i,s,e) for(i = e-1; i >= s; i--)
const LL INF = (LL)1e16;
const LL MOD = (LL)1e9 + 7;

#define ma 1000000
LL i,j,s,m,dp[ma],dp_2[ma];

int main(){
  memset(dp,100,sizeof(dp));
  memset(dp_2,100,sizeof(dp_2));
  dp[0] = 0;
  dp_2[0] = 0;
  FOR(i,1,181){
    s = i*(i+1)*(i+2)/6;
    FOR(j,s,ma){
      if (dp[j-s]+1 < dp[j]) dp[j] = dp[j-s]+1;
    }
    if (s%2){
      FOR(j,s,ma){
        if (dp_2[j-s]+1 < dp_2[j]) dp_2[j] = dp_2[j-s]+1;
      }
    }
  }
  while (1){
    cin >> m;
    if (m == 0){
      return 0;
    }
    cout << dp[m] << " " << dp_2[m]<<endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;

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

const int INF = 1e9;

int main() {
    vector <int> all, odd;
    for (int i = 0; f(i) < 1e6; i++) {
        int fi = f(i);
        all.push_back(fi);
        if (fi % 2) odd.push_back(fi);
    }

    vector <int> allDp(1e6, INF);
    allDp[0] = 0;
    for (int i = 0; i < 1e6; i++) {
        for (auto & j : all) {
            if (i + j >= 1e6) continue;
            allDp[i + j] = min(allDp[i + j], allDp[i] + 1);
        }
    }

    vector <int> oddDp(1e6, INF);
    oddDp[0] = 0;
    for (int i = 0; i < 1e6; i++) {
        for (auto & j : odd) {
            if (i + j >= 1e6) continue;
            oddDp[i + j] = min(oddDp[i + j], oddDp[i] + 1);
        }
    }


    int n;
    while (cin >> n, n) {
        cout << allDp[n] << " " << oddDp[n] << endl;
    }
    return 0;
}