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<stdio.h>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <map>
#include <functional>
#include <stdio.h>
#include <array>
#include <algorithm>
#include <string>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#include <queue>
#include<iomanip>
#include<bitset>
#include<stack>
#include<set>
#include<limits>
#include <complex>
using namespace std;


vector<int>nums;
vector<int>oddnums;

vector<short>memo(1000001,-1);
vector<short>oddmemo(1000001,-1);

int getans(const int num,const int atime) {
	if (memo[num] != -1) {
		return memo[num];
	}
	else {
		if (num == 0)return memo[num] = 0;
		if (atime > 10)return atime;
		int ans = num;
		for (int i = 0; i <nums.size(); ++i) {
			int minusnum = nums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 10) {
				continue;
			}
			ans = min(ans, getans(num - minusnum, atime + 1)+1);
		}

		return memo[num] = ans;
	}
}
int getoddans(const int num, const int atime) {
	if (oddmemo[num] != -1) {
		return oddmemo[num];
	}
	else {
		if (num == 0)return oddmemo[num] = 0;
		if (atime > 50)return atime;
		int ans = num;
		for (int i = 0; i < oddnums.size(); ++i) {
			int minusnum = oddnums[i];
			if (minusnum > num) {
				break;
			}
			else if (num / minusnum > 50) {
				continue;
			}
			ans = min(ans, getoddans(num - minusnum, atime + 1) + 1);
		}
		return oddmemo[num] = ans;
	}

}
int main() {
	for (int i = 1; i < 190; ++i) {
		nums.push_back(i*(i + 1)*(i + 2) / 6);
		if (((i*(i + 1)*(i + 2)) / 6) % 2) {

		
			oddnums.push_back((i*(i + 1)*(i + 2)) / 6);
		}
	}

	while (1) {
		int n; cin >> n;
		if (!n)break;
		int normalans = getans(n, 0);;
		int oddans = getoddans(n, 0);

		cout << normalans << " " << oddans << endl;
	}
	return 0;
}

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

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-6;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

const int64 mod = 1e9+7;

vector<int64> po, podd;
vector<int64> dp(1e6+1, INF), dpdd(1e6+1, INF);

void init(){
	for(int64 i = 1;i*(i+1)*(i+2)/6 <= 1000000;i++){
		int64 x = i*(i+1)*(i+2)/6;
		po.push_back(x);
		if(x%2) podd.push_back(x);
	}

	dp[0] = 0; dpdd[0] = 0;
	REP(i, po.size()){
		for(int32 j = 0;j+po[i] < dp.size();j++){
			dp[j+po[i]] = min(dp[j+po[i]], dp[j]+1);
		}
	}
	REP(i, podd.size()){
		for(int32 j = 0;j+podd[i] < dpdd.size();j++){
			dpdd[j+podd[i]] = min(dpdd[j+podd[i]], dpdd[j]+1);
		}
	}
}

int main(void){
	init();
	int32 N;
	while(cin >> N && N){
		cout << dp[N] << " " << dpdd[N] << endl;
	}
}

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

int all[MAXNUM], odd[MAXNUM];
set<int> allfour, oddfour;
int max(int a, int b);
int min(int a, int b);
int getall(int n);
int getodd(int n);

int main()
{
	int n;
	int counter = 0;

	//1からMAXまでの中に存在する正四面体数を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);
	}

	//入力
	while (cin >> n, n)
		cout << all[n] << " " << odd[n] << endl;

	return 0;

}




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]);
			if (minnum == 2)
				break;
		}
		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]);
			if (minnum == 2)
				break;
		}
		return minnum;
	}
}