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 <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(), (v).end()
#define rev(s) (s).rbegin(), (s).rend()
#define MP make_pair
#define X first
#define Y second

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int INF = 100000000;

const int tetra_size = 200;
int tetra[tetra_size];
int tri[tetra_size];
void settetra(){
	tetra[0] = 0;
	tri[0] = 0;
	for(int i = 1; i < tetra_size; i++){
		tri[i] = tri[i-1] + i;
		tetra[i] = tetra[i-1] + tri[i];
	}
}

int dp[100001];
int dpodd[100001];
void setdp(){
	fill(dp, dp+100001, INF);
	dp[0] = 0;
	fill(dpodd, dpodd+100001, INF);
	dpodd[0] = 0;
	for(int i = 1; i < tetra_size; i++){
		for(int j = 0; j + tetra[i] < 100001; j++ ){
			if(dp[j] == INF) continue;
			dp[j+tetra[i]] = min(dp[j]+1, dp[j+tetra[i]]);
			if(tetra[i]%2 == 1) dpodd[j+tetra[i]] = min(dpodd[j]+1, dpodd[j+tetra[i]]);
		}
	}
}

int main(){
	settetra();
	setdp();
	int n;
	while(cin >> n){
		cout << dp[n] << ' ' <<  dpodd[n]  << endl;
	}

	return 0;
}

C++: #include "bits/stdc++.h"
#include <sys/timeb.h>
#include <fstream>

using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define replrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) replrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) a.begin(),a.end()
#define mp make_pair
#define mt make_tuple
#define INF 2000000000
#define INFL 1000000000000000000LL
#define EPS 1e-9
#define MOD 1000000007
#define PI 3.1415926536
#define RMAX 4294967295

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<P> vP;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<double> > vvd;
typedef vector<vector<P> > vvP;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<P, vector<P>, greater<P> > pqlP;
typedef pair<int, pair<int, int> > Edge;
typedef vector<Edge> vE;
typedef priority_queue<Edge, vector<Edge>, greater<Edge> > pqlE;

template<typename T>
using v = vector<T>;

int main() {
	vi num(180);
	rep(i, 180) {
		num[i] = (i + 1)*(i + 2)*(i + 3) / 6;
	}
	int N = 1000001;
	vi ans1(N), ans2(N);
	rep(i, N) {
		ans1[i] = ans2[i] = i;
	}
	
	repl(i, 1, 180) {
		repl(j, num[i], N) {
			ans1[j] = min(ans1[j], ans1[j - num[i]] + 1);
		}
	}
	repl(i, 1, 180 / 4) {
		repl(j, num[4 * i], N) {
			ans2[j] = min(ans2[j], ans2[j - num[4 * i]] + 1);
		}

	}

	while (true) {
		int n;
		cin >> n;
		if (n == 0)break;
		cout << ans1[n] << " " << ans2[n] << endl;
	}


	return 0;
}

C++: #include <stdio.h>
#define INF 0x7FFFFFFF
  
int main(void){
    int i, j, n, min1,small;
    int dp[1000000];
    scanf("%d",&n);
    while(n != 0){
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(small > dp[i]){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
            if(small > dp[n])
                small = dp[n];
            if(dp[n] == 1)
                break;
        }
  
        min1 = dp[n];
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(dp[i] < small){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1 && j * (j + 1) * (j + 2) / 6 % 2 == 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
            if(small > dp[n])
                small = dp[n];
            if(dp[n] == 1)
               break;
        }
        printf("%d %d\n",min1,dp[n]);
        scanf("%d",&n);
    }
    return 0;
}

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

int n, table[200];
int dp[1000000], odddp[1000000];

int main()
{
	for (int i = 0; i < 183; ++i)table[i] = i * (i + 1) * (i + 2) / 6;
	for (int i = 0; i < 1000000; ++i){
		odddp[i] = 20000000;
		dp[i] = 20000000;
	}
	dp[0] = odddp[0] = 0;
	dp[1] = odddp[1] = 1;
	for (int i = 2; i < 1000000; ++i){
		for (int j = 1; table[j] <= i; ++j){
			dp[i] = min(dp[i], dp[i - table[j]] + 1);
			if (table[j] % 2)odddp[i] = min(odddp[i], odddp[i - table[j]] + 1);
		}
	}
	while (cin >> n){
		if (!n)return 0;
		cout << dp[n] << ' ' << odddp[n] << endl;
	}
}