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>
using namespace std;

#ifdef LOCAL
#include "../dump.hpp"
#else
#define dump(...)
#endif

#define rep(i,n) for(ll i=0,i##_cond=(n);i<i##_cond;++i)
#define FOR(i,a,b) for(ll i=(a),i##_cond=(b);i<i##_cond;++i)
#define ROF(i,a,b) for(ll i=(a)-1,i##_cond=(b);i>=i##_cond;--i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend() //sortで大きい順
#define UNIQUE(v) v.erase(unique(all(v)),v.end())
#define SUM(a) accumulate(all(a),0)
#define sz(x) ((ll)(x).size())
#define pb push_back
#define fst first
#define snd second
#define mp make_pair

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<ll,ll> pii;

const ll inf = 1ll<<62;
const ll mod = 1e9+7;

#define n 1000000

int main(){
#define int ll
  int tmp = 1;
  vi a, b;
  while(1){
    int x = tmp * (tmp + 1) * (tmp + 2) / 6;
    if(x >= 1000000) break;
    a.pb(x);
    if(x & 1) b.pb(x);
    tmp++;
  }
  dump(a,b);
  
  vi dpa(n+1,inf),dpb(n+1,inf);
  dpa[0] = 0;
  dpb[0] = 0;
  rep(i,n){
    for(int j = 0; j < sz(a) and a[j] <= i + 1; ++j)
	dpa[i+1] = min(dpa[i+1], dpa[i + 1 - a[j]] + 1);
    for(int j = 0; j < sz(b) and b[j] <= i + 1; ++j)
	dpb[i+1] = min(dpb[i+1], dpb[i + 1 - b[j]] + 1);
  }
  while(1){
    int m;
    cin >> m;
    if(m == 0) break;

    cout << dpa[m] << " " << dpb[m] << endl;
  }
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>

#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#define all(x) (x).begin(),(x).end()

using namespace std;
const int inf = 1001001000;

void print(vector<vector<int>> a){
	for (int i=0;i<a.size();i++){
		for (int j=0;j<a[i].size();j++){
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}

void print(vector<vector<long long int>> a){
	for (int i=0;i<a.size();i++){
		for (int j=0;j<a[i].size();j++){
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}

void print(vector<int> a){
    int n = a.size();
    for (int j=0;j<n;j++) {
        if (j != n-1) cout << a[j] << " ";
        else cout << a[j] << endl;
    }
}

int main(){
	int m = 1000000 + 10;
		vector<int> p;
		for (int i = 0;;i++){
			p.push_back(i * (i + 1) * (i + 2) / 6);
			if (i * (i + 1) * (i + 2) / 6 > m)
				break;
		}

		vector<int> dp(m, inf);
		dp[0] = 0;
		vector<int> odd_dp(m, inf);
		odd_dp[0] = 0;
		rep(i, p.size())
		{
			rep(j,m){
				if (j - p[i] >= 0)
					dp[j] = min(dp[j], dp[j - p[i]] + 1);
				if (p[i] % 2 == 1){
					if (j - p[i] >= 0)
						odd_dp[j] = min(odd_dp[j], odd_dp[j - p[i]] + 1);
				}
			}
		}

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

	return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(int i = 0; i < n; i++)



int main() {
    ll s4[101];
    vector<ll> s4_k;
    s4[0] = 1;
    for(int i = 1; i < 101; i++){
        s4[i] = i * (i + 1) * (i + 2) / 6;
        if(s4[i] & 1){
            s4_k.push_back(i * (i + 1) * (i + 2) / 6);
            // cout << s4[i] << endl;
        }
    }
    vector<ll> dp1(1000001, INF), dp2(1000001, INF);
    dp1[0] = 0;
    REP(i, 101){
        REP(j, 1000001){
            if(s4[i] <= j){
                dp1[j] = min(dp1[j], dp1[j - s4[i]] + 1);
            }
        }
    }
    
    dp2[0] = 0;
    REP(i, s4_k.size()){
        REP(j, 1000001){
            if(s4_k[i] <= j){
                dp2[j] = min(dp2[j], dp2[j - s4_k[i]] + 1);
            }
        }
    }
    
    ll n;
    cin >> n;
    while(n != 0){
        cout << dp1[n] << ' ' << dp2[n] << endl;
        
        cin >> n;
    }
}

C++: #include <stdio.h>
#define INF 0x7FFFFFFF
 
int main(void){
    int i, j, n, min1,small;
    int dp[1000000];
    scanf("%d",&n);
    while(n != 0){
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(small > dp[i]){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
                if(small > dp[n])
                    small = dp[n];
        }
 
        min1 = dp[n];
        for(i = 0;i <= n;i++)
            dp[i] = INF;
        dp[0] = 0;
        small = INF;
        for(i = 0;i < n;i++){
            if(dp[i] < small){
                for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
                    if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1 && j * (j + 1) * (j + 2) / 6 % 2 == 1)
                        dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
                }
            }
            if(small > dp[n])
                small = dp[n];
        }
        printf("%d %d\n",min1,dp[n]);
        scanf("%d",&n);
    }
    return 0;
}