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 "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

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


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	vector < vector<bool> >dp(6, vector < bool>(100001, 0));
	dp[0][0] = 1;
	REP(i, 5) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if (k > 100001)break;
			REP(l, 100001 - k) {
				if (dp[i][l])dp[i + 1][l + k] = 1;
			}
		}
	}
	vector<vector<bool>> dp2(1001, vector<bool>(100001, 0));
	REP(i, 1000) {
		REP(j, INF) {
			int k = j*(j + 1)*(j + 2) / 6;
			if (k % 2 == 0)continue;
			if (k > 100001)break;
			REP(l, 100001 - k) {
				if (dp2[i][l])dp2[i + 1][l + k] = 1;
			}
		}
	}
	while (1) {
		int n;
		cin >> n;
		if (!n)break;
		REP(i, 5) {
			if (dp[i + 1][n]) {
				cout << i + 1;
				break;
			}
		}
		cout << " ";
		REP(i, 5) {
			if (dp2[i + 1][n]) {
				cout << i + 1 << endl;
				break;
			}
		}
	}
	return 0;
}

C++: aaaa

C++: #include <iostream>
#include <vector>
using namespace std;
int INF = 100000000;
int main(){
  int n, M = 1000000;
  vector<int> A(M,INF), A_odd(M,INF);
  int t = 1, k = 3;
  A[0] = 0;
  A_odd[0] = 0;
  while(t < 1000000){
    for(int k = 0; k+t < M; ++k){
      A[k+t] = min(A[k]+1,A[k+t]);
      if(t%2) A_odd[k+t] = min(A_odd[k]+1,A_odd[k+t]);
    }
    ++k;
    t *= k;
    t /= (k-3);
  }
  while(cin >> n, n){
    cout << A[n] << " " << A_odd[n] << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int d1[1000001]={},d2[1000001]={};
int main(){
	int n,i=0,j=0;
	int pollock1[181]={},pollock2[46]={};
	for(i=1;i*(i+1)*(i+2)/6<1000000;i++){
		pollock1[i-1]=i*(i+1)*(i+2)/6;
		if(pollock1[i-1]%2)
		pollock2[j++]=pollock1[i-1];
	}
	for(i=0;i<1000001;i++){
		d1[i]=9999999;
		d2[i]=9999999;
	}
	for(i=0;i<180;i++)
		d1[pollock1[i]]=1;
	for(i=0;i<45;i++)
		d2[pollock2[i]]=1;
	
	for(i=1;i<1000001;i++){
		for(j=0;j<180;j++){
			if(d1[i] && i+pollock1[j]<1000001){
				d1[i+pollock1[j]]=min(d1[i+pollock1[j]],d1[i]+1);
			}
		}
	}
	for(i=1;i<1000001;i++){
		for(j=0;j<45;j++){
			if(d2[i] && i+pollock2[j]<1000001){
				d2[i+pollock2[j]]=min(d2[i+pollock2[j]],d2[i]+1);
			}
		}
	}
	while(cin>>n,n){
		cout<<d1[n]<<' '<<d2[n]<<endl;
	}
}

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

using namespace std;
vector<int> P;
int memo[1001001];
int mome[1001001];

void hoge(){

    for(int i=1; ; i++){
        int p=i*(i+1)*(i+2)/6;
        if(p>=1001001) break;
        P.push_back(p);
    }
    for(int i=0; i<1001001; i++){
        memo[i]=mome[i]=i;
    }
    for(int i=0; i<P.size(); i++){
        memo[P[i]]=1;
        if(P[i]%2) mome[P[i]]=1;
    }
    for(int i=0; i<1001001; i++){
        for(int j=0; j<P.size(); j++){
            if(i+P[j]<1001001){
                memo[i+P[j]]=min(memo[i+P[j]], memo[i]+1);
            }
            if((P[j]%2)&&i+P[j]<1001001){
                mome[i+P[j]]=min(mome[i+P[j]], mome[i]+1);
            }
        }
    }
}

int main(){

    hoge();
    while(1){
        int N;
        cin>> N;
        if(!N) break;

        cout<< memo[N]<< " "<< mome[N]<< endl;
    }

    return 0;
}

C++: #include <iostream>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
#define INF 100000000
using namespace std;

const int SIZE = 1000000 + 1;
int N;
int dp1[SIZE], dp2[SIZE];

int main(void) {
  REP(i, 0, SIZE) dp1[i] = dp2[i] = INF;
  for(int i = 1, n; n = i * (i + 1) * (i + 2) / 6, n < SIZE; i++) {
    dp1[n] = 1;
    if(n % 2 == 1) dp2[n] = 1;
    for(int j = 1; j + n < SIZE; j++) {
      dp1[j + n] = min(dp1[j + n], dp1[j] + 1);
      if(n % 2 == 1) dp2[j + n] = min(dp2[j + n], dp2[j] + 1);
    }
  }

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