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 <algorithm>
#define N 1000000
#define INFINITY 2000000000
using namespace std;
int main(){
  int n,cpn,data[N],i,cnt,minv,cal,l;
  for(i=1;i<=N;i++) data[i]=(i*(i+1)*(i+2))/6;
  while(1){
    cin >> n;
    if(n==0) break;
    cnt=n;
    cpn=n;
    minv=INFINITY;
    l=0;
    while(cnt){
      n=cpn;
      cal=0;
      for(i=n-l;i>=1;i--){
	cal+=n/data[i];
	n%=data[i];
      }
      minv=min(minv,cal);
      cnt--;
      l++;
    }
    cout << minv;
    n=cpn;
    cnt=n;
    minv=INFINITY;
    l=0;
    while(cnt){
      n=cpn;
      cal=0;
      for(i=n-l;i>=1;i--){
	if(data[i]%2==1){
	  cal+=n/data[i];
	  n%=data[i];
	}
      }
      minv=min(minv,cal);
      cnt--;
      l++;
    }
    cout << ' ' << minv << 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 ans_tmp=0;
    int ans2_tmp=0;

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


    int ans1=ans_tmp;

    int dp2[100000];
    
    for(int i=0;i<100000;i++)
      dp2[i]=100000;



    dp2[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp2[i+coin_ki[j]]=min(dp2[i+coin_ki[j]],dp2[i]+1);
	  ans2_tmp=min(dp2[i+coin_ki[j]],dp2[i]+1);
	  dp2[i+coin_ki[j]]=ans2_tmp;
	}
      }
    }
   
    
    int ans2=ans2_tmp;
    
    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
vector<int>vec;
int dp[1000005][2];
int main(){
    for(int i=1;;i++){
        int x = i*(i+1)*(i+2)/6;
        if(x > 1000000) break;
        vec.push_back(x);
    }
    rep(i,1000005) dp[i][0] = dp[i][1] = 1e9;
    dp[0][0] = dp[0][1] = 0;
    for(int i=0;i<vec.size();i++){
        for(int j=0;j<=1000000;j++){
            if(j+vec[i] <= 1000000) dp[j+vec[i]][0] = min(dp[j+vec[i]][0],dp[j][0]+1);
            if(vec[i]%2==1 && j+vec[i] <= 1000000) dp[j+vec[i]][1] = min(dp[j+vec[i]][1],dp[j][1]+1);
        }
    }
    while(1){
        int n; cin>>n; if(n==0) return 0;
        cout << dp[n][0] << " " << dp[n][1] << endl;
    }
}

C++: #include <cstring>
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <complex>
#include <queue>
#include <stack>
#include <string>
#include <cmath>
#include <bitset>

#define rep(i,a) for(int i = 0;i < (a); i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)
#define repd(i,a,b) for(int i = (a); i >= (b); i--)
#define repit(i,a) for(__typeof((a).begin()) i = (a).begin(); i != (a).end(); i++)
#define all(u) (u).begin(),(u).end()
#define rall(u) (u).rbegin(),(u).rend()
#define UNIQUE(u) (u).erase(unique(all(u)),(u).end())
#define pb push_back
#define mp make_pair
#define INF 1e10
#define EPS 1e-10
#define PI acos(-1.0)

using namespace std;

typedef long long ll;
typedef vector<int> vi;

const int N = 1000000;

int a[N], b[N];

void gen() {
  memset(a, 37, sizeof(a));
  memset(b, 37, sizeof(b));
  a[0] = b[0] = 0;

  for (int i = 1, d = 1; d < N; ++i, d += i * (i + 1) / 2) {
    for (int j = d; j < N; ++j) {
      a[j] = min(a[j], a[j - d] + 1);
      if (d & 1)
	b[j] = min(b[j], b[j - d] + 1);
    }
  }
}

int main() {
  gen();

  int n;
  while (cin >> n && n)
    cout << a[n] << ' ' << b[n] << endl;

  return 0;
}

C++: #include <iostream>
using namespace std;
const int  N = 1000100;

int t1[200];
int t2[200];
int dp1[N] = {0};
int dp2[N] = {0};

int main(){
	int i,j,k=2,s;
	
	t1[1] = t2[1] = dp1[1] = dp2[1] = 1;
	for(i = 2; i < 200; i++){
		t1[i] = t1[i-1] * (i+2) / (i-1);
		if(t1[i] > 1e+6) break;
		dp1[t1[i]] = 1;
		if(t1[i]%2){ dp2[t1[i]] = 1; t2[k++] = t1[i];}
	}
cout << t2[199];
	for(i = 2; i < N; i++){
		if(dp2[i]) continue;
		for(j = 1; t2[j] < i && j < 200; j++){
			if((1 + dp2[i-t2[j]]) < (dp2[i])){
				dp2[i] = 1 + dp2[i-t2[j]];
			}
		}
		if(dp1[i]) continue;
		for(j = 1; t1[j] < i; j++){
			if((1 + dp1[i-t1[j]]) < (dp1[i])){
				dp1[i] = 1 + dp1[i-t1[j]];
			}
		}
	}

	while(cin >> s, s)
		cout << dp1[s] << ' ' << dp2[s] << endl;

	return 0;
}