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(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	vector < vector<bool> >dp(201, vector < bool>(1000001, 0));
	dp[0][0] = 1;
	REP(i, 5) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if (k > 100001)break;
			REP(l, 100001 - k) {
				if (dp[i][l])dp[i + 1][l + k] = 1;
			}
		}
	}
	REP(i, 6)REP(j, 1000001)dp[i][j] = 0;
	dp[0][0] = 1;
	REP(i, 200) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if (k % 2 == 0)continue;
			if (k > 100001)break;
			REP(l, 100001 - k) {
				if (dp[i][l])dp[i + 1][l + k] = 1;
			}
		}
	}
	while (1) {
		int n;
		cin >> n;
		if (!n)break;
		REP(i, 5) {
			if (dp[i + 1][n]) {
				cout << i + 1;
				break;
			}
		}
		cout << " ";
		REP(i, 200) {
			if (dp[i + 1][n]) {
				cout << i + 1 << endl;
				break;
			}
		}
	}
	return 0;
}

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

int main() {
    vector<int> dp(1000001, 1e9);
    vector<int> dp2(1000001, 1e9);
    dp[0] = dp2[0] = 0;
    for(int i=1; i*(i+1)*(i+2)/6 <= 1000000; ++i) {
        int l = i*(i+1)*(i+2)/6;
        for(int j=0; j+l<=1000000; ++j) {
            dp[j+l] = min(dp[j+l], dp[j] + 1);
        }
        if(l % 2 == 1) {
            for(int j=0; j+l<=1000000; ++j) {
                dp2[j+l] = min(dp2[j+l], dp2[j] + 1);
            }
        }
    }


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

C++: #include <iostream>
#include <cstdio>
#include <climits>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int i=a;i<n;i++)
#define dtm(i,n) rep(i,0,n)

int f(int n) {
	int ret;
	ret = n * (n+1) * (n+2) / 6;
	return ret;
}

int max_n;
int table[3000];
void make_table() {
	int i;
	for (i=0; i<1000000; i++) {
		int x = f(i);
		if (x > 1000000) break;
		table[i] = x;
	}
	max_n = i;
}

int memo[1000000];
int r(int n) {
	int i;
	if (n == 0) return 0;
	if (memo[n]) return memo[n];
	for (i=max_n-1; table[i]>n; i--) ;
	if (table[i] == n) {
		memo[n] = 1;
		return 1;
	}
	int m = INT_MAX;
	for (; i>=1; i--) {
		int x = 1 + r(n - table[i]);
		if (x < m) m = x;
	}
	memo[n] = m;
	return m;
}
int memo2[1000000];
int r2(int n) {
	int i;
	if (n == 0) return 0;
	if (memo2[n]) return memo2[n];
	for (i=max_n-1; table[i]>n; i--) ;
	if (n%2==1 && table[i] == n) {
		memo2[n] = 1;
		return 1;
	}
	int m = INT_MAX;
	for (; i>=1; i--) {
		if (table[i]%2==0) continue;
		int x = 1 + r2(n - table[i]);
		if (x < m) m = x;
	}
	memo2[n] = m;
	return m;
}

void solve(int n) {
	printf("%d %d\n", r(n), r2(n));
}

int main() {
	int n;
	make_table();
	for (;;) {
		scanf("%d", &n);
		if (n==0) break;
		solve(n);
	}
	return 0;
}

C++: #include <iostream>
#define MAX 1000000
#define INF 1000000000
using namespace std;

int dp1[MAX+1],dp2[MAX+2];

int main(){
    //INFで初期化
    for(int i = 1;i <= MAX;i++){
        dp1[i] = INF;
        dp2[i] = INF;
    }

    for(int n = 1;n * (n + 1) * (n * 2) /6 <= MAX;n++){
        int a = n * (n + 1) * (n + 2) / 6;  //ポロック数の生成
        for(int i = a;i <= MAX;i++)     //正四面体数の個数dp(a以下は必要ない)
            dp1[i] = min(dp1[i],dp1[i-a] + 1);  //更新しないor左側から更新する
        if(a % 2 == 0)continue;     //偶数の時は次のroopへ
        for(int i = a;i <= MAX;i++)     //奇数の正四面体数の個数dp(a以下は必要ない)
            dp2[i] = min(dp2[i],dp2[i-a] + 1);  //更新しないor左側から更新する
    }

    //入出力
    while(true){
        int n;
        cin >> n;
        if(n == 0)break;
        cout << dp1[n] << " " << dp2[n] << endl;
    }

    return 0;
}

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

using namespace std;

int all[1000001];
int odd[1000001];

int const INF = 1<<29;

int main() {
  
  fill(all, all+1000001, INF);
  fill(odd, odd+1000001, INF);
  
  all[0] = odd[0] = 0;
  
  for(int i=1; ; i++) {
    int n = i*(i+1)*(i+2)/6;
    if(n > 1000000) break;
    for(int j=n; j<=1000000; j++) {
      all[j] = min(all[j-n]+1, all[j]);
      if(n % 2) {
	odd[j] = min(odd[j-n]+1, odd[j]);
      }
    }
  }
  
  int N;
  while(cin >> N && N) {
    cout << all[N] << ' ' << odd[N] << endl;
  }
  
  return 0;
}