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<iomanip>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for(ll i = a; i < b; ++i)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define INF (long long)1000000000
#define MOD 1000000007
#define EPS (long double) 1e-8
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;

int dp1[1000001];
int dp2[1000001];

set<int> por;
vector<int> porv;
set<int> pork;
vector<int> porkv;

int rec1(int n) {
	if(n < 0) return INF;
	if(dp1[n] != INF) return dp1[n];
	if(por.count(n) != 0) return 1;
	int res = INF;
	REP(i, porv.size()) {
		res = min(res, rec1(n - porv[i] ) + 1);
	}
	return dp1[n] = res;
}

int rec2(int n) {
	if(n < 0) return INF;
	if(dp2[n] != INF) return dp2[n];
	if(pork.count(n) != 0) return 1;
	int res = INF;
	REP(i, porkv.size()) {
		res = min(res, rec2(n - porkv[i]) + 1);
	}
	return dp2[n] = res;
}

int main() {
	REP(i, 1000001) dp1[i] = dp2[i] = INF;
	dp1[0] = 0;
	dp2[0] = 0;
	int buf = 1;
	while(buf * (buf + 1) * (buf + 2) / 6 <= pow(10, 6)) {
		por.insert(buf * (buf + 1) * (buf + 2) / 6);
		porv.pb(buf * (buf + 1) * (buf + 2) / 6);
		if((buf * (buf + 1) * (buf + 2) / 6) % 2 == 1) {
			pork.insert(buf * (buf + 1) * (buf + 2) / 6);
			porkv.pb(buf * (buf + 1) * (buf + 2) / 6);
		}
		++buf;
	}
	while(1) {
		int n;
		cin>>n;
		if(n == 0) break;
		cout<<rec1(n)<<" "<<rec2(n)<<endl;
	}
}

C++: #include <iostream>
#include <vector>
//#include <fstream>	// require freopen
using namespace std;

typedef long long ll;

const int INF = 1 << 30;
typedef pair<int,int> P;

vector<P> p;

void make_pollock (void )
{
	for (int i = 1; i <= 85; i++ ){
		ll ans = (ll)i*(i+1LL)*(i+2LL)/6LL;
		p.push_back (P ((int)ans, i )  );
	} // end rep
}

int main()
{

	p.clear();
	make_pollock();
	int N = 1000000;
	vector <int> dp1 (N+1, INF ), dp2 (N+1, INF );
	dp1[0] = 0;
	for (int i = 0; i < p.size(); i++ ){
		int m = p[i].first;
		for (int j = m; j <= N; j++ ){
			if (dp1[j] > dp1[j - m] + 1 ){
				dp1[j] = dp1[j - m] + 1;
			} // end if
		} // end for
	} // end for
	dp2[0] = 0;
	for (int i = 0; i < p.size(); i++ ){
		if (p[i].first % 2 == 0 ) continue;
		int m = p[i].first;
		for (int j = m; j <= N; j++ ){
			if (dp2[j] > dp2[j - m] + 1 ){
				dp2[j] = dp2[j - m] + 1;
			} // end if
		} // end for
	} // end for

//	freopen ("testcase.PC2", "r", stdin );
	int n;
	while (cin >> n && n ){
		P res = P(0, 0 );
		res.first = dp1[n];
		res.second = dp2[n];	
		cout << res.first << ' ' << res.second << endl;
	} // end while
	
	return 0;
}

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

using namespace std;

int main(void)
{
	int n;
	int i1,i2;
	int nn;
	int min;
	int num;
	int max;
	vector<int> v;
	
	

	max=0;

	while(1){
		cin >> n;
		if(max<n) max=n;
		v.push_back(n);
		if(n==0) break;
	}

	vector<int> pollock(max+1,0);
	vector<int> pollock2(max+1,0);
	vector<int> p;
	vector<int> p2;
	nn=1;
	num=(nn*(nn+1)*(nn+2))/6;

	for(i1=1;i1<=max;i1++){			

		if(i1==num) {
			if(i1%2==1){
				p.push_back(i1);
				p2.push_back(i1);
				nn++;
				num=(nn*(nn+1)*(nn+2))/6;
				pollock[i1]=1;
				pollock2[i1]=1;
			}
			else {
				nn++;
				num=(nn*(nn+1)*(nn+2))/6;
				p.push_back(i1);
				pollock[i1]=1;
				min=100000;
				for(i2=0;i2<p2.size();i2++){
					if((pollock2[i1-p2[i2]])<min){
						min=pollock2[i1-p2[i2]];
					}
				}
				pollock2[i1]=min+1;
			}
		}
		else {
			min=100000;
			for(i2=0;i2<p.size();i2++){
				if((pollock[i1-p[i2]])<min){
					min=pollock[i1-p[i2]];
				}
			}
			pollock[i1]=min+1;

			min=100000;
			for(i2=0;i2<p2.size();i2++){
				if((pollock2[i1-p2[i2]])<min){
					min=pollock2[i1-p2[i2]];
				}
			}
			pollock2[i1]=min+1;
		}
			//cout<<pollock[i1]<<" ";
	}

	for(i1=0;i1<v.size();i1++){

		cout << pollock[v[i1]] << " " << pollock2[v[i1]] << endl;
	}


	return 0;
}