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>
using namespace std;
int main(){
  int a[200]={0},b[150]={0},c[1200001]={0,1,2,3},d[1300001],k=0,i,j,n,p;
  for(i=1;a[i-1]<1000000;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0,p=i;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<p;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-2;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

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

ll tetra(ll num){
    return ((num) * (num + 1) * (num + 2) / 6);
}
//100
int main() {
    ll N = 1e6;

    vector<ll> dp(1000001, 1e9);
    vector<ll> dp_o(1000001, 1e9);

    dp[0] = 0;
    dp_o[0]= 0;

    for(int i = 1; tetra(i) < 1e6 + 2; i++){
        for(int j = 0; j <= N; j++){
            if(j + tetra(i) >= 1e6) break;
            dp[j + tetra(i)] = min(dp[j + tetra(i)], dp[j] + 1);
        }
    }



    for(int i = 1; tetra(i) < 1e6 + 2; i++){
        for(int j = 0; j <= N; j++){
            if(j + tetra(i) >= 1e6) break;
            if(tetra(i) % 2 ==1) dp_o[j + tetra(i)] = min(dp_o[j +tetra(i)], dp_o[j] + 1);
        }
    }


    vector<ll> v_ans;
    vector<ll> v_ans_o;

    while(1){
        ll num;
        cin >> num;
        if(num == 0) break;
        v_ans.push_back(dp[num]);
        v_ans_o.push_back(dp_o[num]);
    }

    for(int i = 0; i < v_ans.size(); i++){
        cout << v_ans[i] <<" "<< v_ans_o[i] << endl;
    }
}

C++: #include <stdio.h>
#include <stack>
#include <math.h>

using namespace std;

int main(){

	int n,table[200];
	int* dp = new int[1000000];
	int* odd_dp = new int[1000000];

	for(int i=0; i < 200; i++)table[i] = i*(i+1)*(i+2)/6;

	for(int i=0; i < 1000000; i++){
		odd_dp[i] = 20000000;
		dp[i] = 20000000;
	}

	dp[0] = 0;
	dp[1] = 1;

	for(int i = 2; i < 1000000; i++){
		for(int k = 1; table[k] <= i; k++){
			dp[i] = (dp[i] <= dp[i-table[k]]+1)?dp[i]:dp[i-table[k]]+1;
		}
	}

	odd_dp[0] = 0;
	odd_dp[1] = 1;

	for(int i = 2; i < 1000000; i++){
		for(int k = 1; table[k] <= i; k += 2){
			if(table[k]%2 == 1){
				odd_dp[i] = (odd_dp[i] <= odd_dp[i-table[k]]+1)?odd_dp[i]:odd_dp[i-table[k]]+1;
			}
		}
	}

	while(true){
		scanf("%d",&n);
		if(n == 0)break;

		printf("%d %d\n",dp[n],odd_dp[n]);
	}

    return 0;
}

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

using namespace std;

int main() {
    vector<int> dp_all(1000001, 1000000);
    vector<int> dp_odd(1000001, 1000000);

    dp_all[0] = dp_odd[0] = 0;
    for(int i = 1; i <= 181; ++i) {
        int n = i*(i+1)*(i+2)/6;
        for(int j = 0; j+n <= 1000000; ++j) {
            dp_all[j+n] = min(dp_all[j+n], dp_all[j] + 1);
            if(n % 2 == 1) dp_odd[j+n] = min(dp_odd[j+n], dp_odd[j] + 1);
        }
    }

    while(true) {
        int N;
        cin >> N;
        if(!N) break;

        cout << dp_all[N] << ' ' << dp_odd[N] << endl;
    }
    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++) {
    dp1[n] = 1;
    if(n % 2 == 1) dp2[n] = 1;
    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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;

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


const int MAX = 1000000;

int dp[MAX + 1];
int dp2[MAX + 1];

void solve(int n)
{
  vector<int> v;
  for(int i = 0; ; i++){
    int t = i * (i + 1) * (i + 2) / 6;
    if(t <= MAX)
      v.push_back(t);
    else
      break;
  }
  for(int i = 0; i <= n; i++){
    for(int j = 0; i + v[j] <= n; j++){
      if(v[j] & 1)
        dp2[i + v[j]] = min(dp2[i + v[j]], dp2[i] + 1);
      dp[i + v[j]] = min(dp[i + v[j]], dp[i] + 1);
    }
  }
}


    
int main()
{
  int n;
  while(1){
    cin >> n;
    if(n == 0){
      break;
    }else{
      fill(dp, dp + n + 1, MAX);
      fill(dp2, dp2 + n + 1, MAX);
      solve(n);
      cout << dp[n] << " " << dp2[n] << endl;
    }
  }
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;

int mint[1000000], mink[1000000];
int main() {
	memset(mint, 0x3f, sizeof(mint));
	memset(mink, 0x3f, sizeof(mink));
	mint[0] = mink[0] = 0;
	for (int i = 1;; i++) {
		int a = i*(i + 1)*(i + 2) / 6;
		if (a >= 1000000)break;
		for (int j = a; j < 1000000; j++) {
			mint[j] = min(mint[j], mint[j - a] + 1);
			if (a & 1)mink[j] = min(mink[j], mink[j - a] + 1);
		}
	}
	int n;
	while (scanf("%d", &n), n)
		printf("%d %d\n", mint[n], mink[n]);
}