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 <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)   FOR(i,0,n)
#define ALL(a)     (a).begin(),(a).end()
#define VI         vector<int>
#define MOD 1000000007

using ll = long long int;
using P = pair<int,int>;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

//const ll INF=(ll)1e19;
const int INF=(1<<30);

int MAX=1000000;
int dp1[1000001];
int dp2[1000001];

int main(){
  REP(i,MAX+1)dp1[i] = INF;
  dp1[0]=0;
  REP(i,MAX+1)dp2[i] = INF;
  dp2[0]=0;

  for(int i=0; ; i++){
    int x=i*(i+1)*(i+2)/6;
    if(x >= MAX)break;

    FOR(i,x,MAX+1){
      dp1[i] = min(dp1[i-x]+1, dp1[i]);
      if(x%2==1)dp2[i] = min(dp2[i-x]+1, dp2[i]);
    }
  }


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

C++: #include <iostream>
using namespace std;
int main(){
  int a[190]={0},b[190]={0},c[1000001]={0,1,2,3},d[1000001],k=0,i,j,n;
  for(i=1;i<190;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<189;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

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

using namespace std;

int dp1[100010]={0};
int dp2[100010]={0};
int list[100];
void setpolloc(){
	int i,j,li;
	for(i=1;i*(i+1)*(i+2)/6<=100010;i++){
		list[i]=i*(i+1)*(i+2)/6;
		dp1[i*(i+1)*(i+2)/6]=1;
		if((i*(i+1)*(i+2)/6)%2) dp2[i*(i+1)*(i+2)/6]=1;
	}
	for(i=1;i<=100010;i++){
		if(dp2[i]) continue;
		for(j=1;list[j]<=i-1;j+=2)if(!dp2[i] || dp2[list[j]]+dp2[i-list[j]] < dp2[i]) dp2[i]=dp2[list[j]]+dp2[i-list[j]];
		if(dp1[i]) continue;
		for(j=1;list[j]<=i-1;j++) if(!dp1[i] || dp1[list[j]]+dp1[i-list[j]] < dp1[i]) dp1[i]=dp1[list[j]]+dp1[i-list[j]];
	}
}


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

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

int main()
{
    const int N = 999999;

    vector<int> num1(N+1, -1);
    vector<int> num2(N+1, -1);
    num1[0] = 0;
    num2[0] = 0;
    for(int i=1; ; ++i){
        int tmp = i*(i+1)*(i+2)/6;
        if(tmp > N)
            break;
        for(int j=0; j+tmp<=N; ++j){
            if(num1[j] >= 0 && (num1[j+tmp] == -1 || num1[j]+1 < num1[j+tmp])){
                num1[j+tmp] = num1[j]+1;
            }
        }
        if(tmp % 2 == 1){
            for(int j=0; j+tmp<=N; ++j){
                if(num2[j] >= 0 && (num2[j+tmp] == -1 || num2[j]+1 < num2[j+tmp])){
                    num2[j+tmp] = num2[j]+1;
                }
            }
        }
    }

    for(;;){
        int n;
        cin >> n;
        if(n == 0)
            break;
        cout << num1[n] << ' ' << num2[n] << endl;
    }

    return 0;
}