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 <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

using namespace std;

int main(){
  int n;
  while(cin>>n,n){
    vector<int> four;
    for(int i=1;i*(i+1)*(i+2)/6<=n;i++){
      four.push_back(i*(i+1)*(i+2)/6);
    }
    vector<int> dp(n+1,1000000);
    dp[0]=0;
    for(int i=0;i<four.size();i++){
      for(int j=four[i];j<=n;j++){
	dp[j] = min(dp[j-four[i]] + 1,dp[j]);
      }
      /*      REP(i,n+1)cout << dp[i] << " ";
	      cout << endl;*/
	}
    cout << dp[n] << " ";
    dp.clear();
    dp.resize(n+1,10000000);
    dp[0]=0;
    for(int i=0;i<four.size();i++){
      if(four[i]%2){
	for(int j=four[i];j<=n;j++){
	  dp[j] = min(dp[j-four[i]] + 1,dp[j]);
	}
      }
      /*            REP(i,n+1)cout << dp[i] << " ";
		    cout << endl;*/
    }
 
    cout << dp[n] << endl;
  }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[200],b[150],c[1000010],d[1000010],k=0,i,j,n;

  for(i=1;i<200;i++)a[i-1]=i*(i+1)*(i+2)/6;

  for(j=0;j<i;j++)if(a[j]%2)b[k++]=a[j];

  for(i=0;i<1000010;i++)c[i]=d[i]=i;

  for(i=1;i<198;i++)for(j=a[i];j<1000010;j++){
    c[j]=min(c[j],c[j-a[i]]+1);
  }
  for(i=1;i<k-1;i++)for(j=b[i];j<10000010;j++){
    d[j]=min(d[j],d[j-b[i]]+1);
  }
 while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

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;



int N=100000;
int dp[100000], oddDp[100000];
vector<int> sqNum;
vector<int> oddSqNum;

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


  for(int i=1; i<202; i++){
    int num = i*(i+1)*(i+2)/6;
    sqNum.PB( num );
    if(num%2==1)
      oddSqNum.PB( num );
  }

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

  REP(i,N){
    REP(j,sqNum.size()){
      if( i-sqNum[j] >= 0 ){
	dp[i] = min( dp[i], dp[i-sqNum[j]]+1 );
      }
    }

    REP(j,oddSqNum.size()){
      if( i-oddSqNum[j] >= 0 ){
	oddDp[i] = min( oddDp[i], oddDp[i-oddSqNum[j]]+1 );
      }	
    }
  }

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

  return 0;
}

C++: #include<stdio.h>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <functional>
#include <stdio.h>
#include <array>
#include <algorithm>
#include <string>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <queue>
#include<iomanip>
#include<bitset>
#include<stack>
#include<set>
#include<limits>
#include <complex>
using namespace std;


vector<int>nums;
vector<int>oddnums;

vector<vector<short>>memo(100001, vector<short>(190,-1));
vector<vector<short>>oddmemo(100001, vector<short>(50,-1));

int getans(const int num, const int used,const int atime) {
	if (memo[num][used] != -1) {
		return memo[num][used];
	}
	else {
		if (num == 0)return memo[num][used] = 0;
		if (atime > 10)return atime;
		int ans = num;
		for (int i = 0; i <= used; ++i) {
			int minusnum = nums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 10) {
				continue;
			}
			ans = min(ans, getans(num - minusnum, i, atime + 1)+1);
		}

		return memo[num][used] = ans;
	}
}
int getoddans(const int num, const int used, const int atime) {
	if (oddmemo[num][used] != -1) {
		return  oddmemo[num][used];
	}
	else {
		if (num == 0)return oddmemo[num][used] = 0;
		if (atime > 100)return atime;
		int ans = num;
		for (int i = 0; i <= min(int(oddnums.size()),used); ++i) {
			int minusnum = oddnums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 100) {
				continue;
			}
			ans = min(ans, getoddans(num - minusnum, i, atime + 1) + 1);
		}

		return  oddmemo[num][used] = ans;
	}
}
int main() {
	for (int i = 1; i < 190; ++i) {
		nums.push_back(i*(i + 1)*(i + 2) / 6);
		if (((i*(i + 1)*(i + 2)) / 6) % 2) {

		
			oddnums.push_back((i*(i + 1)*(i + 2)) / 6);
		}
	}

	while (1) {
		int n; cin >> n;
		if (!n)break;
		int normalans = getans(n, 189, 0);;
		int oddans = getoddans(n, 47, 0);

		cout << normalans << " " << oddans << endl;
	}
	return 0;
}