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>

using namespace std;

int main(void)
{
	int n;
	int i1,i2;
	int nn;
	int p;
	int min;

	while(1){
		cin >> n;
		if(n==0) break;

		vector<int> pollock(n+1,0);
		vector<int> pollock2(n+1,0);
		vector<int> p;
		vector<int> p2;
		nn=1;

		for(i1=1;i1<=n;i1++){			

			if(i1==(nn*(nn+1)*(nn+2))/6  && i1%2==1){
				p.push_back(i1);
				p2.push_back(i1);
				nn++;
				pollock[i1]=1;
				pollock2[i1]=1;
			}
			else if(i1==(nn*(nn+1)*(nn+2))/6){
				nn++;
				p.push_back(i1);
				pollock[i1]=1;
				min=100000;
				for(i2=0;i2<p2.size();i2++){
					if((pollock2[i1-p2[i2]])<min){
						min=pollock2[i1-p2[i2]];
					}
				}
				pollock2[i1]=min+1;
			}
			else {
				min=100000;
				for(i2=0;i2<p.size();i2++){
					if((pollock[i1-p[i2]])<min){
						min=pollock[i1-p[i2]];
					}
				}
				pollock[i1]=min+1;

				min=100000;
				for(i2=0;i2<p2.size();i2++){
					if((pollock2[i1-p2[i2]])<min){
						min=pollock2[i1-p2[i2]];
					}
				}
				pollock2[i1]=min+1;
			}
			//cout<<pollock[i1]<<" ";

		}

		cout << pollock[n] << " " << pollock2[n] << endl;
		

	}

	return 0;
}

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

int main(){
	int num[1000010], num2[1000010];
	for(int i=0; i< 1000010; i++) num[i] = num2[i] = 10e8;
	num[0] = num2[0] = 0;
	for(int j=0; j< 1000010; j++){
		for(int i=0; i < 1200; i++){
			int m = i*(i+1)*(i+2)/6;
			if(1000010 <= m+j) continue;
			num[j+m] = min(num[j]+1, num[j+m]);

			if(m == 0) continue;
			if(m%2 == 0) continue;
			num2[j+m] = min(num2[j]+1, num2[j+m]);
		}
	}
	int n;
	while(cin >> n, n){
		cout << num[n] << " " << num2[n] << endl;
	}
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <cctype>
#include <complex>
#include <regex>

using namespace std;


int main() {

    vector<int> poloq;
    for (int i = 0; i < 190; i++) poloq.push_back((i + 1) * (i + 2) * (i + 3) / 6);
    //for (int i = 0; i < 190; i++) cout << poloq[i] << " ";


    vector<int> all = poloq;
    vector<int> odd;
    for (int i = 0; i < all.size(); i++) if (all[i] % 2 == 1) odd.push_back(all[i]);
//
//    for (int i = 0; i < poloq.size(); i++)cout << poloq[i] << " ";
//    cout << endl;
//    for (int i = 0; i < odd.size(); i++)cout << odd[i] << " ";

    vector<int> ans1(1300000);
    vector<int> ans2(1300000);

    ans1[0] = 0;
    ans1[1] = 1;
    for (int i = 2; i <= 1200000; i++) {
        ans1[i] = ans1[i - 1] + 1;
        for (int j = 0; j < all.size(); j++) {
            if (all[j] <= i) ans1[i] = min(ans1[i], ans1[i - all[j]] + 1);
            else break;
        }
    }
    // for (int i = 0; i < 10000; i++) cout << ans1[i] << " ";

    ans2[0] = 0;
    ans2[1] = 1;
    for (int i = 2; i <= 1200000; i++) {
        ans2[i] = ans2[i - 1] + 1;
        for (int j = 0; j < odd.size(); j++) {
            if (odd[j] <= i) ans2[i] = min(ans2[i], ans2[i - odd[j]] + 1);
            else break;
        }
    }
    //for (int i = 0; i < 10000; i++) cout << ans2[i] << " ";

    while (true) {
        int N;
        cin >> N;

        if (N == 0) break;

        cout << ans1[N] << " " << ans2[N] << endl;

    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;

#define MAX 1000000

int dp1[MAX+1], dp2[MAX+1];
int tetraNum[200];

int main(void)
{
    
    rep(i, 200) {
        tetraNum[i] = i*(i+1)*(i+2)/6;
    }

    rep(i, MAX+1) dp1[i] = dp2[i] = i;

    rep(i, MAX + 1) {
        rep(j, 200) {
            if(i + tetraNum[j] <= MAX) dp1[i + tetraNum[j]] = min(dp1[i + tetraNum[j]], dp1[i] + 1);
            if(tetraNum[j]%2 && i + tetraNum[j] <= MAX) dp2[i + tetraNum[j]] = min(dp2[i + tetraNum[j]], dp2[i] + 1);
        }
    }

    while(1) {
        int n;
        cin >> n;
        if(n == 0) break;

        cout << dp1[n] << " " << dp2[n] << endl;
    }
    
    return 0;
}