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>
#include<algorithm>
using namespace std;
int main(){
  vector<int> smt(1,0);
  vector<int> ksmt(1,0);
  int a;
  for(int i=1;i<10000;i++){
    a=i*(i+1)*(i+2)/6;
    smt.push_back(a);
    if(a%2==1)ksmt.push_back(a);
    if(a>100000)break;
  }
  while(1){
    cout <<smt.size()<<" "<<ksmt.size()<<endl;
    int dp1[86][100000]={};
    int dp2[23][100000]={};
    //cout <<"2"<<endl;
    int n;
    cin >> n;
    if(n==0)break;
    //
    for(int i=1;i<n;i++){
      dp1[1][i]=i;
      dp1[0][i]=i;
      dp2[1][i]=i;
      dp2[0][i]=i;
    }
    //all
    for(int i=1;i<smt.size();i++){
      if(smt[i]>n){
	cout << dp1[i-1][n]<<" ";
	break;
      }
      for(int j=1;j<=n;j++){
	if(smt[i]>j) dp1[i][j]=dp1[i-1][j];
	else{
	  dp1[i][j]=min(dp1[i-1][j],dp1[i][j-smt[i]]+1);
	}
      }
    }
    //kisuu
    for(int i=1;i<smt.size();i++){
      if(ksmt[i]>n){
	cout << dp2[i-1][n]<<endl;
	break;
      }
      for(int j=1;j<=n;j++){
	if(ksmt[i]>j) dp2[i][j]=dp2[i-1][j];
	else{
	  dp2[i][j]=min(dp2[i-1][j],dp2[i][j-ksmt[i]]+1);
	}
      }
    }
  }
  return 0;
}

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

int all[10000], odd[10000];
set<int> allfour, oddfour;

int max(int a, int b){
	if (a > b)
		return a;
	else
		return b;
}

int min(int a, int b){
	if (a > b)
		return b;
	else
		return a;
}

int getall(int n){
	set<int>::iterator it = allfour.find(n);
	if (it != allfour.end())
		return 1;
	else{
		int minnum = 1000;
		for (int i = 1; i < n / 2+1; i++){
			minnum = min(minnum, all[i] + all[n - i]);
		}
		return minnum;
	}
}

int getodd(int n){
	set<int>::iterator it = oddfour.find(n);
	if (it != oddfour.end())
		return 1;
	else{
		int minnum = 1000;
		for (int i = 1; i < n /2 + 1; i++){
			minnum = min(minnum, odd[i] + odd[n - i]);
		}
		return minnum;
	}
}



int main()
{
	int n, t[100];
	int counter = 0;

	//入力
	while (cin >> n, n)
		t[counter++] = n;
	int maxnum = 0;

	//入力値の最大を取得
	for (int i = 0; i < counter; i++)
		maxnum = max(maxnum, t[i]);

	//1からmaxnumまでの中に存在する正四面体数をsetに入れる．
	int now = 0, four;
	while (1){
		now++;
		four = now  *(now + 1)*(now + 2) / 6;
		if (four>maxnum)
			break;
		allfour.insert(four);
		if (four % 2 == 1)
			oddfour.insert(four);
	}

	//1からmaxnumまで，配列を埋める.
	for (int i = 1; i <= maxnum; i++){
		all[i] = getall(i);
		odd[i] = getodd(i);
	}

	//出力
	for (int i = 0; i < counter; i++)
		cout << all[t[i]] << " " << odd[t[i]] << 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);
  
    //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>
#define INF 1<<28
using namespace std;
 
int p[1000001];
int memo[1000001];
int memo2[1000001];
 
int solve(int n){
   
  //cout << n << endl;

  if(!n) return 0;
  if(n < 0) return INF;
  if(memo[n]) return memo[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n; i++) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(n<0) return INF;
  if(memo2[n]) return memo2[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n;i++){
    if(!(p[i]%2)) continue;
    ans = min(ans, solve2(n-p[i])+1);
  }
   
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  for(int i=0;i<=1000000;i++) p[i] = i*(i+1)*(i+2)/6;
  for(int i=1;i<=1000000;i++) solve(i), solve2(i);
   
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
}

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

using namespace std;

int main() {
	vector<int> p;
	vector<int> op;

	for (int i = 1;;i++) {
		int n = ((i + 1) * (i + 2) * (i)) / 6;
		if (n >= 1000000)break;
		if (n % 2 == 1) {
			op.push_back(n);
		}
		p.push_back(n);
	}

	int *ans = new int[1000000];
	int *oans=new int[1000000];

	for (int i = 0;i < 1000000;i++) {
		ans[i] = oans[i] = i;
	}
	for (int i = 1;i < 1000000;i++) {
		for (int j = 0;;j++) {
			if (j >= p.size())break;
			if (p[j] > i)break;
			ans[i] = min(ans[i], 1 + ans[i - p[j]]);
		}
		for (int j = 0;;j++) {
			if (j >= op.size())break;
			if (op[j] > i)break;
			oans[i] = min(oans[i], 1 + oans[i - op[j]]);
		}
	}
	int tmp;
	while (1) {
		cin >> tmp;
		if (tmp == 0)break;
		cout << ans[tmp] << " " << oans[tmp] << endl;
	}
}