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>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1000001];
int memo2[1000001];
 
int solve(int n){

  if(!n) return 0;
  if(memo[n]) return memo[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n; i++) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(memo2[n]) return memo2[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n;i++){
    if(p[i]&1) ans = min(ans, solve2(n-p[i])+1);
  }
   
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  for(int i=0;i<=181;i++) p[i] = i*(i+1)*(i+2)/6;
  for(int i=1;i<=1000000;i++) solve(i), solve2(i);
   
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
}

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

int main(){
    int N;
    vector<int> poloc;
    vector<int> odd_poloc;
    int t = 1;
    while (1)
    {
        if (t * (t + 1) * (t + 2) / 6>1000000)
            break;
        poloc.push_back(t * (t + 1) * (t + 2) / 6);
        if ((t * (t + 1) * (t + 2) / 6)%2 == 1)
            odd_poloc.push_back(t * (t + 1) * (t + 2) / 6);
        t++;
    }
    vector<int> dp(1000001, 10000000), dp2(1000001, 10000000);
    dp[0] = 0;
    for (int i = 0; i < 1000000; i++)
    {
        for (int j = 0; j < poloc.size(); j++)
        {
            if (i + poloc[j] > N)
                break;
            dp[i + poloc[j]] = min(dp[i + poloc[j]], dp[i] + 1);
        }
    }
    dp2[0] = 0;
    for (int i = 0; i < 1000000; i++)
    {
        for (int j = 0; j < odd_poloc.size(); j++)
        {
            if (i + odd_poloc[j] > N)
                break;
            dp2[i + odd_poloc[j]] = min(dp2[i + odd_poloc[j]], dp2[i] + 1);
        }
    }
    while (cin >> N, N)
    {
        cout << dp[N] << " " << dp2[N] << endl;
    }
}

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

int D[182] = {} ; // 10^6 越え → 181
int dp_map[2][1000002] = {} ;

void t(){
	for( int i=1 ; i<182 ; i++ ){
		D[i] = i * (i+1) * (i+2) / 6 ;
	}
}

int cal_2( int x , int c ){
	if( x==0 ) return 0 ;
	else{
		//if( dp_map[0][x] != 0 ) return dp_map[0][x] ;
		//else 
		return x/D[c] + cal_2( x%D[c] , c-1 ) ;
	}
}

int cal( int m , int q ){
	int ans = m ;
	for( int j=q ; j>1 ; j-- ){
		ans = min( ans , cal_2( m , j ) ) ;
	}
	return ans ;
}

int cal_odd_2( int x , int c ){
	if( x==0 ) return 0 ;
	else{
		if( D[c]%2 == 0 ) return cal_odd_2( x , c-1 ) ;
		else{
			//if( dp_map[1][x] != 0 ) return dp_map[1][x] ;
			//else 
			return x/D[c] + cal_odd_2( x%D[c] , c-1 ) ;
		}
	}
}

int cal_odd( int m , int q ){
	int ans_2 = m ;
	for( int j=q ; j>1 ; j-- ){
		ans_2 = min( ans_2 , cal_odd_2( m , j ) ) ;
	}
	return ans_2 ;
}

void dp(){
	int p = 1 ;
	for( int i=1 ; i<=1000000 ; i++ ){
		if( i < 182 && i >= D[p] ) p++ ;
		dp_map[0][i] = cal(i,p) ;
		dp_map[1][i] = cal_odd(i,p) ;
	}
}

int main(){
	
	t() ;
	dp() ;
	
	int n ;
	
	while( cin >> n , n ){
		cout << dp_map[0][n] << ' ' ;
		cout << dp_map[1][n] << endl ;
	}
	
return 0 ;
}

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

const int MAX = 1000100;
const int INF = 1<<29;

int main() {
    vector<int> dp(MAX, INF), odddp(MAX, INF);
    dp[0] = odddp[0] = 0;
    for (int i = 1;; ++i) {
        int num = i * (i+1) * (i+2) / 6;
        if (num >= MAX) break;
        for (int j = num; j < MAX; ++j) {
            dp[j] = min(dp[j], dp[j-num]+1);
            if (num & 1) odddp[j] = min(odddp[j], odddp[j-num]+1);
        }
    }
    int n;
    while (cin >> n) {
        if (n == 0) break;
        cout << dp[n] << " " << odddp[n] << endl;
    }
}

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

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);

int dp[1000000] = {};
int dp_o[1000000] = {};
vector<int>n, n_o;
int DP(int num) {
	if (dp[num] != 0)return dp[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 0;
	while (1) {
		rec = min(DP(n[cnt]) + DP(num - n[cnt]), rec);
		cnt++;
		if (n[cnt] > num)break;
	}
	dp[num] = rec;
	return rec;

}
int DP_o(int num) {
	if (dp_o[num] != 0)return dp_o[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 0;
	while (1) {
		rec = min(DP(n_o[cnt]) + DP(num - n_o[cnt]), rec);
		cnt++;
		if (n_o[cnt] > num)break;
	}
	dp_o[num] = rec;
	return rec;

}

int main() {
	cin.sync_with_stdio(false);
	ll cnt1 = 0, cnt2 = 0;
	
	reps(i, 1, 1000000) {
		cnt1 += i;
		cnt2 += cnt1;
		dp[cnt2] = 1;
		n.push_back(cnt2);
		if (cnt2 % 2 == 1) {
			dp_o[cnt2] = 1;
			n.push_back(cnt2);
		}
	}
	while (1) {
		int Q;
		cin >> Q;
		if (Q == 0)break;
		cout << DP(Q) << " ";
		cout << DP_o(Q) << endl;
	}


	return 0;
}

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

int N,inf = 1e9;
int dp[1000010] = {},dp_odd[1000010] = {};

int main(){
	while(cin >> N && N>0){
		for(int i=1;i<=N;i++){
			dp[i] = inf;
			dp_odd[i] = inf;
		}
		dp[0] = 0;
		for(int i=1;i*(i+1)*(i+2)<=6*N;i++){
			int n = i*(i+1)*(i+2)/6;
			for(int j=n;j<=N;j++){
				dp[j] = min(dp[j],dp[j-n]+1);
			}
		}
		cout << dp[N] << " ";
		dp_odd[0] = 0;
		for(int i=1;i*(i+1)*(i+2)<=6*N;i++){
			int n = i*(i+1)*(i+2)/6;
			if(n%2==0) continue;
			for(int j=n;j<=N;j++){
				dp_odd[j] = min(dp_odd[j],dp_odd[j-n]+1);
			}
		}
		cout << dp_odd[N] << endl;
	}
}