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++: 
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1167

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

const int MAX = 1000100;

vector<int> list;
vector<int> odd;

void init()
{
	for(int i=1;;i++)
	{
		int num = i*(i+1)*(i+2)/6;
		if(num > MAX){ break; }
		list.push_back(num);
		if(num % 2){ odd.push_back(num); }
	}

	return;
}

int main()
{
	init();
	
	vector<int> dp(MAX,MAX);
	vector<int> odd_dp(MAX,MAX);
	
	dp[0] = 0;
	odd_dp[0] = 0;

	rep(i,list.size()){
		REP(j,list[i],MAX){
			dp[j] = min(dp[j], dp[j - list[i]] + 1);	
		}
	}

	rep(i,odd.size()){
		REP(j,odd[i],MAX){
			odd_dp[j] = min(odd_dp[j], odd_dp[j - odd[i]] + 1);	
		}
	}
	
	int N;
	while(cin >> N && N){
		cout << dp[N] << " " << odd_dp[N] << endl;	
	}

	return 0;
}

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

using namespace std;

vector<long long int> list,oddlist;

int oddrec(int target, int sum, int cnt) {
    int res=0xFFFF;
    if(cnt>100) return 0xFFFF;
    if(sum == target) return cnt;
    for(int i=oddlist.size()-1; 0<=i && res>cnt; i--) {
        if(sum+oddlist[i] > target) continue;
        res = min(res, oddrec(target, sum+oddlist[i], cnt+1));
    }
    return res;
}

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


    int listcnt, oddlistcnt;
    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;
                    }
                }
            }
        }

        printf("%d %d\n",res,oddrec(n, 0, 0));
    }





    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int INF = 99999999;
const int N = 1000000;

int dp[N+1], odd_dp[N+1];

int main(void) {
  vector<int> pollock, odd_pollock;
  for (int n = 1; n*(n+1)*(n+2)/6 <= N; n++) {
    int t = n*(n+1)*(n+2)/6;
    pollock.push_back(t);
    if (t%2) odd_pollock.push_back(t);
  }
  for (int i = 0; i <= N; i++) {
    dp[i] = INF;
    odd_dp[i] = INF;
  }
  for (int i = 0; i < pollock.size(); i++) {
    dp[pollock[i]] = 1;
  }
  for (int i = 0; i < odd_pollock.size(); i++) {
    odd_dp[odd_pollock[i]] = 1;
  }

  for (int i = 0; i < 5; i++) {
    for (int j = 1; j <= N; j++) {
      if (dp[j] != INF) {
        for (int k = 0; k < pollock.size(); k++) {
          if (j+pollock[k] > N) break;
          dp[j+pollock[k]] = min(dp[j]+1, dp[j+pollock[k]]);
        }
      }
      if (odd_dp[j] != INF) {
        for (int k = 0; k < odd_pollock.size(); k++) {
          if (j+odd_pollock[k] > N) break;
          odd_dp[j+odd_pollock[k]] = min(odd_dp[j]+1, odd_dp[j+odd_pollock[k]]);
        }
      }
    }
  }

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

  return 0;
}

C++: #include <iostream>
#include <algorithm>

using namespace std;
typedef long long ll;

#define REP_N(i,n,s) for(ll i=0; i<(ll)n; i+=s)
#define REP(i,n) REP_N(i,n,1)

ll table[1000000];
ll pollock[1000001];
ll dp[1000001];

void solution(ll output[1000001], int interval) {
	output[0] = 0;
	ll current_i = interval-1;
	REP(i, 1000001) if(i!=0) {
		ll minimum = 1000001;
		REP(j, current_i+1, interval) if(j!=0) minimum = min(output[i - table[j]] + 1, minimum);
		output[i] = minimum;

		if (table[current_i + interval] == i) current_i += interval;
	}
}

int main() {
	//freopen("Text.txt", "r", stdin);
	
	{
		ll i = 0;
		table[0] = 0;
		while (1000001 > table[i++]) table[i] = i*(i + 1)*(i + 2) / 6;
	}

	solution(pollock, 1);
	solution(dp, 4);

	while (true) {
		int n;
		cin >> n;
		if (n==0) break;
		
		cout << pollock[n] << " " << dp[n] << endl;
	}

}