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<algorithm>
using namespace std;

int i,j,n,three[1000000],four[1000000],four_2[1000000],c[1000000],c_2[1000000];

int main(){
  
  three[0] = 1;
  four[0] = 1;
  for( i = 1; i < 1000000; i++ )three[i] = i+1 + three[i-1];
  for( i = 1; i < 1000000; i++ )four[i] = three[i] + four[i-1];
  
  int k = 0;
  for( i = 0; i < 1000000; i++ ){
    if(four[i] %2 == 1 ){
      four_2[k] = four[i];
      k++;
    }
  }
  
  for( i = 0; i <= n; i++ ){
    c[i] = 2000000;
    c_2[i] = 2000000;
  }

  c[0] = 0;
  for( i = 0; i < 1000; i++ ){
    for( j = four[i]; j <= n; j++ ){
      c[j] = min( c[j],c[j-four[i]] + 1 );
    }
  }

  c_2[0] = 0;
  for( i = 0; i < 1000; i++ ){
    for ( j = four_2[i]; j <= n; j++ ){
      c_2[j] = min( c_2[j],c_2[j-four_2[i]] + 1 );
    }
  }
  
  while(1){
    int n; cin >> n;
    if(n==0)break;
   
    cout << c[n] << " " << c_2[n] << endl;
  }
  return 0;
}

C++: #include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;

#define fr first
#define sc second
#define mp make_pair

typedef long long int64;
typedef pair< int, int > iP;
typedef pair< iP, int > iiP;

const int INF = 2 << 28;
const double EPS = 1e-10;

int dp1[1000001 * 2], dp2[1000001 * 2];
int main() {

    fill_n(dp1, 1000001 * 2, INF);
    fill_n(dp2, 1000001 * 2, INF);
    vector< int > p;
    for(int i = 1; i * (i + 1) * (i + 2) / 6 <= 1000000; i++) {
        int v = i * (i + 1) * (i + 2) / 6;
        p.push_back(v); dp1[v] = 1;
        if(v % 2) dp2[v] = 1;
    }
    for(int i = 1; i < 1000001; i++) {
        if(dp1[i] != INF) {
            for(int j = 0; j < p.size(); j++) {
                dp1[i + p[j]] = min(dp1[i + p[j]], dp1[i] + 1);
                if(p[j] % 2) dp2[i + p[j]] = min(dp2[i + p[j]], dp2[i] + 1);
            }
        }
    }

    int N;
    while(cin >> N, N) {
        cout << dp1[N] << " " << dp2[N] << endl;
    }
}

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

#define req(i,r,k) for(int i=k;i<r;i++)
#define rep(i,r) req(i,r,0)
const int INF = 10000;

int dp[180][1000000];
//int odddp[91][1000000] = {INF};

const long  int h = 180,oddh = 90,w=1000000;

int main() {

    int n,a,a2;

    vector<int> t;

    req(i,200,1){
        t.push_back(i * (i+1) * (i+2) / 6);
        if(t[i-1] > 1000000) {
            t.erase(t.end() - 1);
            break;
        }
    }

    rep(i,h){
        rep(j,w){
            dp[i][j] = INF;
        }
    }

    rep(j,w){
        dp[0][j] = 0;
        //odddp[0][j] = 0;
    }

    /*rep(i,20){
        rep(j,41){
            cout << dp[i][j] << " ";
        }
        cout << endl;
    }*/

    rep(i,h){
        dp[i][0] = 0;
    }

/*
    rep(i,oddh){
        odddp[i][0] = 0;
    }
*/


    while(1){

        cin >> n;
        if(n==0) break;

        if(dp[h-1][n] == INF){
            rep(i,h){
                rep(j,w){
                    if(j >= t[i]){
                        dp[i+1][j] = min(dp[i][j],dp[i][j-t[i]] + 1);
                    }
                    else{
                        dp[i+1][j] = dp[i][j];
                    }
                }
            }
        }

        cout << dp[h-1][n] << ' ';
/*
        if(odddp[oddh-1][n] == INF){
            rep(i,oddh){
                rep(j,w){
                    if(j >= t[i]){
                        dp[i+1][j] = min(dp[i][j],dp[i][j-t[i]] + 1);
                    }
                    else{
                        dp[i+1][j] = dp[i][j];
                    }
                }
            }
        }

        cout << odddp[h-1][n] << endl;
*/
    }




    return 0;
}

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

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

const int MAX = 250;
int dp1[1000006];
int dp2[1000006];
vector<int> pollock;
vector<int> pollock2;

int main() {
    rep(i,1000006) dp1[i] = dp2[i] = 10000000;
    rep(i,MAX){
        int t = i*(i+1)*(i+2)/6;
        if(t>1000006) break;
        pollock.push_back(t);
        if(t&1) pollock2.push_back(t);

    }
    rep(i,pollock.size()) {
        if(!i) continue;
        dp1[pollock[i]] = 1;
    }
    rep(i,pollock2.size()) {
        dp2[pollock2[i]] = 1;
    }
    rep(i,1000006) {
        rep(j,pollock.size()) {
            if(!j) continue;
            if(i+pollock[j]>1000006) continue;
            dp1[i+pollock[j]] = min(dp1[i+pollock[j]],dp1[i]+1);
        }
        rep(j,pollock2.size()) {
            if(i+pollock2[j]>1000006) continue;
            dp2[i+pollock2[j]] = min(dp2[i+pollock2[j]],dp2[i]+1);

        }
    }
    int n;
    while(cin>>n) {
        if(n==0) break;
        cout<<dp1[n]<<" "<<dp2[n]<<endl;

    }



    return 0;
}