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(void){
    int i;
    int n;
    int j = 0;
    int a[84];
    int b[22];
    int t[1000010];
    for(i = 0; i < 83; i++){
        a[i] = (i+1)*(i+2)*(i+3)/6;
        if(a[i] % 2 == 1){
            b[j] = a[i];
            j++;
        }
    }
    //cout << a[82] << b[20] << endl;
    /*for(i = 0; i < 83; i++){
        cout << "a[i] = " << a[i] << endl;
    }
    for(i = 0; i < 21; i++){
        cout << "b[i] = " << b[i] << endl;
    }*/
    while(1){
        cin >> n;
        if(n == 0){
            break;
        }
        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 82; i++){
            for(j = a[i]; j <= n; j++){
                if(t[j] > t[j - a[i]] + 1){
                    t[j] = t[j -a[i]] + 1;
                }
            }
        }
        cout << t[n] << " ";

        for(i = 0; i <= n; i++){
            t[i] = i;
        }
        for(i = 0; i <= 20; i++){
            for(j = b[i]; j <= n; j++){
                if(t[j] > t[j - b[i]] + 1){
                    t[j] = t[j - b[i]] + 1;
                }
            }
        }
        cout << t[n] << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <cstring>
#include <algorithm>
 
using namespace std;
 
const int SIZE = 181 + 1;
const int MAX = 1000000;
 
int T[SIZE];
int cost1[MAX], cost2[MAX];
 
int main( void )
{  
    for(int i=0; i < SIZE; ++i) T[i] = i * (i + 1) * (i + 2) / 6;
 
    fill(cost1, cost1+MAX, MAX);
    fill(cost2, cost2+MAX, MAX + MAX);
    cost1[0] = cost2[0] = 0;
    for(int i=0; i < MAX; ++i) {
        //if(cost1[i] < 6) {
            for(int j=0; j < SIZE; ++j) {
                if(i + T[j] < MAX && cost1[i] < 5)
                    cost1[i + T[j]] = min(cost1[i + T[j]], cost1[i] + 1);
                if(T[j] & 1) {
                    if(i + T[j] < MAX)
                        cost2[i + T[j]] = min(cost2[i + T[j]], cost2[i] + 1);
                }
            }
    }
    int n;
    while(cin >> n, n) {
        cout << cost1[n] << ' ' << cost2[n] << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int INF = 1000001;

int main() {
    vector<int> dp1(INF, INF);
    vector<int> dp2(INF, INF);

    dp1.at(0) = 0;
    dp2.at(0) = 0;

    for (int i = 0; i < INF; i++) {
        for (int j = 1; j < 201; j++) {
            int k = j*(j+1)*(j+2)/6;
            if (i - k < 0 || INF <= i - k) {
                continue;
            }
            dp1.at(i) = min(dp1.at(i), dp1.at(i-k) + 1);
            if (k % 2 == 1) {
                dp2.at(i) = min(dp2.at(i), dp2.at(i-k) + 1);
            }
        }
    }
    
    while (true) {
        int n;
        cin >> n;
        if (n == 0) {
            break;
        }
        cout << dp1.at(n) << " " << dp2.at(n) << endl;
    }
}

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

#define M 1000000
#define INF 10000000

#define min(a,b) (a<b?a:b)

int main() {
	int n, p;
	vector<int> fn, fno;
	static int dp[M+1], odp[M+1];
	for(int i=1;; ++i) {
		p = i*(i+1)*(i+2)/6;
		if(p>M) break;
		fn.push_back(p);
		if(p%2) fno.push_back(p);
	}
	for(int i=0; i<=M; ++i) dp[i] = odp[i] = INF;
	dp[0] = 0; dp[1] = 1; odp[0] = 0; odp[1] = 1;
	for(int i=2; i<=M; ++i) {
		for(int j=0; j<(signed)fn.size(); ++j) {
			if(i-fn[j]>=0) dp[i] = min(dp[i], dp[i-fn[j]]+1);
			else break;
		}
		for(int j=0; j<(signed)fno.size(); ++j) {
			if(i-fno[j]>=0) odp[i] = min(odp[i], odp[i-fno[j]]+1);
			else break;
		}
	}
	
	while(1) {
		cin >> n;
		if(!n) break;
		cout << dp[n] << " " << odp[n] << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define fi first
#define se second

#define INF 2147483600

bool   dp[6][1000001];
bool dp2[38][1000001];

int main(){
  int n=1;
  vector<int> vec, vec2;
  int tmp=0;
  while(tmp<=1000000){
    tmp+=n*(n+1)/2;
    vec.pb(tmp);
    if(tmp%2==1) vec2.pb(tmp);
    n++;
  }
  // dp[i][j] : i???????????£???j?????°????????????
  dp[0][0]=true;
  repl(i,1,5+1){
    for(int upd : vec){
      rep(j, 1000001){
        dp[i][j] = dp[i][j] | dp[i-1][j];
        if(j-upd>=0 && dp[i-1][j-upd]) dp[i][j] = true;
      }
    }
  }
  dp2[0][0]=true;
  repl(i,1,38){
    for(int upd : vec2){
      rep(j, 1000001){
        dp2[i][j] = dp2[i][j] | dp2[i-1][j];
        if(j-upd>=0 && dp2[i-1][j-upd]) dp2[i][j] = true;
      }
    }
  }

  while(cin>>n, n){
    int res=1;
    while(dp[res][n]==false) res++;
    cout<<res<<" ";
    res=1;
    while(dp2[res][n]==false) res++;
    cout<<res<<endl;
  }
  return 0;
}