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 <bits/stdc++.h>
using namespace std;

int main()
{
    vector<int> v, v_odd;
    for (int i = 1; i < 1000; i++)
    {
        int tmp = (i * (i + 1) * (i + 2)) / 6;
        if (tmp > 1000000)
        {
            break;
        }
        v.push_back(tmp);
        if (tmp % 2 == 1)
        {
            v_odd.push_back(tmp);
        }
    }
    vector<int> dp(2000000, 10000000);
    vector<int> dp_odd(2000000, 10000000);
    dp[0] = 0;
    dp[1] = 1;
    dp_odd[0] = 0;
    dp_odd[1] = 1;
    for (int i = 0; i < 1000000; i++)
    {
        for (int j : v)
        {
            dp[i + j] = min(dp[i + j], dp[i] + 1);
        }
        for (int j : v_odd)
        {
            dp_odd[i + j] = min(dp_odd[i + j], dp_odd[i] + 1);
        }
    }

    while (1)
    {
        int n;
        cin >> n;
        if (n == 0)
        {
            break;
        }
        cout << dp[n] << " " << dp_odd[n] << endl;
    }
}

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

int main()
{
    int lim = 10000;
    int all[lim];
    int even[lim];
    for (int i = 0; i < lim; i++){
        all[i] = i;
        even[i] = i;
    }
    for (int i = 0; i < 181; i++){
        int tmp = i * (i + 1) * (i + 2) / 6;
        if (tmp > lim) break;
        all[tmp] = 1;
        if (tmp % 2 == 1)
            even[tmp] = 1;
    }
    for (int i = 2; i < lim; i++){
        for (int j = 1; j <= i / 2; j++){
            all[i] = min(all[i], all[j] + all[i-j]);
            even[i] = min(even[i], even[j] + even[i-j]);
        }
    }

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

    return 0;
}

C++: #include <iostream>
#include <vector>
#define REP(i, a, n) for(int i = (a); i <= (n); i++)
#define INF 100000000
using namespace std;

const int M = 1000000;
int N, base1[M + 1], base2[M + 2], dp1[M + 1], dp2[M + 1];
vector<int> b1, b2;

int dfs1(int n) {
  if(dp1[n] >= 0) return dp1[n];
  if(base1[n]) return dp1[n] = 1;

  int ret = INF;
  for(int i : b1) {
    if(i < n) ret = min(ret, 1 + dfs1(n - i));
    else break;
  }
  return dp1[n] = ret;
}

int dfs2(int n) {
  if(dp2[n] >= 0) return dp2[n];
  if(base2[n]) return dp2[n] = 1;

  int ret = INF;
  for(int i : b2) {
    if(i < n) ret = min(ret, 1 + dfs2(n - i));
    else break;
  }
  return dp2[n] = ret;
}

int main(void) {
  REP(i, 1, M) dp1[i] = dp2[i] = -1, base1[i] = base2[i] = 0;
  for(int i = 1, n; n = i * (i + 1) * (i + 2) / 6, n <= M; i++) {
    base1[n] = 1, b1.push_back(n);
    if(n % 2 == 1) base2[n] = 1, b2.push_back(n);
  }

  while(cin >> N, N) {
    cout << dfs1(N) << " " << dfs2(N) << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int dp1[1000001], dp2[1000001];

int main()
{
    fill(dp1, dp1 + 1000001, 1000000000);
    fill(dp2, dp2 + 1000001, 1000000000);
    
    dp1[0] = dp2[0] = 0;
    
    for (int i = 1; i * (i + 1) * (i + 2) <= 6000000; i++){
        int s = i * (i + 1) * (i + 2) / 6;
        
        if (s & 1){
            for (int j = 0; j + s <= 1000000; j++){
                dp2[j + s] = min(dp2[j + s], dp2[j] + 1);
            }
        }
        for (int j = 0; j + s <= 1000000; j++){
            dp1[j + s] = min(dp1[j + s], dp1[j] + 1);
        }
    }
    
    int n;
    
    while (scanf("%d", &n) && n){
        printf("%d %d\n", dp1[n], dp2[n]);
    }
    
    return (0);
}

C++: #include <iostream>
#include <algorithm>
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];
    //fill(dp,dp + x+1,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;
	}
      }
    }

    cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    //printf("%d\n",count_ki);
    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);
	  //dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}