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

int coin[100000];
int coin_ki[100000];
int dp[100000];

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

    if(x==0)
      break;

    int count=0;
    int count_ki=0;
    int tmp;
    int ans_tmp=0;
    int ans2_tmp=0;

    
   
    int tmp2=0;
  
    for(int i=1;i<100000;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;
      }
    }
    
    
    for(int i=0;i<100000;i++)
      dp[i]=100000;

    dp[0]=0;
    for(int i = 0;i<x;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);
	  //printf("dp[%d]=%d\n",i+coin[j],dp[i+coin[j]]);
	}
      }
    }


    int ans1=dp[x];

    int dp2[100000];
    
    for(int i=0;i<100000;i++)
      dp2[i]=100000;


    

    dp2[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  ans2_tmp=min(dp2[i+coin_ki[j]],dp2[i]+1);
	  dp2[i+coin_ki[j]]=ans2_tmp;
	  //printf("dp2[%d]=%d\n",i+coin_ki[j],dp[i+coin_ki[j]]);
	}
      }
    }
   
    
    int ans2=dp2[x];
    

    //for(int i=0;i<count;i++)
      //printf("coin[%d]=%d\n",i,coin[i]);
      //for(int i=0;i<count_ki;i++)
      //printf("coin_ki[%d]=%d\n",i,coin_ki[i]);


    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}

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

const int max_n = static_cast<int>(1e6);
int dp[max_n],odp[max_n];
vector<int> odd,all;

int main() {

    for(int i=1; i*(i+1)*(i+2)/6<max_n; i++){
        if((i*(i+1)*(i+2)/6)%2 == 1){
            odd.push_back(i*(i+1)*(i+2)/6);
        }
        all.push_back(i*(i+1)*(i+2)/6);
    }

    memset(dp,1000000,sizeof(dp));
    memset(odp,1000000, sizeof(odp));
    dp[0] = 0;
    odp[0] = 0;

    for(int i=1; i<max_n; i++){
        for(int j=0; j<all.size(); j++){
            if(i-all[j] < 0) {
                break;
            }
            dp[i] = min(dp[i],dp[i-all[j]] + 1);
        }
    }

    for(int i=1; i<max_n; i++){
        for(int j=0; j<odd.size(); j++){
            if(i-odd[j] < 0) {
                break;
            }
            odp[i] = min(odp[i],odp[i-odd[j]] + 1);
        }
    }

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

    return 0;
}