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>
	std::vector<int> shimen;

int calc_shimen(int pnum){
	static int num = 0;
	static int kai1 = 0;
	static int kai2 = 0;
	static int i = 0;
//	 2 3 4  5
//	1 3 6 10 15
//	 1 4 10 20 35
	while (1){
		if (num > pnum) break;
		kai2++;
		kai1 += kai2;
		num += kai1;
		shimen.push_back(num);
	//	std::cout << num << "\n";
		i++;
	}
	return i-2;
}

int main(void){
	int num, cnum, i, h, c1, cmin, cmin2, k;

	shimen.reserve(1000);
	while (1){
		std::cin >> num;
		if (!num) break;
		
		cmin = 0;
		c1 = 0;
		h = calc_shimen(num);
		while (h >= 1){
			i = h;
			cnum = num;


			k = shimen[i];
		//	std::cout << "begin i:" << i << ", k:" << k << "\n";
		//	if (cmin <= 0 || num / k < cmin){
				c1 = 0;
				while (i >= 0){
					k = shimen[i];
					c1 += cnum / k;
					cnum -= cnum / k*k;
				//	std::cout << "k:" << k << ", cnum:" << cnum << ", c1:" << c1 << "\n";
					i--;
				}
				if (cmin <= 0 || cmin>c1) cmin = c1;

		//	}
			h--;
		}

		cmin2 = 0;
		c1 = 0;
		h = calc_shimen(num);
		while (h >= 1){
			i = h;
			cnum = num;


			k = shimen[i];
		//	std::cout << "begin i:" << i << ", k:" << k << "\n";
			//	if (cmin <= 0 || num / k < cmin){
			c1 = 0;
			while (i >= 0){
				if ((k = shimen[i]) % 2){
					c1 += cnum / k;
					cnum -= cnum / k*k;
				//	std::cout << "k:" << k << ", cnum:" << cnum << ", c1:" << c1 << "\n";
				}
				i--;
			}
			if (cmin2 <= 0 || cmin2>c1) cmin2 = c1;

			//	}
			h--;
		}

		std::cout << cmin << " " << cmin2 << "\n";
	}
}

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

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    /*for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
      }
    }*/

    int dp[100000];
    fill(dp,dp + x + 1,100000);
  

    dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count;j++){
	if(i+coin[j]<=x){
	  dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	}
      }
    }

    cout << dp[x] << " ";
    fill(dp,dp + x + 1,100000);
  
    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	}
      }
    }
   
    cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}

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

int main(void)
{
  for(;;){
    int x;
    cin >> x;

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    

    int coin[100000];
    int coin_ki[100000];
   
    int tmp2=0;
  
    for(int i=1;i<x;i++){
      tmp=i*(i+1)*(i+2)/6;
      if(tmp>x)break;
      coin[i-1]=tmp;
      count=i;
      //if(coin[i-1]%2==1){
	coin_ki[tmp2++]=coin[i-1];
	count_ki=tmp2;
	//}
    }

    int dp[100000];
    fill(dp,dp + x + 1,100000);
  

    dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count;j++){
	if(i+coin[j]<=x){
	  dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	}
      }
    }

    cout << dp[x] << " ";
    fill(dp,dp + x + 1,100000);
  
    //printf("%d\n",count_ki);
    dp[0]=0;
    for(int i = 0;i<x+1;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  dp[i+coin_ki[j]]=min(dp[i+coin_ki[j]],dp[i]+1);
	}
      }
    }
   
    cout << dp[x] << endl;
  
    ///*/
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>

using namespace std;

int dp[100001];
int dp2[100001];
vector<int> vi;

void solve(){
	for(int i=1;i*(i+1)*(i+2)/6 <= 100000;i++){
		vi.push_back(i*(i+1)*(i+2)/6);
	}
	fill(dp,dp+100001,9999999);
	fill(dp2,dp2+100001,9999999);
	
	dp[0] = 0;
	dp2[0] = 0;
	for(int i=0;i<100000;i++){
		if(dp[i] != 9999999){
			for(int j=0;j<vi.size();j++){
				if(i+vi[j] <= 100000){
					dp[i+vi[j]] = min(dp[i+vi[j]],dp[i]+1);
				}else{
					break;
				}
			}
		}
		if(dp2[i] != 9999999){
			for(int j=0;j<vi.size();j++){
				if(i+vi[j] <= 100000 && vi[j]%2 == 1){
					dp2[i+vi[j]] = min(dp2[i+vi[j]],dp2[i]+1);
				}
			}
		}
	}
}

int main(){
	int n;
	solve();
	while(true){
		cin >> n;
		if(n==0){
			break;
		}

		cout << dp[n] << " " << dp2[n] << endl;
	}
}

C++: /*#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")*/
#include<bits/stdc++.h>
using namespace std;

int INF=1000000000;
int dp[1000001],dp_odd[1000001],n,ans1,ans2;

int main(){
    int i,j;
    //dpテーブルの初期化
    for(i=0;i<1000001;i++){
        dp[i]=INF;
        dp_odd[i]=INF;
    }
    dp[0]=0;
    dp_odd[0]=0;

    //前計算
    for(i=1;i<=181;i++){
        n=(i*(i+1)*(i+2))/6;
        for(j=0;j<1000001;j++){
            if(dp[j]!=INF && j+n<=1000000){
                dp[j+n]=min(dp[j+n],dp[j]+1);
            }
        }
        if(n%2==1){
            for(j=0;j<1000001;j++){
                if(dp_odd[j]!=INF && j+n<=1000000){
                    dp_odd[j+n]=min(dp_odd[j+n],dp_odd[j]+1);
                }
            }   
        }
    }

    while(cin>>n,n!=0)cout<<dp[n]<<" "<<dp_odd[n]<<"\n";
}