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>

using namespace std;
#define MAX 1000000
#define INF 1000000000

int dp1[MAX+1],dp2[MAX+1];

int main() {
    for(int i = 1;i <= MAX;i++) {
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1;n * (n + 1) * (n + 2) / 6 <= MAX;n++) {
        int a = n * (n + 1) * (n + 2) / 6;
        for(int i = a;i <= MAX;i++) {
            dp1[i] = min(dp1[i],dp1[i - a] + 1);
        }
        if(a % 2 == 0)continue;
        for(int i = a;i <= MAX;i++) {
            dp2[i] = min(dp2[i],dp2[i - a] + 1);
        }
    }

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

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);
	  tmp=1;
	  dp[i+coin[j]]=tmp;
	}
      }
    }


    //int ans1=dp[x];

  
    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_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1); 
	  //tmp=min(dp[i+coin_ki[j]],dp[i]+1);
	  tmp=1;
	  dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    
    //int ans2=dp[x];
    
    printf("%d %d\n",1,2);
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

namespace Solver {

    int N;
    vector<int> m1, m2;
    inline bool Read() {
        cin >> N;
        return N != 0;
    }

    int dfs(int n, bool odd)
    {
        if ( odd && m2[n] != -1) return m2[n];
        if (!odd && m1[n] != -1) return m1[n];

        int ans = 1e6, t = -1, tt = -1;
        for (int i = 1000; i >= 1; i--) {
            int vol = ((i * (i + 1) * (i + 2)) / 6);
            if (odd && vol % 2 != 1) continue;

            int rest = n - vol;
            if (rest < 0) continue;
            int p = ans;
            ans = min(ans, dfs(rest, odd) + 1);
            if (ans != p) {
                t = i;
                tt = rest;
            }
        }

        if ( odd) m2[n] = ans;
        if (!odd) m1[n] = ans;
        return ans;
    }

    inline void Work() {
        cout << dfs(N, false) << " " << dfs(N, true) << endl;
    }

    inline void Solve() {

        m1.resize(10e6 + 1, -1);
        m2.resize(10e6 + 1, -1);
        m1[0] = m2[0] = 0;

        while (Read()) Work();
    }
}

int main() {
    Solver::Solve();
}

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

template<class T> inline void chmin(T& a, const T& b) { if(b < a) a = b; }

inline int tetrahedral(int n) {
	return n * (n + 1) * (n + 2) / 6;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	const int MAX = 1000000;
	vector<int> dp(MAX, MAX), odd_dp(MAX, MAX);
	dp[0] = 0;
	odd_dp[0] = 0;
	for(int n = 1;; ++n) {
		const int tmp = tetrahedral(n);
		if(tmp >= MAX)
			break;

		for(int i = 0; i + tmp < MAX; ++i)
			chmin(dp[i + tmp], dp[i] + 1);

		if(tmp & 1)
			for(int i = 0; i + tmp < MAX; ++i)
				chmin(odd_dp[i + tmp], odd_dp[i] + 1);
	}

	for(int x; cin >> x, x;)
		cout << dp[x] << " " << odd_dp[x] << endl;

	return EXIT_SUCCESS;
}