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;

int dp[1000000];
int dp1[1000000];

void init(){

 
  for(int i=0;i<1000000;i++){
    dp[i]=100000;
  }

  dp[0]=0;
  for(int i=1;i<1000000;i++){
    int j=1;
    while(i-j*(j+1)*(j+2)/6>=0){
      dp[i]=min(dp[i],dp[i-j*(j+1)*(j+2)/6]+1);
      j++;
    }
  }
 


  for(int i=0;i<1000000;i++){
    dp1[i]=1000000;
  }
  dp1[0]=0;
  for(int i=1;i<1000000;i++){
    int j=1; 
    while(i-j*(j+1)*(j+2)/6>=0){
      if((j*(j+1)*(j+2)/6)%2)
        dp1[i]=min(dp1[i],dp1[i-j*(j+1)*(j+2)/6]+1);
      j++;
    }
  }

}

void f(int n){
  cout<<dp[n]<<' '<<dp1[n]<<endl;
}


main(){
  int n;
  init();
  while(true){
    cin>>n;
    if(n==0) break;
    f(n);
  }

}

C++: #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
int main(void){
    ll n,i,j;
    while(cin >> n && n){
        std::vector<ll> v,v2;
        for(i=1;(i*(i+1)*(i+2)/6)<=n;i++){
            v.push_back(i*(i+1)*(i+2)/6);
            if(i*(i+1)*(i+2)/6%2)v2.push_back(i*(i+1)*(i+2)/6);
        }
        ll vs = v.size();
        ll dp[vs+1][n+1];
        fill(dp[0],dp[0]+(vs+1)*(n+1),1000000);
        //cout << dp[0][0] << endl;
        dp[0][0]=0;
        for(i=1;i<=vs;i++){
            for(j=0;j<=n;j++){
                if(j-v[i-1]<0)dp[i][j]=dp[i-1][j];
                else dp[i][j]=min(dp[i][j-v[i-1]]+1,dp[i-1][j]);
            }
        }
        ll ret1 = dp[vs][n];//直にやるほう
        vs = v2.size();
        ll dp2[vs+1][n+1];
        fill(dp2[0],dp2[0]+(vs+1)*(n+1),1000000);
        dp[0][0]=0;
        for(i=1;i<=vs;i++){
            for(j=0;j<=n;j++){
                if(j-v2[i-1]<0)dp[i][j]=dp[i-1][j];
                else dp[i][j]=min(dp[i][j-v2[i-1]]+1,dp[i-1][j]);
            }
        }
        ll ret2 = dp[vs][n];
        cout << ret1 << " " << ret2 << endl;
    }
    return 0;
}