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>
using namespace std ;

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

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

int cal_2( int x , int c ){
	if( x==0 ) return 0 ;
	else{
		if( dp_map[0][x] != 0 ) return dp_map[0][x] ;
		else return x/D[c] + cal_2( x%D[c] , c-1 ) ;
	}
}

int cal( int m , int q ){
	int ans = m ;
	for( int j=q ; j>1 ; j-- ){
		ans = min( ans , cal_2( m , j ) ) ;
	}
	return ans ;
}

int cal_odd_2( int x , int c ){
	if( x==0 ) return 0 ;
	else{
		if( D[c]%2 == 0 ) return cal_odd_2( x , c-1 ) ;
		else{
			if( dp_map[1][x] != 0 ) return dp_map[1][x] ;
			else return x/D[c] + cal_odd_2( x%D[c] , c-1 ) ;
		}
	}
}

int cal_odd( int m , int q ){
	int ans_2 = m ;
	for( int j=q ; j>1 ; j-- ){
		ans_2 = min( ans_2 , cal_odd_2( m , j ) ) ;
	}
	return ans_2 ;
}

void dp(){
	int p = 1 ;
	for( int i=1 ; i<=1000000 ; i++ ){
		if( i < 182 && i >= D[p] ) p++ ;
		dp_map[0][i] = cal(i,p) ;
		dp_map[1][i] = cal_odd(i,p) ;
	}
}

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 <iostream>
#include <vector>
using namespace std;

int main(){
	static int num[1000001],odd[1000001];
	vector<int> pol,podd;
	for(int i = 0;i <= 1000000;i++) odd[i] = i;
	for(int i = 1;;i++){
		int p = i * (i + 1) * (i + 2) / 6;
		if(p > 1000000) break;
		pol.push_back(p);
		num[p] = 1;
		if(p % 2) podd.push_back(p);
	}
	for(int i = 1;i <= 4;i++){
		for(int j = 0;j <= 1000000;j++){
			if(num[j] == i){
				for(int k = 0;k < pol.size();k++){
					if(j + pol[k] <= 1000000) {
						if(!num[j + pol[k]]) num[j + pol[k]] = i + 1;
						else num[j + pol[k]] = min(num[j + pol[k]],i + 1);
					}
				}
			}
		}
	}
	for(int i = 1;i <= podd.size();i++){
		for(int j = 0;j <= 1000000;j++){
			if(j + podd[i] > 1000000) break;
			odd[j + podd[i]] = min(odd[j + podd[i]],odd[j] + 1);
		}
	}
	int n;
	while(cin >> n,n){
		cout << num[n] << " " << odd[n] << endl;
	}
	return 0;
}

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

#define FOR( i, m, n )  for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n )     FOR( i, 0, n )
#define ALL( a )        (a).begin(), (a).end()             

int main() {
	int n;
	vector<int> a, o;
	for( int i = 1; i * ( i + 1 ) * ( i + 2 ) / 6 < 1000000; i++ ) {
		a.push_back( i * ( i + 1 ) * ( i + 2 ) / 6 );
		if( ( i * ( i + 1 ) * ( i + 2 ) / 6 ) % 2 == 1 ) {
			o.push_back( i * ( i + 1 ) * ( i + 2 ) / 6 );
		}
	}

	int tmp[2];
	while( 1 ) {
		cin >> n; if( n == 0 ) break;
		tmp[0] = n;
		tmp[1] = n;
		int acnt = INT_MAX, ocnt = INT_MAX, tcnt = 0;
		
		int i;
		for( i = a.size() - 1; i >= 0; i-- ) {
			if( tmp[0] >= a[i] ) break;
		}
		for( i; i >= 0; i-- ){
			int j = i;
			while( tmp[0] > 0 ) {
				while( tmp[0] >= a[j] ) {
					tmp[0] -= a[j];
					tcnt++;
				}
				j--;
			}
			acnt = min( acnt, tcnt );
			tcnt = 0;
			tmp[0] = n;
		}

		for( i = o.size() - 1; i >= 0; i-- ) {
			if( tmp[1] >= o[i] ) break;
		}
		for( i; i >= 0; i-- ) {
			int j = i;
			while( tmp[1] > 0 ) {
				while( tmp[1] >= o[j] ) {
					tmp[1] -= o[j];
					tcnt++;
				}
				j--;
			}
			ocnt = min( ocnt, tcnt );
			tcnt = 0;
			tmp[1] = n;
		}

		cout << acnt << " " << ocnt << endl;
	}
}

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

using namespace std;
typedef long long ll;

#define REP_N(i,n,s) for(ll i=0; i<(ll)n; i+=s)
#define REP(i,n) REP_N(i,n,1)

ll table[1000000];
ll pollock[1000001];
ll dp[1000001];

void solution(ll output[1000001], int interval) {
	output[0] = 0;
	ll current_i = 1;
	REP(i, 1000001) if(i!=0) {
		ll minimum = 1000001;
		REP_N(j, current_i+1, interval) if(j!=0) minimum = min(output[i - table[j]] + 1, minimum);
		output[i] = minimum;

		if (table[current_i + interval] == i) current_i += interval;
	}
}

int main() {
	
	{
		ll i = 0;
		table[0] = 0;
		while (1000001 > table[i++]) table[i] = i*(i + 1)*(i + 2) / 6;
	}

	solution(pollock, 1);
	solution(dp, 4);

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

}

C++: 
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  int v[200];
  FOR(i,0,200) v[i] = i * (i + 1) * (i + 2) / 6;

  int dp[1000006];
  FOR(i,0,1000006) dp[i] = 1e9;
  dp[0] = 0;
  FOR(i,0,1000006) {
    FOR(j,0,v.size()) {
      if(i - v[j] >= 0) dp[i] = min(dp[i], dp[i - v[j]] + 1);
    }
  }

  int dp_even[1000006];
  FOR(i,0,1000006) dp_even[i] = 1e9;
  dp_even[0] = 0;
  FOR(i,0,1000006) {
    FOR(j,0,v.size()) {
      if(v[j]%2 == 0) continue;
      if(i - v[j] >= 0) dp_even[i] = min(dp_even[i], dp_even[i - v[j]] + 1);
    }
  }
  while(cin>>n,n) {
    cout << dp[n] << " " << dp_even[n] << endl;
  }
  return 0;
}