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>
using namespace std;
int main(){
  int c1[100000],c2[100000],i,m,p=0,dp1[100001],dp2[100001],k;
  for(i=0;i*(i+1)*(i+2)/6<=100000;i++){
    c1[i]=i*(i+1)*(i+2)/6;
    if(c1[i]%2==1){
      c2[p]=c1[i]; 
      p++; 
    }
  }
  while(1){
  cin >>m;
  if(m==0)break;
  for(int j=0;j<=m;j++){
    dp1[j]=j;
    dp2[j]=j;
    for(int k=0;k<i;k++){
      if(j-c1[k]>=0)dp1[j]=min(dp1[j],dp1[j-c1[k]]+1);
      if(k<p)
	if(j-c2[k]>=0){
	dp2[j]=min(dp2[j],dp2[j-c2[k]]+1);
       }
    }
  }
  cout << dp1[m]<<" "<<dp2[m]<<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[10000];
    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);
  
    for(int i=0;i<100000;i++)
      dp[i]=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<string.h>
using namespace std;

int polloc[200];

int main()
{
	for(int i=0;i<200;i++){
		polloc[i]=i*(i+1)*(i+2)/6;
	}
	int n;
	vector<int> ans1(1000001,-1);
	vector<int> ans2(1000001,-1);
	
	for(int i=0;i<200;i++){
		if(polloc[i]>1000000) break;
		ans1[polloc[i]]=1;
		if(polloc[i]%2==1)
			ans2[polloc[i]]=1;
	}

	for(int i=1;i<=1000000;i++){
		if(ans1[i]<0){
			ans1[i]=100000000;
			for(int k=0;k<200;k++){
				if(i-polloc[k]<0) break;
				ans1[i]=min(ans1[i],ans1[i-polloc[k]]+1);
			}
		}

		if(ans2[i]<0){
			ans2[i]=1000000000;
			for(int k=0;k<200;k++){
				if(polloc[k]%2==0) continue;
				if(i-polloc[k]<0) break;
				ans2[i]=min(ans2[i],ans2[i-polloc[k]]+1);
			}

		}

	}

	while(cin>>n){
		if(n==0) return 0;
		cout<<ans1[n]<<" "<<ans2[n]<<endl;
	}
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) (X).begin(),(X).end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

#define MAXINT 1000001
vi d,d2;
int main(){
	int t = 1;
	while(1){
		int tmp = t*(t+1)*(t+2)/6;
		if(tmp>MAXINT) break;
		d.pb(tmp);
		if(tmp%2==1) d2.pb(tmp);
		t++;
	}

	int dp[MAXINT];
	int dp2[MAXINT];
	REP(i,MAXINT){
		dp[i] = 500; dp2[i] = 500;
	}
	REP(i,d.size()) dp[d[i]] = 1;
	REP(i,d2.size()) dp2[d2[i]] = 1;
	REP(i,MAXINT){
		REP(k,d.size()){
			if(i+d[k]>=MAXINT) continue;
			dp[i+d[k]] = min(dp[i+d[k]],dp[i]+1);
		}
	}
	REP(i,MAXINT){
		REP(k,d2.size()){
			if(i+d2[k]>=MAXINT) break;
			dp2[i+d2[k]] = min(dp2[i+d2[k]],dp2[i]+1);
		}
	}
	while(1){
		int n;
		cin >> n;
		if(n==0) break;
		cout << dp[n] << " " << dp2[n] << endl;
	}

}