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>
using namespace std;
int x,y;
int m[1000005]={};
int memo[1000005]={};
int memo2[1000005]={};
vector<int> odd;
void saiki(int n,int d){
  int i,j;
  //cout << n << ":" << d << ":" << x << endl;
  if(n==0) {
    //cout << x << d << endl;
    x=min(x,d);
  }else if(n>0) {
    if(memo[n]>0){
      x=min(x,memo[n]+d);
    }else{
      for(i=1;m[i]<=n;i++);
      i--;
      int b=x;
      for(j=i;j>0;j--){
	if(x>d+1)
	  saiki(n-m[j],d+1);
      }
      if(x<b)
	memo[n]=x-d;
	
      //cout << n << ":" << memo[n]<< endl;
    }
  }
}
void saiki2(int n,int d){
  int i,j;
  //cout << n << ":" << d << endl;
  if(n==0) {
    y=min(y,d);
  }else if(n>0) {
    if(memo2[n]>0){
      y=min(y,memo2[n]+d);
    }else{
      for(i=0;odd[i]<=n;i++);
      i--;
      int b=y;
      //cout << i << ":" << n << ":" << odd[i] << endl;
      for(j=i;j>=0;j--){
	if(y>d+1){
	  saiki2(n-odd[j],d+1);
	}
      }
      if(y<b)
	memo2[n]=y-d;
    }
  }
}
int main(){
  int i,j,k;
  fill(memo,memo+1000005,-1);
  fill(memo2,memo2+1000005,-1);
  for(i=1;i<1000005;i++) {
    m[i]=i*(i+1)*(i+2)/6;
    if(m[i]%2==1) odd.push_back(m[i]);
  }
  int n;
  cin >> n;
  while(n!=0){
    x=1<<10;y=x;
    saiki(n,0);saiki2(n,0);
    cout << x << " " <<  y << endl;
    cin >> n;
  }
  return 0;
}

C++: #include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <numeric>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define PREP(it,array) for(vector<P>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)

#define MP       make_pair
#define PB       push_back
#define ALL(x)   (x).begin(),(x).end()

const int INF = 1<<29;
const double EPS = 1e-9;
double zero(double d){
  return d < EPS ? 0.0 : d;
}

typedef long long LL;
typedef pair<int,int> P;


const int N=1000000;
int dp[N], oddDp[N];
const int M=200;
int p[M];


int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(7);


  p[0]=INF;
  for(int i=1; i<M; i++){
    int num = i*(i+1)*(i+2)/6;
    p[i]=num;
  }

  fill( dp, dp+N, INF );
  fill( oddDp, oddDp+N, INF );
  dp[0] = 0;
  oddDp[0] = 0;

  REP(i,N){

    REP(j,M){
      if( i-p[j] >= 0 ){
	if( p[j] %2 == 1 )
	  oddDp[i] = min( oddDp[i], oddDp[i-p[j]]+1 );
	dp[i] = min( dp[i], dp[i-p[j]]+1 );
      }
    }

  }

  int n;
  while(cin>>n,n){
    cout << dp[n] << " " << oddDp[n] << endl;
  }
  

  return 0;
}

C++: 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
using namespace std;

const int MAX_N = 1e6; 
vector<int>dp1, dp2;
vector<int>tetra;

int main(void)
{
	int n = 1;
	do
	{
		tetra.push_back(n * (n + 1) * (n + 2) / 6);
		++n;
	} while (tetra.back() <= MAX_N);
	dp1.push_back(0);
	dp2.push_back(0);
	for (int i = 1; i <= MAX_N; ++i)
	{
		int a1 = INT_MAX, a2 = INT_MAX;
		for (int t : tetra)
		{
			if (t > i)break;
			a1 = min(a1, dp1[i - t] + 1);
			if (t % 2)
			{
				a2 = min(a2, dp2[i - t] + 1);
			}
		}
		dp1.push_back(a1);
		dp2.push_back(a2);
	}
	int x;
	while (cin >> x, x)
	{
		cout << dp1[x] << " " << dp2[x] << endl;
	}
	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;
}