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>
#define INF 1000000
using namespace std;
int t[INF+100],tt[INF+100];

void DP(int *a, int x){
	for(int i = x;i <= INF;i++){
		a[i] = min(a[i],a[i-x]+1);
	}
}

int main(){
	int n;
	for(int i = 1;i <= INF;i++){
		t[i] = tt[i] = INF;
	}
	t[0] = tt[0] = 0;
	for(int i = 1;;i++){
		int a = (i*(i+1)*(i+2))/6;
		if(a > INF)break;
		DP(t,a);
		if(a%2 == 1){
			DP(tt,a);
		}
	}

	while(1){
		cin >> n;
		if(n == 0)break;
		cout << t[n] << " " << tt[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) {
 return 0;
    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 <vector>
#include <iostream>
              
static constexpr int kMax = 1000000;
              
int main() {  
  std::vector<int> tet, otet;
  int i = 1;  
  while (true) {
    int t = i * (i+1) * (i+2) / 6;
    if (t >= kMax) {
      break;  
    }         
    tet.push_back(t);
    if (t % 2 == 1) {
      otet.push_back(t);
    }         
    i += 1;   
  }           
  std::vector<int> dp(kMax, kMax);
  std::vector<int> odp(kMax, kMax);
  dp[0] = 0;  
  odp[0] = 0; 
              
  for (const int t : tet) {
    for (int i = t; i < kMax; i++) {
      dp[i] = std::min(dp[i], dp[i-t]+1);
    }         
  }           
  for (const int t : otet) {
    for (int i = t; i < kMax; i++) {
      odp[i] = std::min(odp[i], odp[i-t]+1);
    }         
  }           
              
  while (true) {
    int n;    
    std::cin >> n;
    if (n == 0) {
      break;  
    }         
    std::cout << dp[n] << " " << odp[n] << std::endl;
  }           
}