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 <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n;
int sum[222];

//int dp[1111111][222];
int dp[2][1111111];

/*
int solve(int s,int i,int f){
  //if(!s) return 0;
  if(i >= m) return s;
  if(dp[s][i])return dp[s][i];

  int ret = 1 << 28;
  if(!((sum[i] + 1) % f)){
    for(int j = 0;s - sum[i] * j >= 0 ; j++){
      ret = min(ret,solve(s - sum[i] * j,i + 1,f) + j);
    }
  }
  ret = min(ret,solve(s,i + 1,f));

  return dp[s][i] = ret;
}
*/
int solve(int s,int f){
  if(!s) return 0;
  if(dp[f-1][s]) return dp[f-1][s];

  int ret = 1 << 28;
  for(int i = 0; s >= sum[i]; i++){
    if(!((sum[i] + 1) % f)){
      ret = min(ret,solve(s - sum[i],f) + 1);
    }
  }
  return dp[f-1][s] = ret;
}

int main(void){
  sum[0] = 1;
  for(int i = 1; sum[i-1] <= 1000000; i++){
    sum[i] = sum[i-1] * (i + 3) / i;
  }
  for(int i = 1; i < 1000000; i++){
    solve(i,1);
    solve(i,2);
  }
  puts("ok");
  while(1){
    scanf("%d",&n); if(!n) break;
    printf("%d %d\n",dp[0][n],dp[1][n]);
  }
}

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

vector<int> poloc;
vector<int> poloc_odd;

void make_poloc()
{
	int n=1;
	while(1){
		int a = n*(n+1)*(n+2)/6;
		if(a > 1000000)
			break;
		
		poloc.push_back(a);
		if(a % 2 == 1)
			poloc_odd.push_back(a); 
		n++;
	}
}
int search1(int n, int i, int depth)
{
	if(n == 0)
		return depth;
	else if(n < 0 || i < 0)
		return 1000000;
	else
		return min( min(search1(n-poloc[i],i-1,depth+1), search1(n,i-1,depth)), search1(n-poloc[i],i,depth+1));
}
int search2(int n, int i, int depth)
{
	if(n == 0)
		return depth;
	else if(n < 0 || i < 0)
		return 1000000;
	else
		return min( min(search2(n-poloc_odd[i],i-1,depth+1), search2(n,i-1,depth)), search2(n-poloc_odd[i],i,depth+1));		
}

int main()
{
	make_poloc();
	int n;
	
	while(cin >> n){
		if(n==0)
			break;
		cout << search1(n,static_cast<int>(poloc.size()-1),0) << " " << search2(n,static_cast<int>(poloc_odd.size()-1),0) << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[200]={0},b[150]={0},c[1000001]={0,1,2,3},d[1000001],k=0,i,j,n,p;
  for(i=1;a[i-1]<1000000;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0,p=i;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<p;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

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

using namespace std;

int n;

int dp[2][1000010], adp[2][1000010];
int INF = 1e9;

void solve() {
	for (int i=0; i<2; i++) {
		fill(dp[i], dp[i]+1000010, INF);
		fill(adp[i], adp[i]+1000010, INF);
	}
	
	dp[0][0] = 0;
	//adp[0][0] = 0;
	for (int i=0; i<200; i++) {
		int nw = i%2, nx = (i+1)%2;
		int add = i * (i+1) * (i+2) / 6;
		if (add > n) break;
		for (int j=0; j<=n; j++) {
			if (add <= j) {
				dp[nx][j] = min(dp[nw][j], dp[nx][j-add] + 1);
			} else {
				dp[nx][j] = dp[nw][j];
			}
			/*
			if (add%2==0) {
				adp[nx][j] = adp[nw][j];
			} else {
				if (add <= j) {
					adp[nx][j] = min(adp[nw][j], adp[nx][j-add] + 1);
				} else {
					adp[nx][j] = adp[nw][j];
				}
			}
			*/
		}
	}
	
	adp[0][0] = 0;
	int p = 0;
	for (int i=0; i<200; i++) {
		int add = i * (i+1) * (i+2) / 6;
		if (add%2 == 0) continue;
		if (add > n) break;
		
		int nw = p%2, nx = (p+1)%2;
		p++;
		
		for (int j=0; j<=n; j++) {
			if (add <= j) {
				adp[nx][j] = min(adp[nw][j], adp[nx][j-add] + 1);
			} else {
				adp[nx][j] = adp[nw][j];
			}
		}
	}
	
	int ans1 = INF, ans2 = INF;
	for (int i=0; i<2; i++) {
		ans1 = min(ans1, dp[i][n]);
		ans2 = min(ans2, adp[i][n]);
	}
	cout << ans1 << " " << ans2 << endl;
}

int main() {
	while (1) {
		cin >> n; if (n==0) break;
		solve();
	}
	
	return 0;
}

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

int main() {
  vector<int> s,sodd;
  for(int i=1; i*(i+1)*(i+2)/6 < 1000000; ++i) {
    s.push_back(i*(i+1)*(i+2)/6);
    if((i*(i+1)*(i+2)/6)%2 == 1)
      sodd.push_back(i*(i+1)*(i+2)/6);
  }

  vector<int> table(1000001, 0);
  vector<int> otable(1000001, 0);

  for(int i=0; i<s.size(); ++i)
    table[s[i]] = 1;

  for(int i=0; i<sodd.size(); ++i)
    otable[sodd[i]] = 1;

  for(int j=1; j < 1000001; ++j) {
    for(int i=0; i < s.size(); ++i)
      if(table[j] != 0 && j+s[i] < 1000001) {
	table[j + s[i]] = (table[j+s[i]]==0) ? table[j]+1 : min( table[j+s[i]], table[j]+1 );
      }
  }

  for(int j=1; j < 1000001; ++j) {
    for(int i=0; i < sodd.size(); ++i)
      if(otable[j] != 0 && j+sodd[i] < 1000001) {
	otable[j + sodd[i]] = (otable[j+sodd[i]]==0) ? otable[j]+1 : min( otable[j+sodd[i]], otable[j]+1 );
      }
  }

  int d;
  for(;;) {
    cin>>d;
    if(!d) break;
    cout<<table[d]<<" "<<otable[d]<<endl;
  }

}