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 <algorithm>
#include <iostream>

using namespace std;

int dp1[100010]={0};
int dp2[100010]={0};
int List[100];

void setpolloc(){
	int i,j,li;
	for(i=1;i*(i+1)*(i+2)/6<=100000;i++){
		List[i]=i*(i+1)*(i+2)/6;
		dp1[i*(i+1)*(i+2)/6]=1;
		if((i*(i+1)*(i+2)/6)%2) dp2[i*(i+1)*(i+2)/6]=1;
	}
	List[i]=i*(i+1)*(i+2)/6;
	for(i=1;i<=100000;i++){
		if(dp2[i]) continue;
		for(j=1;List[j]<=i-1;j+=2)if(!dp2[i] || dp2[List[j]]+dp2[i-List[j]] < dp2[i]) dp2[i]=dp2[List[j]]+dp2[i-List[j]];
		if(dp1[i]) continue;
		for(j=1;List[j]<=i-1;j++) if(!dp1[i] || dp1[List[j]]+dp1[i-List[j]] < dp1[i]) dp1[i]=dp1[List[j]]+dp1[i-List[j]];
	}
}


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

C++: #include <iostream>

using namespace std;

typedef long long ll;


ll memo[250000];
ll memo2[250000];

ll calc(int n) {
  return n * (n + 1) * (n + 2) / 6;
}

int dfs(int depth, int n) {
  int ans = 9999;
  if (n < 250000 && memo[n] != 0) return memo[n];
  for (int i = n; i >= 1; i--) {
    ll t = calc(i);
    if (n - t < 0) continue;
    if (n - t == 0) {
      if (n < 250000) {
	memo[n] = depth;
      }
      return depth;
    }
    ans = min(ans, dfs(depth + 1, n - t));
  }
  if (n < 250000)
    memo[n] = ans;
  return ans;
}

int dfs_odd(int depth, int n) {
  int ans = 9999;
  if (n < 250000 && memo2[n] != 0) return memo2[n];
  for (int i = n; i >= 1; i--) {
    if (i % 2 == 0) continue;
    ll t = calc(i);
    if (t % 2 == 0) continue;
    if (n - t < 0) continue;
    if (n - t == 0) {
      if (n < 250000)
	memo2[n] = depth;
      return depth;
    }
    ans = min(ans, dfs_odd(depth + 1, n - t));
  }
  if (n < 250000)
    memo2[n] = ans;
  return ans;
}
  
int main() {
  int N;
  while (cin >> N, N != 0) {
    for (int i = 0; i < 250000; i++) {
      memo[i] = 0;
      memo2[i] = 0;
   }
    cout << dfs(1, N) << " " << dfs_odd(1, N) << endl;
  }

  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[200]={0},b[150]={0},c[1500001]={0,1,2,3},d[1500001],k=0,i,j,n,p;
  for(i=1;a[i-1]<1100000;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-1;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 <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600

bool   dp[6][1000001];
bool dp2[38][1000001];

int main(){
  int n=1;
  vector<int> vec, vec2;
  int tmp=0;
  while(tmp<=1000000){
    tmp+=n*(n+1)/2;
    vec.pb(tmp);
    if(tmp%2==1) vec2.pb(tmp);
    n++;
  }
  // dp[i][j] : i???????????£???j?????°????????????
  dp[0][0]=true;
  repl(i,1,5+1){
    for(int upd : vec){
      rep(j, 1000001){
        dp[i][j] = dp[i][j] | dp[i-1][j];
        if(j-upd>=0 && dp[i-1][j-upd]) dp[i][j] = true;
      }
    }
  }
  dp2[0][0]=true;
  repl(i,1,38){
    for(int upd : vec2){
      rep(j, 1000001){
        dp2[i][j] = dp2[i][j] | dp2[i-1][j];
        if(j-upd>=0 && dp2[i-1][j-upd]) dp2[i][j] = true;
      }
    }
  }

  while(cin>>n, n){
    int res=1;
    while(dp[res][n]==false) res++;
    cout<<res<<" ";
    res=1;
    while(dp2[res][n]==false) res++;
    cout<<res<<endl;
  }
  return 0;
}

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

set<int> allfour, oddfour;
int max(int a, int b);
int min(int a, int b);
int getall(int n);
int getodd(int n);
int *all, *odd;

int main()
{
	int n, t[100];
	int counter = 0;

	//入力
	while (cin >> n, n)
		t[counter++] = n;
	int maxnum = 0;

	//入力値の最大を取得
	for (int i = 0; i < counter; i++)
		maxnum = max(maxnum, t[i]);

	all = new int[maxnum+1];
	odd = new int[maxnum+1];


	//1からmaxnumまでの中に存在する正四面体数をsetに入れる．
	int now = 0, four;
	while (1){
		now++;
		four = now  *(now + 1)*(now + 2) / 6;
		if (four>maxnum)
			break;
		allfour.insert(four);
		if (four % 2 == 1)
			oddfour.insert(four);
	}

	//1からmaxnumまで，配列を埋める.
	for (int i = 1; i <= maxnum; i++){
		all[i] = getall(i);
		odd[i] = getodd(i);
	}

	//出力
	for (int i = 0; i < counter; i++)
		cout << all[t[i]] << " " << odd[t[i]] << endl;

	return 0;

}




int max(int a, int b){
	if (a > b)
		return a;
	else
		return b;
}

int min(int a, int b){
	if (a > b)
		return b;
	else
		return a;
}

int getall(int n){
	set<int>::iterator it = allfour.find(n);
	if (it != allfour.end())
		return 1;
	else{
		int minnum = 1000;
		for (int i = 1; i < n / 2 + 1; i++){
			minnum = min(minnum, all[i] + all[n - i]);
		}
		return minnum;
	}
}

int getodd(int n){
	set<int>::iterator it = oddfour.find(n);
	if (it != oddfour.end())
		return 1;
	else{
		int minnum = 1000;
		for (int i = 1; i < n / 2 + 1; i++){
			minnum = min(minnum, odd[i] + odd[n - i]);
		}
		return minnum;
	}
}