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 <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  vector<int> v(200);
  FOR(i,0,200) v[i] = i * (i + 1) * (i + 2) / 6;

  int dp[1000006];
  FOR(i,0,1000006) dp[i] = 1e9;
  dp[0] = 0;
  FOR(i,0,1000006) {
    FOR(j,0,v.size()) {
      if(i - v[j] >= 0) dp[i] = min(dp[i], dp[i - v[j]] + 1);
    }
  }

  int dp_even[1000006];
  FOR(i,0,1000006) dp_even[i] = 1e9;
  dp_even[0] = 0;
  FOR(i,0,1000006) {
    FOR(j,0,v.size()) {
      if(v[j]%2 == 0) continue;
      if(i - v[j] >= 0) dp_even[i] = min(dp_even[i], dp_even[i - v[j]] + 1);
    }
  }
  while(cin>>n,n) {
    cout << dp[n] << " " << dp_even[n] << endl;
  }
  return 0;
}

C++: #include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <deque>
#include <stack>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
 
using namespace std;
 
#define fr first
#define sc second
#define mp make_pair
#define foreach(c, it) for(typeof(c) it = (c).begin(); it != (c).end(); it++)
 
typedef long long int64;
typedef pair< int, int > iP;
typedef pair< iP, int > iiP;
 
const int MAX = 1000000;
const int INF = 2 << 28;
const double EPS = 1e-10;
 
int p[4 * MAX + 1], op[4  *MAX + 1];
vector < int > num;
int main() {
     
    for(int i = 0; i < 2 + MAX + 1; i++)
        p[i] = op[i] = INF;
     
    for(int i = 1; i < 200; i++) {
        num.push_back(i * (i + 1) * (i + 2) / 6);
        p[i * (i + 1) * (i + 2) / 6] = 1;
        if((i * (i + 1) * (i + 2) / 6) % 2) op[i * (i + 1) * (i + 2) / 6] = 1;
    }
 
    for(int i = 1; i <= MAX; i++) {
        for(int j = 0; j <num.size(); j++) {
            if(p[i] != INF) {
                p[i + num[j]] = min(p[i] + 1, p[i + num[j]]);
            }
            if(op[i]  != INF && num[j] % 2) {
                op[i + num[j]] = min(op[i] + 1, op[i + num[j]]);
            }
        }
    }
     
    int N;
    while(cin >> N, N) {
        cout << p[N] << " " << op[N] << endl;
    }
}

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

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }
    int dp[100000];
    
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    dp[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count-1;j++){
	if(i+coin[j]<=x){
	  //dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	  tmp=min(dp[i+coin[j]],dp[i]+1);
	  dp[i+coin[j]]=tmp;
	}
      }
    }


    int ans1=dp[x];

    int dp2[100000];
    
    for(int i=0;i<100000;i++)
      dp2[i]=100000;



    dp2[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  dp2[i+coin_ki[j]]=min(dp2[i+coin_ki[j]],dp2[i]+1);
	  tmp=1; 
	  tmp=min(dp2[i+coin_ki[j]],dp[i]+1);
	  //dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    
    int ans2=dp2[x];
    
    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}