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>
	std::vector<int> shimen;

int calc_shimen(int pnum){
	static int num = 0;
	static int kai1 = 0;
	static int kai2 = 0;
	static int i = 0;
//	 2 3 4  5
//	1 3 6 10 15
//	 1 4 10 20 35
	while (1){
		if (num > pnum) break;
		kai2++;
		kai1 += kai2;
		num += kai1;
		shimen.push_back(num);
	//	std::cout << num << "\n";
		i++;
	}
	return i-2;
}

int main(void){
	int num, cnum, i, h, c1, cmin, cmin2, k;

	shimen.reserve(1000);
	while (1){
		std::cin >> num;
		if (!num) break;
		
		cmin = 0;
		c1 = 0;
		h = calc_shimen(num);
		while (h >= 1){
			i = h;
			cnum = num;


			k = shimen[i];
		//	std::cout << "begin i:" << i << ", k:" << k << "\n";
		//	if (cmin <= 0 || num / k < cmin){
				c1 = 0;
				while (i >= 0){
					k = shimen[i];
					c1 += cnum / k;
					cnum -= cnum / k*k;
				//	std::cout << "k:" << k << ", cnum:" << cnum << ", c1:" << c1 << "\n";
					i--;
				}
				if (cmin <= 0 || cmin>c1) cmin = c1;

		//	}
			h--;
		}

		cmin2 = 0;
		c1 = 0;
		h = calc_shimen(num);
		while (h >= 1){
			i = h;
			cnum = num;


			k = shimen[i];
		//	std::cout << "begin i:" << i << ", k:" << k << "\n";
			//	if (cmin <= 0 || num / k < cmin){
			c1 = 0;
			while (i >= 0){
				if ((k = shimen[i]) % 2){
					c1 += cnum / k;
					cnum -= cnum / k*k;
				//	std::cout << "k:" << k << ", cnum:" << cnum << ", c1:" << c1 << "\n";
				}
				i--;
			}
			if (cmin2 <= 0 || cmin2>c1) cmin2 = c1;

			//	}
			h--;
		}

		std::cout << cmin << " " << cmin2 << "\n";
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265

int c[300];
vector<int> d;
int a[10000000],b[10000000];

void f(int n){

  int j=1;
  FOR(i,1,n+1){
    if(c[j+1]==i){
      a[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,1,j+1){
        res = min(res,(i/c[k])+a[i%c[k]]);
      }
      a[i] = res;
    }
  }


  j = 0;
  FOR(i,1,n+1){
    if(d[j+1]==i){
      b[i]=1;
      j++;
    }
    else{
      int res = i;
      FOR(k,0,j+1){
        res = min(res,(i/d[k])+b[i%d[k]]);
      }
      b[i] =res;
    }
  
  }




}

void g(int n){
  cout<<a[n]<<' '<<b[n]<<endl;
}


int main(){

  for(int i=1;i<200;i++){
    c[i] = (i*(i+1)*(i+2))/6;
   if(c[i]%2){
     d.push_back(c[i]);
   }
  }

  f(1000000);

  while(1){
    int n;
    cin>>n;
    if(n==0) break;
    g(n);
  }

  return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

#define MAX 1000000

vector<int> p;

int main() {
	p.push_back(0);
	for (int i = 1; p[i - 1] < MAX; i++) {
		p.push_back(i*(i + 1)*(i + 2) / 6);
		//cout << p[i] << endl;
	}

	static int dp[MAX + 1], dp2[MAX + 1];

	for (int i = 0; i <= MAX; i++) {
		dp[i] = dp2[i] = i;
	}

	for (int i = 1; i < p.size() - 1; i++) {
		//cout << i << " ";
		for (int j = p[i]; j <= MAX; j++) {
			dp[j] = min(dp[j - p[i]] + 1, dp[j]);
		}

		if (p[i] % 2 == 1) {
			for (int j = p[i]; j <= MAX; j++) {
				dp2[j] = min(dp2[j - p[i]] + 1, dp2[j]);
			}
		}
	}

	for (int n; cin >> n, n;) {
		cout << dp[n] << " " << dp2[n] << endl;
	}
	return 0;
}

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

using namespace std;

const int INF = 1 << 30;
const int SIZE = 300;
const int N = 1000002;
int p[SIZE+1];
int dp1[N], dp2[N];

void make_pollock (void )
{
	memset (p, 0, sizeof (p ) );

	for (int i = 0; i <= SIZE; i++ )
		p[i] = i*(i+1LL)*(i+2LL)/6LL;
}

void make_dp (void )
{
	fill (dp1, dp1+N, INF );
	fill (dp2, dp2+N, INF );

	dp1[0] = 0;
	for (int i = 1; i <= SIZE; i++ ){
		int m = p[i];
		for (int j = m; j <= N; j++ )
			dp1[j] = min (dp1[j], dp1[j-m]+1 );
	} // end for

	dp2[0] = 0;
	for (int i = 1; i <= SIZE; i++ ){
		if (p[i] % 2 == 0 ) continue;
		int m = p[i];
		for (int j = m; j <= N; j++ )
			dp2[j] = min (dp2[j], dp2[j-m]+1 );
	} // end for	
}
	
int main()
{
	make_pollock();
	make_dp ();

	int n;
	while (cin >> n, n )
		cout << dp1[n] << ' ' << dp2[n] << endl;
	
	return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1e6;

int main(){
    vector<int> th(200);
    for(int i=1; i<=200; i++){
        th[i] = i*(i+1)*(i+2)/6;
    }
    vector<int> dp(MAX, MAX), dp2(MAX, MAX);
    dp[0]=0; dp2[0]=0;
    for(int i=0; th[i]<MAX; i++){
        for(int j=0; j+th[i]<MAX; j++){
            if(dp[j]+1 < dp[j+th[i]]){
                dp[j+th[i]] = dp[j]+1;
            }
        }
        if(th[i]%2==0) continue;
        for(int j=0; j+th[i]<MAX; j++){
            if(dp2[j]+1 < dp2[j+th[i]]){
                dp2[j+th[i]] = dp2[j]+1;
            }
        }
    }
    
    while(1){
        int n;
        cin >> n;
        if(n==0) break;
        cout << dp[n] << " " << dp2[n] << endl;
    }
    return 0;
}