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>
#include <cstring>

using namespace std;

int n;

int dp[200][1000010], adp[200][1000010];
int INF = 1e9;

void solve() {
	for (int i=0; i<200; i++) {
		fill(dp[i], dp[i]+1000010, INF);
		fill(adp[i], adp[i]+1000010, INF);
	}
	
	dp[0][0] = 0;
	adp[0][0] = 0;
	for (int i=0; i<200; i++) {
		int add = i * (i+1) * (i+2) / 6;
		if (add > n) break;
		for (int j=0; j<=n; j++) {
			if (add <= j) {
				dp[i+1][j] = min(dp[i][j], dp[i + 1][j-add] + 1);
			} else {
				dp[i+1][j] = dp[i][j];
			}
			
			if (add%2==0) {
				adp[i+1][j] = adp[i][j];
			} else {
				if (add <= j) {
					adp[i + 1][j] = min(adp[i][j], adp[i + 1][j-add] + 1);
				} else {
					adp[i + 1][j] = adp[i][j];
				}
			}
		}
	}
	
	int ans1 = INF, ans2 = INF;
	for (int i=0; i<200; i++) {
		ans1 = min(ans1, dp[i][n]);
		ans2 = min(ans2, adp[i][n]);
	}
	cout << ans1 << " " << ans2 << endl;
}

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

C++: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;

template <typename TYPE>
void print_vec(const vector<TYPE>& v){
	for(int i=0; i<v.size(); i++){
		cout << v[i] << " ";
	}
	cout << endl;
}

template <typename TYPE>
void print_vec2(const vector<vector<TYPE>>& v){
  cout << endl; cout << "       ";
  for(int i=0; i<v[0].size(); i++) cout << i << "   "; 
  cout << endl;
	for(int i=0; i<v.size(); i++){
		cout << "i=" << i << ":   ";
		for(int j=0; j<v[i].size(); j++){
			if(v[i][j] == 0) cout << "\x1B[0m" << v[i][j] << "   ";
      else cout << "\x1B[31m" << v[i][j] << "   ";//https://stackoverrun.com/ja/q/12618775
		}
		cout << "\x1B[0m" << endl;
	}
}

////////////////////////////////////////////////////////////////

int chmin(int &a, int b){return a = min(a, b);}

int main(void) {
	int MAX = 0;
	vector<int> input;
	while(true){
		int x;
		cin >> x;
		if(x == 0) break;
		input.push_back(x);
		MAX = max(MAX, x);
	}

	const int TETRA_MAX = 1000;
	// dp1[i]: 正整数iを作るときに必要な四面体数の最小個数
	vector<int> dp1(MAX+1, MAX+1);
	dp1[0] = 0;
	for(int i=0; i<TETRA_MAX; i++){
		int tetra = (i+1)*(i+2)*(i+3)/6;
		for(int j=0; j<=MAX; j++){
			//chmin(dp1[j], dp1[j]);
			if(j+tetra <= MAX) chmin(dp1[j+tetra], dp1[j]+1);//これだと 同じ四面体数を複数回使うことを考慮できてないと思われる
			//if(j+tetra <= MAX) chmin(dp1[j+tetra], dp1[j]+1);
	
			//if(j-tetra >= 0) chmin(dp1[j], dp1[j-tetra] + 1);//もらうdp
		}	
	}	

	// vector<ll> odd_tetras;
	// for(int i=0; i<TETRA_MAX; i++){
	// 	ll tetra = (i+1)*(i+2)*(i+3)/6;
	// 	if(tetra % 2 == 0) continue;
	// 	odd_tetras.push_back(tetra);
	// }
	// dp2[i]: 正整数iを作るときに必要な奇数の四面体数の最小個数
	vector<int> dp2(MAX+1, MAX+1);
	dp2[0] = 0;
	for(int i=0; i<TETRA_MAX; i++){
		int tetra = (i+1)*(i+2)*(i+3)/6;
		if(tetra % 2 == 0) continue;
		for(int j=0; j<=MAX; j++){
			//chmin(dp2[j], dp2[j]);
			if(j+tetra <= MAX) chmin(dp2[j+tetra], dp2[j]+1);//これだと 同じ四面体数を複数回使うことを考慮できてないと思われる
			//if(j+tetra <= MAX) chmin(dp2[j+tetra], dp2[j]+1);

			//if(j-tetra >= 0) chmin(dp2[j], dp2[j-tetra] + 1);//もらうdp
		}	
	}	

	for(int i=0; i<(int)input.size(); i++){
		cout << dp1[input[i]] << " " << dp2[input[i]] << endl;
	}


	//以下2次元のdp　だけど メモリエラーになったので1次元でやりましょう
	// const int TETRA_MAX = 100;
	// // dp1[i][j]: (i-1)番目までの四面体数を使って，正整数jを作るときに必要な四面体数の最小個数
	// vector<vector<ll>> dp1(TETRA_MAX+1, vector<ll>(MAX+1, MAX+1));
	// dp1[0][0] = 0;
	// for(ll i=0; i<TETRA_MAX; i++){
	// 	ll tetra = (i+1)*(i+2)*(i+3)/6;
	// 	for(int j=0; j<=MAX; j++){
	// 		chmin(dp1[i+1][j], dp1[i][j]);
	// 		if(j+tetra<=MAX) chmin(dp1[i+1][j+tetra], dp1[i][j]+1);
	// 		if(j+tetra<=MAX) chmin(dp1[i+1][j+tetra], dp1[i+1][j]+1);
	// 	}
	// }

	// vector<ll> odd_tetras;
	// for(int i=0; i<TETRA_MAX; i++){
	// 	ll tetra = (i+1)*(i+2)*(i+3)/6;
	// 	if(tetra % 2 == 0) continue;
	// 	odd_tetras.push_back(tetra);
	// }
	
	// //dp2[i][j]: (i-1)番目までの四面体数の中の奇数のモノのみを使って，
	// //正整数jを作るときに必要な四面体数の最小個数
	// vector<vector<ll>> dp2(odd_tetras.size()+1, vector<ll>(MAX+1, MAX+1));
	// dp2[0][0] = 0;
	// for(int i=0; i<dp2.size()-1; i++){
	// 	ll tetra = odd_tetras[i];
	// 	for(int j=0; j<=MAX; j++){
	// 		chmin(dp2[i+1][j], dp2[i][j]);
	// 		if(j+tetra<=MAX) chmin(dp2[i+1][j+tetra], dp2[i][j]+1);
	// 		if(j+tetra<=MAX) chmin(dp2[i+1][j+tetra], dp2[i+1][j]+1);
	// 	}
	// }
	
	

	// for(int i=0; i<input.size(); i++){
	// 	cout << dp1[dp1.size()-1][input[i]] << " " << dp2[dp2.size()-1][input[i]] <<  endl;
	// }
	

}

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

int main(){
  int i,j,n,three[1000],four[1000],four_2[1000],c[1000],c_2[1000];

  three[0] = 1;
  four[0] = 1;
  for( i = 1; i < 1000; i++ )three[i] = i+1 + three[i-1];
  for( i = 1; i < 1000; i++ )four[i] = three[i] + four[i-1];
  
  int k = 0;
  for( i = 0; i < 1000; i++ ){
    if(four[i] %2 == 1 ){
      four_2[k] = four[i];
      k++;
    }
  }
  
  while(1){
    int n; cin >> n;
    if(n==0)break;
    for( i = 0; i <= n; i++ ){
      c[i] = 2000000;
      c_2[i] = 2000000;
    }

    c[0] = 0;
    for( i = 0; i < 50; i++ ){
      for( j = four[i]; j <= n; j++ ){
	c[j] = min( c[j],c[j-four[i]] + 1 );
      }
    }

    c_2[0] = 0;
    for( i = 0; i < 50; i++ ){
      for ( j = four_2[i]; j <= n; j++ ){
	c_2[j] = min( c_2[j],c_2[j-four_2[i]] + 1 );
      }
    }
    cout << c[n] << " " << c_2[n] << endl;
  }
    return 0;
}