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<vector>
#include<map>
#include<set>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<complex>
#include<numeric>
#include<bitset>
#define INF 1001001001
#define EPS 0.000000001

#define x first
#define y second
#define M 1000000

using namespace std;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef pair<int,int> pint;

int dx[4] = {-1,0,1,0};
int dy[4] = {0,-1,0,1};
//int dx[8] = {0,1,1,1,0,-1,-1,-1};
//int dy[8] = {1,1,0,-1,-1,-1,0,1};

int nextInt(){
	int x;
	scanf("%d",&x);
	return x;
}


int main(){
	vint ss;
	vint so;
	
	static int nums[M+1];
	static int numo[M+1];
	
	for(int i=0; i<=M; i++){
		nums[i] = INF;
		numo[i] = INF;
	}
	
	for(int i=1; i<200; i++){
		int n = i*(i+1)*(i+2)/6;
		if(n>M) break;
		
		ss.push_back(n);
		nums[n]=1;
		if(n%2==1){
			so.push_back(n);
			numo[n]=1;
		}
	}
	
	for(int i=1; i<=M; i++){
		for(int j=0; j<ss.size(); j++){
			if(i+ss[j]>M) break;
			nums[i+ss[j]] = min(nums[i+ss[j]], nums[i]+1);
		}
		for(int j=0; j<so.size(); j++){
			if(i+so[j]>M) break;
			numo[i+so[j]] = min(numo[i+so[j]], numo[i]+1);
		}
	}
	
	while(1){
		int a = nextInt();
		if(a==0) break;
		printf("%d %d\n", nums[a], numo[a]);
	}
	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;
}

C++: #include <iostream>
using namespace std;
int main(void){
    long long i;
    int n;
    long long j = 0;
    int a[84];
    int b[22];
    long long t[10000];
    for(i = 0; i < 83; i++){
        a[i] = (i+1)*(i+2)*(i+3)/6;
        if(a[i] % 2 == 1){
            b[j] = a[i];
            j++;
        }
    }
    //cout << a[82] << b[20] << endl;
    /*for(i = 0; i < 83; i++){
        cout << "a[i] = " << a[i] << endl;
    }
    for(i = 0; i < 21; i++){
        cout << "b[i] = " << b[i] << endl;
    }*/
    while(1){
        cin >> n;
        if(n == 0){
            break;
        }
        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 82; i++){
            for(j = a[i]; j <= n; j++){
                if(t[j] > t[j - a[i]] + 1){
                    t[j] = t[j -a[i]] + 1;
                }
            }
        }
        cout << t[n] << " ";

        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 20; i++){
            for(j = b[i]; j <= n; j++){
                if(t[j] > t[j - b[i]] + 1){
                    t[j] = t[j - b[i]] + 1;
                }
            }
        }
        cout << t[n] << endl;
    }
    return 0;
}

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

int main()
{
	vector<int> tri(200);

	for (int i = 0; i < 200; i++) {
		tri[i] = i*(i + 1)*(i + 2) / 6;
	}

	vector<int> ans1(1000000);
	vector<int> ans2(1000000);

	ans1[0] = 0;
	ans2[0] = 0;

	for (int i = 1; i < 1000000; i++) {
		ans1[i] = i;
		ans2[i] = i;

		for (int j = 0; i - tri[j] >= 0; j++) {
			ans1[i] = min(ans1[i], ans1[i - tri[j]] + 1);

			if (tri[j] % 2 == 1) {
				ans2[i] = min(ans2[i], ans2[i - tri[j]] + 1);
			}
		}
	}

	while (true) {
		int n;
		cin >> n;

		cout << ans1[n] << " " << ans2[n] << endl;
	}

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int dp[2][1000001];
int v[1000];
int main()
{
	int n;
	for (int i = 0; i < 2; i++)
	{
		for (int j = 0; j <= 1000000; j++)
		{
			if (j == 0)dp[i][j] = 0;
			else dp[i][j] = 999999;
		}
	}
	for (int i = 1;;i++)
	{
		int k = i * (i + 1) * (i + 2) / 6;
		if (k > 1000000)break;
		v[i - 1] = k;
	}
	while (cin >> n && n != 0)
	{
		for (int i = 0; i <= n; i++)
		{
			for (int j = 0;;j++)
			{
				if (i + v[j] > n)break;
				dp[0][i + v[j]] = min(dp[0][i + v[j]],dp[0][i] + 1);
				if (v[j] % 2 == 0)continue;
				dp[1][i + v[j]] = min(dp[1][i + v[j]], dp[1][i] + 1);
			}
		}
		cout << dp[0][n] << " " << dp[1][n] << endl;
	}
	return 0;
}