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 <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <numeric>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define PREP(it,array) for(vector<P>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)

#define MP       make_pair
#define PB       push_back
#define ALL(x)   (x).begin(),(x).end()

const int INF = 1<<29;
const double EPS = 1e-9;
double zero(double d){
  return d < EPS ? 0.0 : d;
}

typedef long long LL;
typedef pair<int,int> P;


int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(7);

  vector<int> sqNum;
  vector<int> oddSqNum;
  for(int i=1; i<202; i++){
    int num = i*(i+1)*(i+2)/6;
    sqNum.PB( num );
    if(num%2==1)
      oddSqNum.PB( num );
  }

  int N=100000;
  int dp[N], oddDp[N];
  fill( dp, dp+N, INF );
  fill( oddDp, oddDp+N, INF );
  dp[0] = 0;
  oddDp[0] = 0;

  REP(i,N){
    REP(j,sqNum.size()){
      if( i-sqNum[j] >= 0 ){
	dp[i] = min( dp[i], dp[i-sqNum[j]]+1 );
      }
    }

    REP(j,oddSqNum.size()){
      if( i-oddSqNum[j] >= 0 ){
	oddDp[i] = min( oddDp[i], oddDp[i-oddSqNum[j]]+1 );
      }	
    }
  }

  int n;
  while(cin>>n,n){
    cout << dp[n] << " " << oddDp[n] << endl;
  }
  

  return 0;
}

C++: #include <stdio.h>
#define INF 0x7FFFFFFF
 
int main(void){
    int i, j, n, min1,small;
    int dp[200000];
    scanf("%d",&n);
    while(n != 0){
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(small > dp[i]){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
            if(small > dp[n])
                small = dp[n];
            if(dp[n] == 1)
                break;
        }
 
        min1 = dp[n];
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(dp[i] < small){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1 && j * (j + 1) * (j + 2) / 6 % 2 == 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
            if(small > dp[n])
                small = dp[n];
            if(dp[n] == 1)
               break;
        }
        printf("%d %d\n",min1,dp[n]);
        scanf("%d",&n);
    }
    return 0;
}

C++: #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;

ll dp1[1000005],dp2[1000005];
int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    int n;
    vector<int> v;
    vector<pair<int,int> > ans;
    int INF=1000004;
    for(int i=1;;i++){
    	n=i*(i+1)*(i+2)/6;
    	if(n>=INF)break;
    	v.pb(n);
    }
    n=1000004;
    for(int i=1;i<=n;i++){
    	dp1[i]=dp2[i]=mod;
    }
    dp1[0]=dp2[0]=0;
    for(auto& i:v){
    	for(int j=i;j<=n;j++){
    		dp1[j]=min(dp1[j-i]+1,dp1[j]);
    	}
    	if(i%2){
    		for(int j=i;j<=n;j++){
    			dp2[j]=min(dp2[j-i]+1,dp2[j]);
    		}
        }
    }
    while(1){
    	cin>>n;
    	if(n==0)break;
    	ans.pb(make_pair(dp1[n],dp2[n]));
    }
    for(auto& i:ans){
    	cout << i.first<<" "<<i.second<<endl;
    }
    return 0;
}

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

 int i,j,n,three[1000000],four[1000000],four_2[1000000],c[1000000],c_2[1000000];

int main(){
  
  three[0] = 1;
  four[0] = 1;
  for( i = 1; i < 1000000; i++ )three[i] = i+1 + three[i-1];
  for( i = 1; i < 1000000; i++ )four[i] = three[i] + four[i-1];
  
  int k = 0;
  for( i = 0; i < 1000000; i++ ){
    if(four[i] %2 == 1 ){
      four_2[k] = four[i];
      k++;
    }
  }
  
  while(1){
    int n; cin >> n;
    if(n==0)break;
    for( i = 0; i <= n; i++ ){
      c[i] = 2000000;
      c_2[i] = 2000000;
    }

    c[0] = 0;
    for( i = 0; i < 100; i++ ){
      for( j = four[i]; j <= n; j++ ){
	c[j] = min( c[j],c[j-four[i]] + 1 );
      }
    }

    c_2[0] = 0;
    for( i = 0; i < 100; i++ ){
      for ( j = four_2[i]; j <= n; j++ ){
	c_2[j] = min( c_2[j],c_2[j-four_2[i]] + 1 );
      }
    }
    cout << c[n] << " " << c_2[n] << endl;
  }
    return 0;
}