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 <algorithm>
#include <iostream>

using namespace std;

int dp1[100010]={0};
int dp2[100010]={0};
int list[1000];
void setpolloc(){
	int i,j,li;
	for(i=1;i*(i+1)*(i+2)/6<=100000;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<=100000;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<cstdio>
#include<algorithm>
#include<vector>

using namespace std;

vector<long long int> list,oddlist;
int listcnt, oddlistcnt;

int oddrec(int target, int sum, int cnt, int maxcnt) {
    int res=0xFFFF;
    if(maxcnt<cnt) return 0xFFFF;
    if(sum == target) return cnt;
    for(int i=oddlistcnt-1; 0<=i; i--) {
        if(sum+oddlist[i] > target) continue;
        res = min(res, oddrec(target, sum+oddlist[i], cnt+1, maxcnt));
    }
    return res;
}

int main(void) {
    for(long long int i=1; i*(i+1)*(i+2)/6<1e6; i++) {
        list.push_back(i*(i+1)*(i+2)/6);
        if(i*(i+1)*(i+2)/6 % 2)
            oddlist.push_back(i*(i+1)*(i+2)/6);
    }


    listcnt = list.size();
    oddlistcnt = oddlist.size();
    while(true) {
        int n;
        scanf("%d",&n);
        if(!n) break;

        int res=5, oddres=1000;
        for(int i=listcnt-1; 0<=i; i--) {
            if(list[i]>n) continue;
            if(list[i]==n){ res=1; break; }
            if(res<=2) continue;
            for(int j=listcnt-1; 0<=j; j--) {
                if(list[i] + list[j]>n) continue;
                if(list[i] + list[j]==n) res=2;
                if(res<=3) continue;
                for(int k=listcnt-1; 0<=k; k--) {
                    if(list[i] + list[j] + list[k]>n) continue;
                    if(list[i] + list[j] + list[k]==n) res=3;
                    if(res<=4) continue;
                    for(int l=listcnt-1; 0<=l; l--) {
                        if(list[i] + list[j] + list[k] + list[l]>n) continue;
                        if(list[i] + list[j] + list[k] + list[l]==n) res=4;
                        if(res<=4) break;
                    }
                }
            }
        }

        for(int i=1; ; i*=2) {
            if((oddres=oddrec(n, 0, 0, i))!=0xFFFF)
                break;
        }

        printf("%d %d\n",res,oddres);
    }





    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
#define MEMSET(v, h) memset((v), h, sizeof(v))
#define sqr(x) ((x) * (x))
#define bit(n) (1LL<<(n))
#define pcnt(x) __builtin_popcountll(x)
#define PB push_back
#define MP make_pair
#define endl "\n"
using Edge = pair<int,int>;
using Graph = vector<vector<Edge>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int dp[1001001];
int dp2[1001001];
const int INF = 1001001001;

int main() {
  vector<int> v;
  vector<int> v2;
  int ret = 1;
  while(1){
    if(ret*(ret+1)*(ret+2)/6>1000000) break;
    v.PB(ret*(ret+1)*(ret+2)/6);
    if((ret*(ret+1)*(ret+2)/6)%2==1) v2.PB(ret*(ret+1)*(ret+2)/6);
    ++ret;
  }
  sort(v.begin(),v.end(),greater<int>());
  sort(v2.begin(),v2.end(),greater<int>());
  FOR(i,1,1000000) dp[i] = INF;
  FOR(i,1,1000000) dp2[i] = INF;
  for(auto x: v){
    dp[x] = 1;
    FOR(i,0,1000000-x){
      if(dp[i]!=INF) chmin(dp[i+x],dp[i]+1);
    }
  }
  for(auto x: v2){
    dp2[x] = 1;
    FOR(i,0,1000000-x){
      if(dp2[i]!=INF) chmin(dp2[i+x],dp2[i]+1);
    }
  }

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

  

}

C++: #include <bits/stdc++.h>

using namespace std;

#define MAX 181
#define MAX_N 1100000
#define INF 1e9
int arr[MAX];
int dp1[MAX_N], dp2[MAX_N];

void make(){
  vector<int> odd;
  for(int i = 1 ; i < MAX ; i++){
    arr[i] = i*(i+1)*(i+2)/6;
    if(arr[i] % 2) odd.push_back(arr[i]);
  }

  for(int i = 0 ; i < MAX_N ; i++){
    dp1[i] = dp2[i] = INF;
  }
  dp1[0] = dp2[0] = 0;
  for(int i = 0 ; i < MAX ; i++){
    for(int j = 0 ; j < MAX_N ; j++){
      if(j + arr[i] >= MAX_N) continue;
      dp1[j+arr[i]] = min(dp1[j+arr[i]], dp1[j]+1);
    }
  }

  for(int i = 0 ; i < odd.size() ; i++){
    for(int j = 0 ; j < MAX_N ; j++){
      if(j + odd[i] >= MAX_N) continue;
      dp2[j+odd[i]] = min(dp2[j+odd[i]], dp2[j]+1);
    }
  }
}

int main(){
  int n;

  make();
  while(cin >> n ,n){
    cout << dp1[n] << " " << dp2[n] << endl;
  }

  return 0;
}