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 <stdio.h>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <sstream>

using namespace std;

#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))

typedef complex<double> P;
typedef long long ll;

const int MAX_SIZE = 10000;

const int INF = 100000000;

int main(){

	int n;
//	int dp[1000001];
	vector<int> dp(1000001,0);
	vector<int> dp2(1000001,0);
	while(cin >> n && n != 0){
		vector<int> triNum;
		int sum = 1;
		int idx = 2;
		int allSum = 0;
		while(sum <= 1000000){
			allSum += sum;
			triNum.push_back(allSum);
			sum += idx;
			idx++;
		}
		fill(dp.begin(),dp.end(),INF);
		fill(dp2.begin(),dp2.end(),INF);
		dp[1] = 1;
		dp[2] = 2;
		dp[3] = 3;
		dp[0] = 0;

		dp2[1] = 1;
		dp2[2] = 2;
		dp2[3] = 3;
		dp2[0] = 0;


		for(int i = 4; i <= n; i++){
			for(int j = 0; j < triNum.size(); j++){
				if(i - triNum[j] == 0){
					if(triNum[j] % 2)
						dp2[i] = 1;
					break;
				}
				else if(i - triNum[j] < 0){
					break;
				}
				if(triNum[j] % 2)
					dp2[i] = min(dp2[i],dp2[i-triNum[j]]+1);
			}

			for(int j = 0; j < triNum.size(); j++){
				if(i - triNum[j] == 0){
					dp[i] = 1;
					break;
				}
				else if(i - triNum[j] < 0){
					break;
				}
				dp[i] = min(dp[i],dp[i-triNum[j]]+1);
			}
		}
		cout << dp[n] << " " << dp2[n] << endl;
	}

	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n=1000001;
    vector<int> dp(n,inf),dp2(n,inf);
    dp[0]=dp2[0]=0;
    vector<int> a;
    rep(i,300){
        int x=(i+1)*(i+2)*(i+3)/6;
        if(x>n)break;
        a.push_back(x);
    }
    rep(i,a.size()){
        rep(j,n)if(j+a[i]<n)dp[j+a[i]]=min(dp[j+a[i]],dp[j]+1);
        if(a[i]%2==0)continue;
        rep(j,n)if(j+a[i]<n)dp2[j+a[i]]=min(dp2[j+a[i]],dp2[j]+1);
    }
    int x;
    while(cin>>x,x!=0){
        cout<<dp[x]<<" "<<dp2[x]<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <set>
#define MAXNUM 1000000
using namespace std;

int all[MAXNUM], odd[MAXNUM];
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 main()
{
	int n;
	int counter = 0;

	//1からMAXまでの中に存在する正四面体数を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);
	}

	//入力
	while (cin >> n, n)
		cout << all[n] << " " << odd[n] << 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]);
			if (minnum == 2)
				break;
		}
		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]);
			if (minnum == 2)
				break;
		}
		return minnum;
	}
}

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

      
  }
  return 0;
}