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>
using namespace std;

int main(void){
  
  int i, input, tetras[200] = {0}, ans[100][100] = {{0}, {0}};

  for (i = 1; i <= 180; i++) {
    tetras[i] = i * (i+1) * (i+2) / 6;
  }

  int a = 0;
  while (cin >> input) {
    if (input == 0) break;
    int temp = input;
    int j = 1, min = 1000000000;
    while (tetras[j] <= input) {
      int n = 0;
      int k = j;
      while (input > 0) {
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j++;
      input = temp;
    }
    ans[a][0] = min;
    j = 1, min = 1000000000;
    while (tetras[j] <= input) {
      int n = 0;
      int k = j;
      while (input > 0) {
	if (tetras[k] % 2 == 0) {
	  k--;
	  continue;
	}
	input -= tetras[k];
	if (input >= 0) {
	  n++;
	} else {
	  input += tetras[k];
	  k--;
	  continue;
	}
      }
      if (min > n) min = n;
      j++;
      input = temp;
    }
    ans[a][1] = min;
    a++;
  }

  int b;
  for (b = 0; b < a; b++) {
    cout << ans[b][0] << ' ' << ans[b][1] << endl;
  }
  
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define  M 1e6
using namespace std;
typedef long long int ll;
vector<ll> x,y;
ll f(int n){
	return n*(n+1)*(n+2)/6;
}
void make(void){
	int i=1;
while(f(i)<M){
x.push_back(f(i));
if(f(i)%2==1){
	y.push_back(f(i));
}
	i++;
}
}
int main(void){
	make();
vector<ll> num(M,6),num2(M,1000000);
for(ll i=0;i<x.size();i++){
num[x[i]]=1;
}
for(ll i=0;i<y.size();i++){
	num2[y[i]]=1;
}
for(ll i=0;i<x.size();i++){
	for(ll j=x[i];j<M;j++){
		num[j]=min(num[j],num[j-x[i]]+1);
	}
}
for(ll i=0;i<y.size();i++){
	for(ll j=y[i];j<M;j++){
		num2[j]=min(num2[j],num2[j-y[i]]+1);
	}
}
int n;

while(1){
	cin>>n;
	if(n==0)break;

	cout<<num[n]<<" "<<num2[n]<<endl;
}
return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#define N 1000000

using namespace std;

int main(){
	vector<int> sq;
	vector<int> sqodd;
	int a[N];
	int aodd[N];
	for(int i = 1; i * (i + 1) * (i + 2) < N; i++)  sq.push_back((i * (i + 1) * (i + 2)) / 6);
	for(int i = 1; i * (i + 1) * (i + 2) < N; i++){
		if(((i * (i + 1) * (i + 2)) / 6) % 2) sqodd.push_back((i * (i + 1) * (i + 2)) / 6);
	}
	for(int i = 0; i < N; i++) a[i] = N;
	for(int i = 0; i < N; i++) aodd[i] = N;
	for(int i = 0; i < sq.size(); i++) a[sq[i]] = 1;
	for(int i = 0; i < sqodd.size(); i++) aodd[sqodd[i]] = 1;
	for(int i = 1; i < N; i++){
		if(a[i] == N) continue;
		for(int j = 0; j < sq.size(); j++){
			if(sq[j] + i < N && a[sq[j] + i] > a[i] + 1) a[sq[j] + i] = a[i] + 1;
		}
	}
	for(int i = 1; i < N; i++){
		if(aodd[i] == N) continue;
		for(int j = 0; j < sqodd.size(); j++){
			if(sqodd[j] + i < N && aodd[sqodd[j] + i] > aodd[i] + 1) aodd[sqodd[j] + i] = aodd[i] + 1;
		}
	}	
	int n;
	while(cin >> n, n) cout << a[n] << " " << aodd[n] << 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 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);
	  tmp=1;
	  //tmp=min(dp[i+coin[j]],dp[i]+1);
	  dp[i+coin[j]]=tmp;
	}
      }
    }


    int ans1=dp[x];

  
    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_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	  tmp=1; 
	  tmp=min(dp[i+coin_ki[j]],dp[i]+1);
	  //dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    
    int ans2=dp[x];
    
    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,b,n) for(int i=b;i<n;i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main(){
	int n;
	int A[1000000];
	int B[1000000];
	A[0]=B[0]=0;
	for(int i = 1; i<1000000;i++){
		A[i] = i;
		B[i] =i;
		for(int j=1;;j++){
			int t =j*(j+1)*(j+2)/6;
			if(t > i)
				break;
			A[i]=min(A[i],A[i-t]+1);
			if(t%2==1)
				B[i]=min(B[i],B[i-t]+1);
		}
	}
	while(cin>>n,n){
		if(n==0)
			break;
		cout <<A[n]<<" "<<B[n]<<endl;
	}
	return 0;
}