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 <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;
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int MOD=1e9+7;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  std::vector<int> v,odd;
  for(int i=1;i*(i+1)*(i+2)/6<=6*1e6;i++){
      int tmp=i*(i+1)*(i+2)/6;
      v.push_back(tmp);
      if(tmp%2) odd.push_back(tmp);
  }
  std::vector<int> dp(1e6+1),odddp(1e6+1);
  for(int i=1;i<=1e6;i++){
      dp[i]=i;odddp[i]=i;
  }
  for(int i=1;i<=1e6;i++){
      for(int j=0;j<(int)v.size();j++){
          if(i-v[j]>=0) dp[i]=min(dp[i],dp[i-v[j]]+1);
      }
      for(int j=0;j<(int)odd.size();j++){
          if(i-odd[j]>=0) odddp[i]=min(odddp[i],odddp[i-odd[j]]+1);
      }
  }
  while(cin>>n,n){
      cout<<dp[n]<<" "<<odddp[n]<<endl;
  }
  return 0;
}

C++: #include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cstring>

using namespace std;

vector<long long int> list,oddlist;
int listcnt, oddlistcnt;
int ress;

int oddrec(int target, int sum, int cnt, int maxcnt) {
  int res=0xFFFF;
  if(maxcnt<cnt) return 0xFFFE;
  if(sum == target) return cnt;
  for(int i=oddlistcnt-1; 0<=i; i--) {
    if(sum+oddlist[i] > target) continue;
    res = min(res, oddrec(target, sum+oddlist[i], cnt+1, maxcnt));
    if(res==0xFFFE) break;
  }
  return res;
}
void mama(int x){
  if(x==0) return;
  int tmp[oddlistcnt];
  memset(tmp,0,sizeof(tmp));
  for(int i=0;i<oddlistcnt;i++){
    tmp[i]=x/oddlist[i];
    if(tmp[i]==0) {
      ress+=tmp[i-1];
//    cout << ress << endl;
      mama(x-tmp[i-1]*oddlist[i-1]);
      break;
    }
  }
}


int main(void) {
  for(long long int i=1; i*(i+1)*(i+2)/6<1e6; i++) {
    list.push_back(i*(i+1)*(i+2)/6);
    if(i*(i+1)*(i+2)/6 % 2)
      oddlist.push_back(i*(i+1)*(i+2)/6);
  }


  listcnt = list.size();
  oddlistcnt = oddlist.size();
  while(true) {
    int n;
    scanf("%d",&n);
    if(!n) break;

    int res=5, oddres=1000;
    for(int i=listcnt-1; 0<=i; i--) {
      if(list[i]>n) continue;
      if(list[i]==n){ res=1; break; }
      if(res<=2) continue;
      for(int j=listcnt-1; 0<=j; j--) {
        if(list[i] + list[j]>n) continue;
        if(list[i] + list[j]==n) res=2;
        if(res<=3) continue;
        for(int k=listcnt-1; 0<=k; k--) {
          if(list[i] + list[j] + list[k]>n) continue;
          if(list[i] + list[j] + list[k]==n) res=3;
          if(res<=4) continue;
          for(int l=listcnt-1; 0<=l; l--) {
            if(list[i] + list[j] + list[k] + list[l]>n) continue;
            if(list[i] + list[j] + list[k] + list[l]==n) res=4;
            if(res<=4) break;
          }
        }
      }
    }

    /*        if((oddres=oddrec(n, 0, 0, 1))>=0xFFFE) {
              for(int i=2; ; i=i*3/2) {
              if((oddres=oddrec(n, 0, 0, i))<0xFFFE)
              break;
              }
              }

              printf("%d %d\n",res,oddres);

     * p    */
    ress=0;
    mama(n);
    printf("%d %d\n",res,ress);
  }





  return 0;
}