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 <stdio.h>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <map>
#include <climits>
using namespace std;
#define mod (1000000007)
#define ll long long int

int main(void){
  ll koho[200];
  for (size_t i = 1; i < 201; i++) {
    koho[i-1] = i*(i+1)*(i+2)/6;
  }
  vector<ll> koho_odd;
  for(auto k: koho){
    if(k%2 == 1){
      koho_odd.push_back(k);
    }
  }

  vector<ll> dp;
  dp.assign(1000005,INT_MAX);
  dp[0] = 0;
  for (size_t i = 1; i < 1000005; i++) {
    for(auto k: koho){
      if(i<k){
        break;
      }else{
        dp[i] = min(dp[i],dp[i-k]+1);
      }
    }
  }

  vector<ll> dpo;
  dpo.assign(1000005,INT_MAX);
  dpo[0] = 0;
  for (size_t i = 1; i < 1000005; i++) {
    for(auto k: koho_odd){
      if(i<k){
        break;
      }else{
        dpo[i] = min(dpo[i],dpo[i-k]+1);
      }
    }
  }

  int N;
  while(true){
    cin >> N;
    if(N==0){
      break;
    }else{
      cout << dp[N] << ' ' <<  dpo[N] << endl;
    }
  }
}

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;
      }
    }
    ////ここまでOK
    int dp[100000];
    //fill(dp,dp + x + 1,100000);
  
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,i,j,k,t=0,a[250]={},b[200]={},c[1000005]={2000000},d[1000005]={1000000};
  for(i=1;i<250;i++) {
    a[i-1]=i*(i+1)*(i+2)/6;
    if(a[i-1]%2==1)b[t++]=a[i-1];
  }
  for(i=c[0]=d[0]=0;i<250;i++) {
    for(j=a[i];j<1000005;j++){
      c[j]=min(c[j],c[j-a[i]]+1);
    }
  }
  for(i=0;i<t-1;i++) {
    for(j=b[i];j<1000005;j++){
      d[j]=min(d[j],d[j-b[i]]+1);
    }
  }
  while(cin>>n,n)cout<<c[n]<<" "<<d[n]<<endl;
return 0;
}

C++: #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define Repr(i, n, a) for (int i = (n); i >= (a); i--)
#define rep(i, n) Rep(i, 0, n)
#define repr(i, n) Repr(i, n, 0)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;

#define SIZE 1000010

int dp1[SIZE], dp2[SIZE];

int calc(int n) { return n * (n + 1) * (n + 2) / 6; }

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

    vector<int> v;
    for (int i = 0; calc(i) < 1000000; i++)
        v.push_back(calc(i));
    for (int i = 0; i < 1000010; i++)
        dp1[i] = dp2[i] = INF;
    dp1[0] = dp2[0] = 0;
    for (int i = 0; i < SIZE; i++)
    {
        for (int j = 0; j < v.size(); j++)
        {
            if (i - v[j] >= 0)
                dp1[i] = min(dp1[i], dp1[i - v[j]] + 1);
            if (v[j] % 2 == 1 && i - v[j] >= 0)
                dp2[i] = min(dp2[i], dp2[i - v[j]] + 1);
        }
    }
    int N;
    while (1)
    {
        cin >> N;
        if (N == 0)
            break;
        cout << dp1[N] << " " << dp2[N] << endl;
    }
}

C++: #include <iostream>
using namespace std;
const int  N = 1000100;

int t1[200];
int t2[200];
int dp1[N] = {0};
int dp2[N] = {0};

int main(){
	int i,j,k=2,s;
	
	t1[1] = t2[1] = dp1[1] = dp2[1] = 1;
	for(i = 2; i < 200; i++){
		t1[i] = t1[i-1] * (i+2) / (i-1);
		if(t1[i] > 1e+6) break;
		dp1[t1[i]] = 1;
		if(t1[i]%2){ dp2[t1[i]] = 1; t2[k++] = t1[i];}
	}

	for(i = 2; i < N; i++){
		if(dp2[i]) continue;
		for(j = 1; t2[j] < i && j < 200; j++){
			if(!dp2[i] || (1 + dp2[i-t2[j]]) < (dp2[i])){
				dp2[i] = 1 + dp2[i-t2[j]];
			}
		}
		if(dp1[i]) continue;
		for(j = 1; t1[j] < i; j++){
			if(!dp1[i] || (1 + dp1[i-t1[j]]) < (dp1[i])){
				dp1[i] = 1 + dp1[i-t1[j]];
			}
		}
	}

	while(cin >> s, s)
		cout << dp1[s] << ' ' << dp2[s] << endl;

	return 0;
}