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 <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;

int main(){
	//??£?????¢?????°??¨????????????????\???°??????????????????????????¨??£??????????????¨???
	int sq[200]={0};
	int oddsq[200]={0};
	//???????????????index?????????
	int index=0;
	int indexODD=0;
	 //dp???????????¨??????
	int INF=2000000;
	
	for(int i=0; (i+1)*(i+2)*(i+3)/6<=1000000; ++i){
		sq[i]=(i+1)*(i+2)*(i+3)/6;
		if(sq[i]%2==1) oddsq[indexODD++]=sq[i];	
		//printf("%3d :%7d\n",i, sq[i]);
		index=i+1;
	}
	//printf("index= %d, inODD = %d\n", index, indexODD);
	
	//solve
	while(1){
		int n;
		scanf(" %d", &n);
		if(n==0) break;
			
		//dp[i]:=??°i?????£?????¢?????°????????¨????????¨?????¨?????????????????£?????¢?????°?????°???????°????
		
		int dp[1000001];
		fill(dp,dp+n+1,INF);
		dp[0]=0;
		
		for(int i=0; i<n; ++i){
			for(int j=0; j<index; ++j){
				if(i+sq[j]<=n) dp[i+sq[j]]=min(dp[i+sq[j]],dp[i]+1);
				else break;	
			}	
		}
		int ans1=dp[n];
		
		//?\???°?????????????????????????????¨??????
		fill(dp,dp+n+1,INF);
		dp[0]=0;
		
		for(int i=0; i<=n; ++i){
			for(int j=0; j<indexODD; ++j){
				if(i+oddsq[j]<=n) dp[i+oddsq[j]]=min(dp[i+oddsq[j]],dp[i]+1);
				else break;	
			}	
		}
		int ans2=dp[n];
				
		printf("%d %d\n", ans1, ans2);
	}	
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1111111];
int memo2[1111111];
 
int solve(int n){
   
  if(!n) return 0;
  if(~memo[n]) return memo[n];
 
  int ans = INF;
  for(int i=180;i>0;i--) if(n >= p[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=180;i>0;i--) if(p[i]&1 && n >= p[i]) ans = min(ans, solve2(n-p[i])+1);
 
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  memset(memo, -1, sizeof(memo));
  memset(memo2, -1, sizeof(memo2));
 
  for(int i=0;i<181;i++) p[i] = i*(i+1)*(i+2)/6;

  for(int i=0;i<1111111;i+=100){ solve(i), solve2(i); }
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
 
}

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

#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()

Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;

int dp_all[1000001];
int dp_odd[1000001];

int main() {
    vector<int> num_all, num_odd;
    for (int i = 1; i * (i + 1) * (i + 2) / 6 <= 1e6; i++) {
        num_all.push_back(i * (i + 1) * (i + 2) / 6);
        if ((i * (i + 1) * (i + 2) / 6) % 2 == 1) {
            num_odd.push_back(i * (i + 1) * (i + 2) / 6);
        }
    }
    for (int i = 0; i <= 1e6; i++) {
        dp_all[i] = dp_odd[i] = inf;
    }
    dp_all[0] = 0;
    for (int i = 0; i < (int)num_all.size(); i++) {
        for (int j = 0; j + num_all[i] <= 1e6; j++) {
            dp_all[j + num_all[i]] = min(dp_all[j + num_all[i]], dp_all[j] + 1);
        }
    }
    dp_odd[0] = 0;
    for (int i = 0; i < (int)num_odd.size(); i++) {
        for (int j = 0; j + num_odd[i] <= 1e6; j++) {
            dp_odd[j + num_odd[i]] = min(dp_odd[j + num_odd[i]], dp_odd[j] + 1);
        }
    }
    vector<pair<int, int>> res;
    while (true) {
        int n;
        cin >> n;
        if (n == 0) break;
        res.emplace_back(dp_all[n], dp_odd[n]);
    }
    for (int i = 0; i < (int)res.size(); i++) {
        cout << res[i].fi << " " << res[i].se << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int x,y;
int m[1000005]={};
int memo[1000005]={};
int memo2[1000005]={};
vector<int> odd;
void saiki(int n,int d){
  int i,j;
  //cout << n << ":" << d << ":" << x << endl;
  if(n==0) {
    //cout << x << d << endl;
    x=min(x,d);
  }else if(n>0) {
    if(memo[n]>0){
      x=min(x,memo[n]+d);
    }else{
      for(i=1;m[i]<=n;i++);
      i--;
      int b=x;
      for(j=i;j>0;j--){
	if(x>d+1)
	  saiki(n-m[j],d+1);
      }
      if(x>b)
	memo[n]=x-d;
      //cout << n << ":" << memo[n]<< endl;
    }
  }
}
void saiki2(int n,int d){
  int i,j;
  //cout << n << ":" << d << endl;
  if(n==0) {
    y=min(y,d);
  }else if(n>0) {
    if(memo2[n]>0){
      y=min(y,memo2[n]+d);
    }else{
      for(i=0;odd[i]<=n;i++);
      i--;
      int b=y;
      //cout << i << ":" << n << ":" << odd[i] << endl;
      for(j=i;j>=0;j--){
	if(y>d+1){
	  saiki2(n-odd[j],d+1);
	}
      }
      if(y>b)
	memo2[n]=y-d;
    }
  }
}
int main(){
  int i,j,k;
  fill(memo,memo+1000005,-1);
  fill(memo2,memo2+1000005,-1);
  for(i=1;i<1000005;i++) {
    m[i]=i*(i+1)*(i+2)/6;
    if(m[i]%2==1) odd.push_back(m[i]);
  }
  int n;
  cin >> n;
  while(n!=0){
    x=1<<10;y=x;
    saiki(n,0);saiki2(n,0);
    cout << x << " " <<  y << endl;
    cin >> n;
  }
  return 0;
}