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(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);
  
    //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 <queue>
#include <algorithm>
using namespace std;

struct P{
  int sum;
  char k,n;
  P(){}
  P(int S,int K,int N){ sum=S;k=K;n=N; }
};

int a[200];

int main(){
  int n, ans1,ans2;
  queue<P> q;
  P p;

  for( int i=1;i<200 ; i++ )
    if( (a[i]=i*(i+1)*(i+2)/6)>1000000 )
      break;

  int size,n2;
  while( cin>>n && n ){

    ans1=0;
    while( !q.empty() ) q.pop();
    for( int i=1;i<200;i++ ){
      if( a[i]==n ){
	ans1=1; size=i+1;
	break;
      }
      if( a[i]<n ) q.push( P(a[i],i,1) );
      else{
	size=i; break;
      }
    }
    while( !ans1 ){
      p=q.front(); q.pop();
      n2=p.n+1;
      if( binary_search( a,a+size, n-p.sum ) ){
	ans1=n2; break;
      }
      for( int i=p.k,j;i<size;i++ ){
	j=p.sum+a[i];
	q.push( P(j,i,n2) );
      }
    }

    ans2=0;
    while( !q.empty() ) q.pop();
    for( int i=1;i<size;i++ ){
      if( a[i]%2==1 ){
	if( a[i]==n ){ ans2=1; break; }
	q.push( P(a[i],i,1) );
      }
    }
    while( !ans2 ){
      p=q.front(); q.pop();
      n2=p.n+1;
      int mm=n-p.sum;
      if( mm%2==1 && binary_search( a,a+size,mm ) ){
	ans2=n2; break;
      }
      for( int i=p.k,j;i<size;i++ ){
	if( a[i]%2==1 ){
	  j=p.sum+a[i];
	  q.push( P(j,i,n2) );
	}
      }
    }
    
    cout << ans1 << " " << ans2 << endl;
  }
    
  return 0;
}

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

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int MOD = 1e9 + 7;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    std::vector<int> v, odd;
    for (int i = 1; i * (i + 1) * (i + 2) / 6 <= 6 * 1e6; i++)
    {
        int tmp = i * (i + 1) * (i + 2) / 6;
        v.push_back(tmp);
        if (tmp % 2)
            odd.push_back(tmp);
    }
    std::vector<int> dp(1e6 + 1), odddp(1e6 + 1);
    for (int i = 1; i <= 1e6; i++)
    {
        dp[i] = i;
        odddp[i] = i;
    }
    for (int i = 1; i <= 1e6; i++)
    {
        for (int j = 0; j < (int)v.size(); j++)
        {
            if (i - v[j] >= 0)
                dp[i] = min(dp[i], dp[i - v[j]] + 1);
        }
        for (int j = 0; j < (int)odd.size(); j++)
        {
            if (i - odd[j] >= 0)
                odddp[i] = min(odddp[i], odddp[i - odd[j]] + 1);
        }
    }
    while (cin >> n, n)
    {
        cout << dp[n] << " " << odddp[n] << endl;
    }
    return 0;
}

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

int main(){
  int i,j,k;
  int x,y;
  int inf = 1 << 10;
  int m[200]={};
  int memo[1000005]={};
  int memo2[1000005]={};
  vector <int>  odd;
  fill(memo,memo+1000005,inf);
  fill(memo2,memo2+1000005,inf);
  for(i=1;i<201;i++) {
    m[i-1]=i*(i+1)*(i+2)/6;
    if(m[i-1]%2==1) odd.push_back(m[i-1]);
  }
  memo[0]=0;
  for(i=0;i<200;i++) {
    for(j=m[i];j<1000005;j++){
      memo[j]=min(memo[j],memo[j-m[i]]+1);
    }
  }
  memo2[0]=0;
  for(i=0;i<odd.size();i++) {
    for(j=odd[i];j<1000005;j++){
      memo2[j]=min(memo2[j],memo2[j-odd[i]]+1);
    }
  }
  int n;
  cin >> n;
  while(n!=0){
    cout << memo[n] << " " <<  memo2[n] << endl;
    cin >> n;
  }
  return 0;
}