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>

using namespace std;
#define MAX 1000000
#define INF 1000000000

int dp1[MAX + 1], dp2[MAX + 1];

int main()
{
    for (int i = 1; i <= MAX; i++)
    {
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for (int n = 1; n * (n + 1) * (n + 2) / 6 <= MAX; n++)
    {
        int a = n * (n + 1) * (n + 2) / 6;
        for (int i = a; i < MAX; i++)
        {
            dp1[i] = min(dp1[i], dp1[i - a] + 1);
        }
        if (a % 2 == 0)
            continue;
        for (int i = a; i < MAX; i++)
        {
            dp2[i] = min(dp2[i], dp2[i - a] + 1);
        }
    }

    while (1)
    {
        int n;
        cin >> n;
        if (n == 0)
            break;
        cout << dp1[n] << " " << dp2[n] << endl;
    }
    return 0;
}

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

int D[181] = {} ; // 10^6 越え → 181
int dp_map[2][1000002] = {} ;

void t(){
	for( int i=1 ; i<181 ; i++ ){
		D[i] = i * (i+1) * (i+2) / 6 ;
	}
}

void dp(){
	
	for( int i=0 ; i<=1000000 ; i++ ){
		dp_map[0][i] = i ;
		dp_map[1][i] = i ;
	}
	
	for( int i=0 ; i<=1000000 ; i++ ){
		for( int j=1 ; j<181 ; j++ ){
			if( i+D[j] <= 1000000 )
				dp_map[0][i+D[j]] = min( dp_map[0][i+D[j]] , dp_map[0][i]+1 ) ;
			if( D[j]%2 == 1 && i+D[j] <= 1000000 )
				dp_map[1][i+D[j]] = min( dp_map[1][i+D[j]] , dp_map[1][i]+1 ) ;
		}
	}
}

int main(){
	
	t() ;
	dp() ;
	
	int n ;
	
	while( cin >> n , n ){
		cout << dp_map[0][n] << ' ' ;
		cout << dp_map[1][n] << endl ;
	}
	
return 0 ;
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-9;
const double PI  = acos(-1.0);

ll dp[1000001],dpo[1000001];

const ll MAX=LONG_MAX/10;

ll pol(ll n){
	return n*(n+1)*(n+2)/6;
}

ll dfs(ll n,bool odd,int size){
	ll (&dpp)[1000001]=(odd?dpo:dp);
	if(dpp[n]!=MAX){
		return dpp[n];
	}
	if(n==0){
		return 0;
	}
	if(size>100){
		return MAX;
	}
	ll ret=MAX;
	for(ll j=1,i=pol(j);i<=n;j++,i=pol(j)){
		if(odd&&(!(i&1)))continue;
		ret=min(ret,dfs(n-i,odd,size+1)+1);
	}
	return dpp[n]=ret;
}

int main(){
	ll n;
	REP(i,1000001){
		dp[i]=MAX;
	}
	REP(i,1000001){
		dpo[i]=MAX;
	}
	REP(i,1000000){
		dp[i]=dfs(i,false,0);
		dpo[i]=dfs(i,true,0);
	}
	while(cin>>n,n){
		cout<<dfs(n,false,0);
		cout<<" "<<dfs(n,true,0)<<endl;
	}
	
}

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

const int MAX = 1e6+5;
int dp1[MAX];
int dp2[MAX];

void init(int n){
    int INF = 1e9;
    for(int j=0;j<=n;j++){
        dp1[j] = INF;
        dp2[j] = INF;
    }
    dp1[0] = 0;
    dp2[0] = 0;
}

signed main(){
    ios::sync_with_stdio(false);
	cin.tie(0);
    cout << fixed << setprecision(20);

    vector<int> a;
    vector<int> b;
    for(int i=1;i<100000;i++){
        int ret = i*(i+1)*(i+2)/6;
        if(ret > 1e6) break;
        a.push_back(ret);
        if(ret %2 == 1) b.push_back(ret);

    }
    init(1e6);
    for(int i=0;i<180;i++){
        if(a[i] > 1e6) break;
        for(int j=0;j<=1e6;j++){
            int p = j+a[i];
            if(p > 1e6) break;
            dp1[p] = min(dp1[p], dp1[j]+1);
        }
    }
    for(int i=0;i<b.size();i++){
        if(b[i] > 1e6) break;
        for(int j=0;j<=1e6;j++){
            int p = j+b[i];
            if(p > 1e6) break;
            dp2[p] = min(dp2[p], dp2[j]+1);
        }
    }





    int n;
    while(cin>>n){
        if(n==0) break;
        cout << dp1[n] << " ";
        cout << dp2[n] << "\n";
    }
}