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<iostream>
#include<algorithm>
using namespace std;
int dp[2][1000000];
int v[1000];
int main()
{
	int n;
	for (int j = 0; j < 1000000; j++)
	{
		dp[0][j] = 999999;
		dp[1][j] = 999999;
	}
	dp[0][0] = 0;
	dp[1][0] = 0;
	for (int i = 1;i < 1000; i++)
	{
		int k = i * (i + 1) * (i + 2) / 6;
		if (k >= 1000000)break;
		v[i - 1] = k;
	}
	for (int i = 0; i < 1000000; i++)
	{
		for (int j = 0;j < 1000; j++)
		{
			if (i + v[j] >= 1000000)break;
			dp[0][i + v[j]] = min(dp[0][i + v[j]], dp[0][i] + 1);
			if (v[j] % 2 == 0)continue;
			dp[1][i + v[j]] = min(dp[1][i + v[j]], dp[1][i] + 1);
		}
	}
	while (cin >> n && n != 0)
	{
		cout << dp[0][n] << " " << dp[1][n] << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

const double pi  = 2 * acos(0.0);
const double eps = 1e-8;

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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef int Cost;
struct Edge {
  int src, dst; Cost cost;
  Edge(int s, int d, Cost c) : src(s), dst(d), cost(c) {}
};
typedef vector<Edge>  Edges;
typedef vector<Edges> Graph;
typedef vector<Cost>  Array;
typedef vector<Array> Matrix;

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

int memo[3000001];

int solve(int n, bool skip_even) {
  if (memo[n] != 0) return memo[n];
  if (n == 0) return 0;
  int mini = 1 << 30;
  for (int i = 1; i*(i+1)*(i+2)/6 <= n; i++) {
    if (skip_even && i*(i+1)*(i+2)/6 % 2 == 0) continue;
    mini = min(mini, solve(n-i*(i+1)*(i+2)/6, skip_even) + 1);
  }
  return memo[n] = mini;
}

int main(void) {
  ios_base::sync_with_stdio(false); cin.tie(0);
  int n;
  while (cin >> n, n) {
    fill(memo, memo + 3000001, 0);
    cout << solve(n, false) << " ";
    fill(memo, memo + 3000001, 0);
    cout << solve(n, true) << endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int p(int i){
  return i * (i + 1) * (i + 2) / 6;
}


int main(void){
  while(1){
    int n;
    cin >> n;
    if(n == 0){return 0;}

    /* ???????¨??????? */
    int ans1[n+1];
    int ans2[n+1];
    for(int i = 1 ; i < n + 1 ; i++){
      ans1[i+1] = -1;
      ans2[i+1] = -1;
    }

    for(int i = 1 ; p(i) < n + 1 ; i++){
      ans1[p(i)] = 1;
      if(p(i) % 2 == 1){ ans2[p(i)] = 1; }
    }

    for(int i = 2 ; i <= n ; i++){
      if(ans1[i] == 1){
      }else{
        int min = 100000;
        for(int j = 1 ; j < i ; j++){
          if(ans1[j] + ans1[i - j] < min){
            min = ans1[j] + ans1[i - j];
          }
        }
        ans1[i] = min;
      }
    }

    for(int i = 2 ; i <= n ; i++){
      if(ans2[i] == 1){
      }else{
        int min = 100000;
        for(int j = 1 ; j < i ; j++){
          if(ans2[j] + ans2[i - j] < min){
            min = ans2[j] + ans2[i - j];
          }
        }
        ans2[i] = min;
      }
    }


    cout << ans1[n] << " " << ans2[n] << endl;
  }
}

C++: #include <iostream>
#include <vector>
#include <cmath>
#include <cstring>

using namespace std;

int MAX;
vector<int> V;
vector<int> D;
int N;
int M;
bool dp[10][1000100] = {0};

void solve(int n) {
	memset(dp, 0, sizeof(dp));

	int ans = 1;

	for (int i=0; V[i]<=n; i++)
		dp[0][V[i]] = 1;

	for (int i=1; i<5 && !dp[i-1][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++) {
			if (!dp[i-1][j]) continue;
			for (int k=0; j+V[k]<=n; k++)
				dp[i][j+V[k]] = 1;
		}
	}

	cout << ans << " ";

	memset(dp, 0, sizeof(dp));

	ans = 1;

	for (int i=0; D[i]<=n; i++)
		dp[0][D[i]] = 1;

	for (int i=1; i<=1000000 && !dp[1-i%2][n]; i++) {
		ans++;
		for (int j=0; j<=n; j++)
			dp[i%2][j] = 0;
		for (int j=0; j<=n; j++) {
			if (!dp[1-i%2][j]) continue;
			for (int k=0; j+D[k]<=n; k++)
				dp[i%2][j+D[k]] = 1;
		}
		for (int j=0; j<=n; j++)
			dp[1-i%2][j] = dp[i%2][j];
	}

	cout << ans << endl;
}

int main() {
	MAX = (int)pow(10.0, 6);
	for (int i=1; i*(i+1)*(i+2)/6<=MAX; i++) {
		V.push_back(i*(i+1)*(i+2)/6);
		if ( V[i-1]%2==1 ) D.push_back(i*(i+1)*(i+2)/6);
	}
	N = (int)V.size();
	M = (int)D.size();

	int n;
	cin >> n;
	while (n!=0) { 
		solve(n);
		cin >> n;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>

using namespace std;

int INF = 10000000;
vector<int> po;
vector<int> poo;
vector<int> dp(1000005, INF);
vector<int> dp2(1000005, INF);

void init() {
    for (int i = 1;; i++) {
        int tmp = i*(i+1)*(i+2) / 6;
        if (tmp > 1000000) break;
        po.push_back(tmp);
        if (tmp%2 == 1) poo.push_back(tmp);
    }
    
    dp[0] = 0;
    for (int i = 0; i < 1000001; i++) {
        for (int j = 0; j < po.size(); j++) {
            int sum = i + po[j];
            if (sum <= 1000000) {
                dp[sum] = min(dp[sum], dp[i] + 1);
            }
        }
    }
    
    dp2[0] = 0;
    for (int i = 0; i < 1000001; i++) {
        for (int j = 0; j < poo.size(); j++) {
            int sum = i + poo[j];
            if (sum <= 1000000) {
                dp2[sum] = min(dp2[sum], dp2[i] + 1);
            }
        }
    }
}

int main(void){
    // Your code here!
    vector<pair<int, int>> ans;
    init();
    int N;
    while (cin >> N, N) {
        ans.push_back({dp[N], dp2[N]});
    }
    for (auto &p : ans) {
        cout << p.first << " " << p.second << endl;
    }
    return 0;
}