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 <vector>
#include <limits>

int main()
{
  std::vector<int> data;
  while(true){
    int n;
    std::cin >> n;
    if(n!=0) data.push_back(n);
    else break;
  }
  std::vector<long long> num_tet;
  std::vector<long long> num_odd_tet;
  for (int i = 1; i < 200; i++){
    long long num = i*(i+1)*(i+2)/6;
    num_tet.push_back(num);
    if(num%2==1) {
      // std::cout << "i "<<i << std::endl;
      num_odd_tet.push_back(num);
    }
    // std::cout << "num "<< num << std::endl;
  }
  //dp[i+1][j] i番目までの正四面体数で整数jを実現するための最小手数
  int inf = std::numeric_limits<int>::max();
  // std::vector<std::vector<long long>> dp(num_tet.size()+5, std::vector<long long>(1e6+100, inf));
  // std::vector<int> ad(1e6);  // std::vector<std::vector<int>> dp((int)num_tet.size()+5, std::vector<int>(1e6, inf));

  std::vector<long long> dp(1e6+100, inf);
  dp[0] = 0;
  for (int i = 0; i < num_tet.size() ; i++){
    std::vector<long long> new_dp(1e6+100, inf);
    for (int j = 0; j < 1e6+10; j++){
      if(j-num_tet[i] < 0) new_dp[j] = dp[j];
      else new_dp[j] = std::min(dp[j], new_dp[j-num_tet[i]]+1);
    }
    dp = new_dp;
  }

  std::vector<long long> odd_dp(1e6+100, inf);
  odd_dp[0] = 0;
  for (int i = 0; i < num_odd_tet.size(); i++){
    std::vector<long long> new_odd_dp(1e6+100, inf);
    for (int j = 0; j < 1e6+10; j++){
      if(j-num_odd_tet[i] < 0) new_odd_dp[j] = odd_dp[j];
      else new_odd_dp[j] = std::min(odd_dp[j], new_odd_dp[j-num_odd_tet[i]]+1);
    }
    odd_dp = new_odd_dp;
  }

  for(const auto& d: data){
    std::cout << dp[d]<< " "<< odd_dp[d] << std::endl;
  }
  // std::cout << dp[40] << std::endl;
  // for (int i = 0; i < data.size(); i++){
  //   std::cout  <<i << " "<<i<< std::endl;
  // }
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#define INF 1<<28
using namespace std;
 
int p[1111111];
int memo[1111111];
int memo2[1111111];
 
int solve(int n){
   
  if(!n) return 0;
  if(~memo[n]) return memo[n];
 
  int ans = INF;
  for(int i=199;i>0;i--) if(n >= p[i]) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(~memo2[n]) return memo2[n];
 
  int ans = INF;
  for(int i=0;p[i]<=n;i++) if(p[i]&1 && n >= p[i]) ans = min(ans, solve2(n-p[i])+1);
 
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  memset(memo, -1, sizeof(memo));
  memset(memo2, -1, sizeof(memo2));
 
  for(int i=0;i<200;i++) p[i] = i*(i+1)*(i+2)/6;
  while(cin >> n, n) cout << solve(n) << " " << solve2(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++) {
			if (!dp[1-i%2][j]) continue;
			for (int k=0; j+D[k]<=n; k++)
				dp[i%2][j+D[k]] = 1;
		}
	}

	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>
#define REP(i, a, n) for(int i = (a); i <= (n); i++)
#define INF 100000000
using namespace std;

const int M = 1000000;
int N, dp1[M + 1], dp2[M + 1];

int main(void) {
  REP(i, 1, M) dp1[i] = dp2[i] = i;

  for(int i = 1, n; n = i * (i + 1) * (i + 2) / 6, n <= M; i++) {
    for(int j = 1; j + n <= M; j++) {
      dp1[j + n] = min(dp1[j + n], dp1[j] + 1);
      if(n % 2 == 1) {
        dp2[j + n] = min(dp2[j + n], dp2[j] + 1);
      }
    }
  }

  while(cin >> N, N) {
    cout << dp1[N] << " " << dp2[N] << endl;
  }

  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  constexpr int N = 1e4;
  V<> a, b;
  for (int i = 1; ; ++i) {
    a.push_back(i * (i + 1) * (i + 2) / 6);
    if (a.back() >= N) {
      a.pop_back();
      break;
    }
    if (a.back() & 1) b.push_back(a.back());
  }
  V<> p(N, -1), q(N, -1);
  p[0] = q[0] = 0;
  queue<int> que;
  que.push(0);
  while (!que.empty()) {
    int i = que.front(); que.pop();
    for (int e : a) if (i + e < N and p[i + e] == -1) {
      p[i + e] = p[i] + 1;
      que.push(i + e);
    }
  }
  que.push(0);
  while (!que.empty()) {
    int i = que.front(); que.pop();
    for (int e : b) if (i + e < N and q[i + e] == -1) {
      q[i + e] = q[i] + 1;
      que.push(i + e);
    }
  }
  while (true) {
    int n; cin >> n;
    if (!n) break;
    cout << p[n] << ' ' << q[n] << '\n';
  }
}