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<iostream>
#include<cstring>
#define INF 1<<28
using namespace std;
 
int p[1111111];
int memo[1111111];
int memo2[1111111];
 
int solve(int n){
   
  if(!n) return 0;
  if(~memo[n]) return memo[n];
 
  int ans = INF;
  for(int i=199;i>0;i--) if(n >= p[i]) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(~memo2[n]) return memo2[n];
 
  int ans = INF;
  for(int i=0;p[i]<=n;i++) if(p[i]&1 && n >= p[i]) ans = min(ans, solve2(n-p[i])+1);
 
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  memset(memo, -1, sizeof(memo));
  memset(memo2, -1, sizeof(memo2));
 
  for(int i=0;i<200;i++) p[i] = i*(i+1)*(i+2)/6;
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
 
}

C++: #include <bits/stdc++.h>
using namespace std;
const int MAX=1000005;
int dp[MAX];
int dp2[MAX];
vector<int> pol,pol2;
int main(void){
    dp[0]=0;dp2[0]=0;
    int cnt=1;
    // printf("start\n");
    while((cnt*(cnt+1)*(cnt+2))/6<MAX-1){
        int a = (cnt*(cnt+1)*(cnt+2))/6;
        pol.push_back(a);
        if(a%2==1)pol2.push_back((cnt*(cnt+1)*(cnt+2))/6);
        cnt++;
    }
    // cout << pol.size() << endl;
    // printf("dp start\n");
    for(int i=1;i<MAX;i++){
        int tmp=1<<30;
        int cur=0;
        while(cur<pol.size()&&pol[cur]<=i){
            tmp=min(tmp,dp[i-pol[cur]]+1);
            cur++;
        }
        dp[i]=tmp;
    }
    for(int i=1;i<MAX;i++){
        int tmp=1<<30;
        int cur=0;
        while(cur<pol2.size()&&pol2[cur]<=i){
            tmp=min(tmp,dp2[i-pol2[cur]]+1);
            cur++;
        }
        dp2[i]=tmp;
    }
    // printf("stand by\n");
    while(true){
        int n;
        cin>>n;
        if(n==0)return 0;
        printf("%d %d\n",dp[n],dp2[n]);
    }
}

C++: #include <stdio.h>
#include <vector>
#include <iostream>
using namespace std;

#define MAX 1000001

int main(){
    int n;
    int ans_odd[MAX], ans[MAX];
    int tmp, i = 1, j;
    vector<int> odd, normal;

    for(j = 0; j < MAX; j++){
        ans_odd[j] = j;
        ans[j] = j;
    }

    while(tmp < MAX){
        tmp = i * (i + 1) * (i + 2) / 6;
        normal.push_back(tmp);
        if (tmp % 2 == 1) odd.push_back(tmp);
        i++;
    }

    ans_odd[0] = 0;
    ans[0] = 0;
    for(i = 1; i < MAX; i++){
        for(j = 0; j < normal.size(); j++){
            if(normal[j] > i) break;
            ans[i] = min(ans[i], ans[i - normal[j]] + 1);
        }
    }

    for(i = 1; i < MAX; i++){
        ans_odd[i] = i;
        for(j = 0; j < odd.size(); j++){
            if(odd[j] > i) break;
            ans_odd[i] = min(ans_odd[i], ans_odd[i - odd[j]] + 1);
        }
    }

    while(true){
        cin >> n;
        if(n == 0) break;
        printf("%d %d\n", ans[n], ans_odd[n]);
    }

    return 0;
}