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 <algorithm>
#include <iostream>
#include <vector>

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

using namespace std;

int dp1[1111111];
int dp2[1111111];

int main() {
  vector<int> v1, v2;

  for (int i = 1; i*(i+1)*(i+2)/6 <= 1000006; i++) {
    int a = i*(i+1)*(i+2)/6;
    v1.push_back(a); 
    if (a & 1) { v2.push_back(a); }
  }
  rep(i, 1000006) {
    dp1[i] = int(1e8);
    dp2[i] = int(1e8);
  }
  dp1[0] = 0;
  dp2[0] = 0;
  // dp[x] := xを構成するために必要な正四面体数の個数の最小値
  //
  rep(i, 1000006) {
    rep(j, v1.size()) {
      if (i+v1[j] > 1000006) { continue; }
      dp1[i+v1[j]] = min(dp1[i]+1, dp1[i+v1[j]]);
    }
    rep(j, v2.size()) {
      if (i+v2[j] > 1000006) { continue; }
      dp2[i+v2[j]] = min(dp2[i]+1, dp2[i+v2[j]]);
    }
  }
 
  int in;
  while (cin >> in) {
    if (in == 0) { break; }
    cout << dp1[in] << " " << dp2[in] << endl;
  }

  return 0;
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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


long int dp[190][1000010] = { 0 };
long int dpodd[190][1000010] = { 0 };


int N = 0;
int C[191];
int Codd[51];

void input(void) {
	CI N;

	return;
}


int main(void) {
	int C_N;
	for (int i = 1; i <= 190;i++) {
		C[i - 1] = i * (i + 1) * (i + 2) / 6;
	}
	int ii = 1, jj = 0;
	while (true) {
		if (ii * (ii + 1) * (ii + 2) / 6 > 1000000) {
			break;
		}
		if ((ii * (ii + 1) * (ii + 2) / 6) % 2 == 1) {
			Codd[jj] = ii * (ii + 1) * (ii + 2) / 6;
			jj++;
		}
		ii++;
	}

	for (int i = 1; i <= N; i++) {
		dp[0][i] = 1001000;
	}
	for (int i = 1; i <= N; i++) {
		dpodd[0][i] = 1001000;
	}

	for (int j = 1; j <= 189; j++) {
		for (long long int i = 1; i <= 1000002; i++) {
			if (i < C[j - 1]) {
				dp[j][i] = dp[j - 1][i];
			}
			else {
				dp[j][i] = min(dp[j - 1][i], dp[j][i - C[j - 1]] + 1);
			}
		}
	}

	for (int j = 1; j <= 189; j++) {
		for (long long int i = 1; i <= 1000002; i++) {
			if (i < Codd[j - 1]) {
				dpodd[j][i] = dpodd[j - 1][i];
			}
			else {
				dpodd[j][i] = min(dpodd[j - 1][i], dpodd[j][i - Codd[j - 1]] + 1);
			}
		}
	}

	while (true) {
		input();
		if (N == 0) {
			break;
		}
		for (int i = 0; i < 190; i++) {
			if (C[i] > N) {
				C_N = i;
				break;
			}
		}
	

		

		CO dp[C_N][N] << " ";

		
		for (int i = 0; i < 50; i++) {
			if (Codd[i] > N) {
				C_N = i;
				break;
			}
		}
		

		CO dpodd[C_N][N] E
		
		
	}
	
	
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <queue>
using namespace std;

int dp[500];
int dp1[11111500];
int dp2[11111100];
int main(){
    dp[1]=1;
    for(int i=2;i<210;i++){
        dp[i]=dp[i-1]+i;
    }
    for(int i=2;i<210;i++){
        dp[i]=dp[i-1]+dp[i];
    }
   // fill(dp,dp+400,0);
    fill(dp1,dp1+1111100,99999999);
    fill(dp2,dp2+1111100,99999999);
    dp1[0]=0;dp2[0]=0;
    for(int i=1;i<210;i++){
        int now=dp[i];
        for(int k=now;k<1100000;k++){
            if(dp1[k]>dp1[k-now]+1){
                dp1[k]=dp1[k-now]+1;
            }
        }
    }
    for(int i=1;i<300;i++){
        int now=dp[i];
        if(now%2==0)
            continue;
        for(int k=now;k<1100000;k++){
            if(dp2[k]>dp2[k-now]+1)
                dp2[k]=dp2[k-now]+1;
        }
    }
    int n;
    while(1){
        cin>>n;
        if(n==0)break;
        cout<<dp1[n]<<" "<<dp2[n]<<endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x)  cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
int main(int argc, char const *argv[]) {
    int M = 1e6+10;
    vector<int> nums;
    int x = 1;
    while (true) {
        int y = (x*(x+1)*(x+2))/6;
        if (y > M) break;
        nums.push_back(y);
        ++x;
    }
    vector<int> dp(M, INF);
    vector<int> odd_dp(M, INF);
    dp[0] = odd_dp[0] = 0;
    for (int i = 1; i < M; ++i) {
        for (auto &&e: nums) {
            if (i-e < 0) continue;
            dp[i] = min(dp[i], dp[i-e]+1);
            if (e%2 == 1) odd_dp[i] = min(odd_dp[i], odd_dp[i-e]+1);
        }
    }
    while (true) {
        int N;
        cin >> N;
        if (N == 0) break;
        
        printf("%d %d\n",dp[N], odd_dp[N]);
    }

    return 0;
}