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 X first
#define Y second
#define pb push_back
#define eb emplace_back

#define rep(X,Y) for(int (X) = 0; (X) < (Y) ; ++(X))
#define all(X) (X).begin,(X).end
#define reps(i,j,k) for(inti=(j); i <= (k); ++(i))
#define sz size()
#define in(i,j,k) ((i) >= (j) && (i) <= (k))

using namespace std;

typedef pair<int,int> pii;

int d[2000000];
int dd[2000000];

int main(){
    
    vector<int> t;
    vector<int> k;
    int i = 0;
    rep(i, 2000000)d[i]=dd[i]=1000000000;
    while((i*(i+1)*(i+2))/6 <= 1000000){
        ++i;
        t.pb(i*(i+1)*(i+2)/6);
        if((i*(i+1)*(i+2)/6)%2) k.pb(i*(i+1)*(i+2)/6);
    }

    d[0] = dd[0] = 0;

    rep(i, 1000000){
        rep(j, t.sz){
            int tmp = i+t[j];
            if(tmp < 1000001)d[tmp] = min(d[tmp], d[i]+1);
        }
        rep(j, k.sz){
            int tmp = i+k[j];
            if(tmp < 1000001)dd[tmp] = min(dd[tmp], dd[i]+1);
        }
    }
    int n;

    while(scanf("%d", &n), n){
        printf("%d %d\n", d[n], dd[n]);
    }
    
    return 0;
}

C++: #include<iostream>
#include<set>
#include<map>

using namespace std;

/*sqrt<3>(NMAX)==100*/

int Nkake[100+1];
int g[1000001]={0};
int k[1000001]={0};

int main(){

	int N;
	
	for(int i=1;i<=100;i++){
		Nkake[i]=i*(i+1)*(i+2)/6;
	}

	for(int i=0;i<=1000000;i++){
		for(int j=1;j<100;j++){
			if(i+Nkake[j]<=1000000){
				if(g[Nkake[j]+i]==0||g[Nkake[j]+i]>g[i]+1) g[Nkake[j]+i]=g[i]+1;
			}
		}
	}

	for(int i=0;i<=1000000;i++){
		for(int j=1;j<100;j++){
			if(Nkake[j]%2==1&&i+Nkake[j]<=1000000){
				if(k[Nkake[j]+i]==0||k[Nkake[j]+i]>k[i]+1) k[Nkake[j]+i]=k[i]+1;
			}
		}
	}

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

		cout<<g[N]<<" "<<k[N]<<endl;
	}
}

C++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167&lang=jp

#include<iostream>
#include<fstream>


#define Max_Len 1000000

using namespace std;

int triCalc(int num){
	static short int count[Max_Len];
	static short int triangle[Max_Len];
	static bool f = true;
	if (f){//?????????
		for (int i = 0; i < Max_Len; i++)
			count[i] = triangle[i] = Max_Len;
		f = false;
	}
	int triNum;

	int i = 1;
	while (i * (i + 1) * (i + 2) / 6 <= num)i++;
	i--;
	triNum = i * (i + 1) * (i + 2) / 6;

	if (triNum == num)return 1;
	while (num / 5 < triNum){
		if (triangle[num - triNum] == Max_Len){
			if (count[num] > triCalc(num - triNum) + 1)
				count[num] = triCalc(num - triNum) + 1;
		}
		else if (count[num] > triangle[num - triNum] + 1)
			count[num] = triangle[num - triNum] + 1;

		i--;
		triNum = i * (i + 1) * (i + 2) / 6;
	}
	return triangle[num] = count[num];
}

int oddCalc(int num){
	static short int count[Max_Len];
	static short int triangle[Max_Len];
	static bool f = true;
	if (f){//?????????
		for (int i = 0; i < Max_Len; i++)
			count[i] = triangle[i] = Max_Len;
		f = false;
	}
	int triNum;

	int i = 1;
	while (i * (i + 1) * (i + 2) / 6 <= num)i++;
	i--;
	while ((i * (i + 1) * (i + 2) / 6 )% 2 == 0)i--;
	triNum = i * (i + 1) * (i + 2) / 6;

	if (triNum == num)return 1;
	while (i > 0){
		if (triangle[num - triNum] == Max_Len){
			if (count[num] > oddCalc(num - triNum) + 1)
				count[num] = oddCalc(num - triNum) + 1;
		}
		else if (count[num] > triangle[num - triNum] + 1)
			count[num] = triangle[num - triNum] + 1;

		i--;
		while ((i * (i + 1) * (i + 2) / 6) % 2 == 0)i--;
		triNum = i * (i + 1) * (i + 2) / 6;
	}
	return triangle[num] = count[num];
}

int main(){
/*
	ifstream fin;
	ofstream fout;

	fin.open("input.txt");
	fout.open("output.txt");
*/
	int n;


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

		cout << triCalc(n) << " " << oddCalc(n) << endl;
	}
	

	//cout << oddCalc(40);

	return 0;
}