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(){
	static int num[1000001],odd[1000001];
	vector<int> pol,podd;
	for(int i = 0;i <= 1000000;i++) odd[i] = i;
	for(int i = 1;;i++){
		int p = i * (i + 1) * (i + 2) / 6;
		if(p > 1000000) break;
		pol.push_back(p);
		num[p] = 1;
		if(p % 2) podd.push_back(p);
	}
	for(int i = 1;i <= 4;i++){
		for(int j = 0;j <= 1000000;j++){
			if(num[j] == i){
				for(int k = 0;k < pol.size();k++){
					if(j + pol[k] <= 1000000) {
						if(!num[j + pol[k]]) num[j + pol[k]] = i + 1;
						else num[j + pol[k]] = min(num[j + pol[k]],i + 1);
					}
				}
			}
		}
	}
	for(int i = 1;i < podd.size();i++){
		for(int j = 0;j <= 1000000;j++){
			if(j + podd[i] > 1000000) break;
			odd[j + podd[i]] = min(odd[j + podd[i]],odd[j] + 1);
		}
	}
	int n;
	while(cin >> n,n){
		cout << num[n] << " " << odd[n] << endl;
	}
	return 0;
}

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

#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcd(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  vt<int> vec;
  for(int i = 1, num = 1; num <= 1e6; ++i, num = i * (i + 1) * (i + 2) / 6) {
    vec.push_back(num);
  }

  vt<int> dp1(1e6 + 1, INF), dp2(1e6 + 1, INF);
  dp1[0] = dp2[0] = 0;
  rep(i, 1, 1e6 + 1) {
    rep(j, 0, vec.size()) {
      if(i >= vec[j]) {
        dp1[i] = min(dp1[i], dp1[i - vec[j]] + 1);
        if(vec[j] % 2 == 1) dp2[i] = min(dp2[i], dp2[i - vec[j]] + 1);
      }
    }
  }

  int n;
  while(cin >> n, n != 0) cout << dp1[n] << " " << dp2[n] << endl;
}

C++: #include <iostream>
#include <fstream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <list>
#include <utility>
#include <cmath>
using namespace std;
vector<int> v,memo(1000005,999999),memo2(1000005,999999);
int a;
int main ()
{
	v.push_back(0);
	for(int i=1;i<=300;i++)
	{
		v.push_back(i*(i+1)*(i+2)/6);
	}
	memo[0]=memo2[0]=0;
	for(int i=0;i<=1000000;i++)
	{
		for(int l=0;l<v.size();l++)
		{
			if(i+v[l]>1000000)break;
			if(v[l]%2==1)memo2[i+v[l]]=min(memo2[i+v[l]],memo2[i]+1);
			memo[i+v[l]]=min(memo[i+v[l]],memo[i]+1);
		}
	}
	// for(int i=1;i<100;i++)cout<<memo[i]<<" "<<memo[i]<<endl;
	while(cin>>a&&a)
	{
		cout<<memo[a]<<" "<<memo2[a]<<endl;
	}
	return 0;
}

C++: #include <iostream>
#define SIZE 1000000
using namespace std;
int l[SIZE+1]={0};
int m[SIZE+1]={0};

int main(){
    int i,n,a=1,b=1,c=1;
    for(i=1;i<SIZE+1;i++){
        l[i]=i;
        m[i]=i;
    }
    while(b<SIZE){
        for(i=0;i+b<SIZE+1;i++){
            l[i+b]=min(l[i+b],l[i]+1);
            if(b%2){m[i+b]=min(m[i+b],m[i]+1);}
        }
        a+=(c+1);
        b+=a;
        c++;
    }
    while(1){
        cin>>n;
        if(!n){break;}
        cout<<l[n]<<" "<<m[n]<<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 };


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

void input(void) {
	CI N;

	return;
}


int main(void) {
	long 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 (long int i = 1; i <= N; i++) {
		dp[0][i] = 1001000;
	}
	for (long int i = 1; i <= N; i++) {
		dpodd[0][i] = 1001000;
	}

	for (int j = 1; j <= 189; j++) {
		for ( 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 <= 50; j++) {
		for ( 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;
}