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>

#define INF 10000000

using namespace std;

long long int data[1000100];
long long int data2[1000100];

int min1,min2;

void solveMin1(int cnt,int sum,int objSum,int nowNum){

	if( (cnt==min1-1 && sum!=objSum) || cnt>7)return;

	else if(sum==objSum){
		if(min1>=cnt){
			min1=cnt;
			return;
		}
	}
	else{
		for(int i=nowNum;sum+data[i]<=objSum;i++){
			solveMin1(cnt+1,sum+data[i],objSum,i);
		}
	}
}

void solveMin2(int cnt,int sum,int objSum,int nowNum){

	if(cnt>min2 || sum>objSum)return;

	else if(sum==objSum){
		if(min2>=cnt){
			min2=cnt;
			return;
		}
	}
	else{
		for(int i=nowNum;i>=0;i--){
			solveMin2(cnt+1,sum+data2[i],objSum,i);
		}
	}
}

int main(){
	int cnt=0;

	for(long long int i=0;i<1000100;i++){
		data[i]=i*(i+1)*(i+2)/6;
		if(data[i]%2==1){
			data2[cnt]=data[i];
			cnt++;
			//cout<<data2[cnt-1]<<endl;
		}
	}

	int n;

	while(cin>>n){
		if(n==0)break;


		min1 = INF;
		min2 = INF;

		solveMin1(0,0,n,1);

		int nowNum=0;
		for(nowNum=0;data2[nowNum]<=n;nowNum++);

			//min2の予想をする。
			int objNum=n;
		min2=0;
		while(1){
			while(data2[nowNum]>objNum){
				nowNum--;
			}
			objNum-=data2[nowNum];
			min2++;
			if(objNum==0)break;
		}

		//solveMin2(0,0,n,nowNum);

		cout<<min1<<" "<<min2<<endl;
	}

	return 0;
}

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

const int INF = 1e9;

int main(){
  int lim = 1e6;
  vector<int> cube;
  for(int i=1;;i++){
    int c = i*(i+1)*(i+2)/6;
    if(c>lim)break;
    cube.push_back(c);
  }

  vector<int> dp1(lim+1,INF), dp2(lim+1,INF);
  dp1[0] = dp2[0] = 0;

  for(int i=1;i<=lim;i++){
    for(int c : cube){
      if(i+c<=lim){
	dp1[i+c] = min(dp1[i+c], dp1[i]+1);
	if(c%2==0){
	  dp2[i+c] = min(dp2[i+c], dp2[i]+1);
	}
      }
    }
  }

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

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
  
using namespace std;

#define pi 3.141592653589793

int main()
{
	int result[1000001] = {};
	int odd_result[1000001] = {};
	fill(result, result + 1000000, 1000000);
	fill(odd_result, odd_result + 1000000, 1000000);
	int trangular_sum = 0, tetrahedral_sum = 0;
	result[0] = 0;
	odd_result[0] = 0;
	for(int i = 1; tetrahedral_sum < 1000000; i++){
		trangular_sum += i;
		tetrahedral_sum += trangular_sum;
		// result[trangular_sum] = 1;
		result[tetrahedral_sum] = 1;
		if(tetrahedral_sum % 2 == 1) odd_result[tetrahedral_sum] = 1;
	}
	for(int i = 1; i < 1000000; i++){
		for(int j = 1; j < i; j++){
			result[i] = min(result[i], result[i - j] + result[j]);
			if(j % 2 == 1) odd_result[i] = min(odd_result[i], odd_result[i - j] + odd_result[j]);
		}
		// cout << i  << " " << result[i] << " " << odd_result[i] << endl;
	}
	int n;
	while(1){
		cin >> n;
		if(n == 0) break;
		cout << result[n] << " " << odd_result[n] << endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int dp[200][1000001],Odp[200][1000001];
int Tn[200],OTn[200];    //Pollocks numberの生成

int main(){
    int count = 0;
    for(int i = 1;i < 200;i++){
        Tn[i-1] = i * (i + 1) * (i + 2) / 6;
        if(Tn[i-1] % 2 == 1){
            OTn[count] = Tn[i-1];
            count++;
        }
    }
    int n = 1000000;

    //正四面体数の個数の最小値
    for(int j = 0;j <= n;j++)
        dp[0][j] = j;
    int k;
    for(int i = 1;Tn[i] <= n;i++)
        for(int j = 1;j <= n;j++){
            if(j < Tn[i])
                dp[i][j] = dp[i-1][j];
            else dp[i][j] = min(dp[i-1][j],dp[i][j-Tn[i]] + 1);
            k = i;
        }

    //正四面体数の個数の最小値
    for(int j = 0;j <= n;j++)
        Odp[0][j] = j;
    int k1;
    for(int i = 1;OTn[i] <= n;i++)
        for(int j = 1;j <= n;j++){
            if(j < OTn[i])
                Odp[i][j] = Odp[i-1][j];
            else Odp[i][j] = min(Odp[i-1][j],Odp[i][j-OTn[i]] + 1);
            k1 = i;
        }
    while(cin >> n,n)
        cout << dp[k][n] << ' ' <<  Odp[k1][n] << 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);
    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-1;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;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;
}