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 <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define MAX 1000001
#define pb( a ) push_back( a )
/*
vとkv(奇数用)を用意して
ガンガンまわす
*/
int t[MAX],kt[MAX];
int main(){
	
	memset(t,MAX,sizeof(t));
	memset(kt,MAX,sizeof(kt));
	t[0]=kt[0]=0;
	vector<int>v,kv;
	for(int i=1;1;i++){
		int tmp= i*(i+1)*(i+2)/6;
		if(tmp>MAX)break;
		v.pb(tmp);
		if(tmp%2)kv.pb(tmp);
	}
	
	for(int i=0;i<MAX;i++){
		for(int j=0;j<v.size();j++){
			int tmp=i+v[j];
			if(tmp>=MAX)break;
			t[tmp]=min(t[i]+1,t[tmp]);
		}
		for(int j=0;j<kv.size();j++){
			int tmp=i+kv[j];
			if(tmp>=MAX)break;
			kt[tmp]=min(kt[i]+1,kt[tmp]);
		}
	}
	
	for(int n;cin>>n,n;)cout<<t[n]<<" "<<kt[n]<<endl;;
	
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define INF (1<<29)

using namespace std;

int main(void){

  vector<int>v;
  for(int i=1;i*(i+1)*(i+2)/6<1000000;i++)
    v.push_back(i*(i+1)*(i+2)/6);

  int dp1[1000001],dp2[1000001];
  fill(dp1,dp1+1000001,INF);
  fill(dp2,dp2+1000001,INF);
  
  dp1[0]=dp2[0]=0;

  for(int i=0;i<v.size();i++){
    for(int j=0;j<1000000;j++){
      if(j+v[i]<1000000){
	dp1[j+v[i]]=min(dp1[j+v[i]],dp1[j]+1);
	if(v[i]%2==1)dp2[j+v[i]]=min(dp2[j+v[i]],dp2[j]+1);
      }
    }
  }

  int n;
  while(cin >> n,n){
    cout << dp1[n] << " " << dp2[n] << endl;
  }
  
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1000001];
int memo2[1000001];
 
int solve(int n){

  if(!n) return 0;
  if(memo[n]) return memo[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n; 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=1;p[i]<=n;i++){
    if(p[i]&1) ans = min(ans, solve2(n-p[i])+1);
  }
   
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  for(int i=0;i<181;i++) p[i] = i*(i+1)*(i+2)/6;
  for(int i=1;i<=1000000;i+=5000) solve(i), solve2(i);
   
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
}

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

int main(void){
  
  int i, input, tetras[200] = {0}, ans[1000][2] = {{0}, {0}};
  int a = 0, b = 0; /* a, b???ans??????????????????????????? */

  /* ??£?????¢?????°?¨???? */
  for (i = 1; i < 200; i++) {
    tetras[i] = i * (i+1) * (i+2) / 6;
  }

  while (cin >> input) {
    if (input == 0) break;  /* input???0??§break */
    int temp = input; /* input??????????????? */
    int j = 1, min = 1000;
    /* tetras????????§input??\?????§????????§??????????????¢??? */
    while (tetras[j] <= input) j++;
    j--;
    int l = j; /* j ??????????????? */
      
    /* ?????????????????¢?????° */
    while (j > 0) {
        int n = 0;
        int k = j;
        while (input > 0) {
            input -= tetras[k];
            if (input >= 0) {
                n++;
            } else {
                input += tetras[k];
                k--;
                continue;
            }
        }
        if (min > n) min = n;
        j--;
        input = temp;
    }
    ans[a][0] = min;
      
    /* ?\???°?????£?????¢?????°?????? */
    j = l;  /* j??????????????? */
    min = 1000; /* min??????????????? */
    while (j > 0) {
        /* ??¶??°?????£?????¢?????°????£???°??? */
        if (tetras[j] % 2 == 0) {
            j--;
            continue;
        }
        int n = 0;
        int k = j;
        while (input > 0) {
            /* ??¶??°?????£?????¢?????°????£???°??? */
            if (tetras[k] % 2 == 0) {
                k--;
                continue;
            }
            input -= tetras[k];
            if (input >= 0) {
                n++;
            } else {
                input += tetras[k];
                k--;
                continue;
            }
        }
        if (min > n) min = n;
        j--;
        input = temp;
    }
    ans[a][1] = min;
      
    a++;
  }

  for (b = 0; b < a; b++) {
    cout << ans[b][0] << ' ' << ans[b][1] << endl;
  }
  
  return 0;
}