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>
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 <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]]=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;
}

C++: #include <bits/stdc++.h>
using namespace std;
const int MAX=200,MAX_N=1e6+10;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<int> reg(MAX),dp0(MAX_N,MAX_N),dp1(MAX_N,MAX_N);
    for (int i=0;i<MAX;++i)
        reg[i]=i*(i+1)*(i+2)/6;
    dp0[0]=dp1[0]=0;
    for (int i=0;i<MAX_N;++i){
        for (int j=1;i+reg[j]<MAX_N;++j){
            dp0[i+reg[j]]=min(dp0[i+reg[j]],dp0[i]+1);
            if (reg[j]&1) dp1[i+reg[j]]=min(dp1[i+reg[j]],dp1[i]+1);
        }
    }
    int n;
    while(cin >> n,n){
        cout << dp0[n] << ' ' << dp1[n] << '\n';
    }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;

const int N = 1000000 + 1;
ll dp[N], dp2[N];

int main() {

    dp[0] = dp2[0] = 0;
    for (int i=1; i<N; ++i) {
        dp[i] = dp2[i] = i;
        for (int n=1;; ++n) {
            int p = n*(n+1)*(n+2)/6;
            if (p > i) break;
            dp[i] = min(dp[i], dp[i-p]+1);
            if (p%2) {
                dp2[i] = min(dp2[i], dp2[i-p]+1);
            }
        }
    }

    int n;
    while (cin >> n and n) {
        cout << dp[n] << " " << dp2[n] << endl;
    }

    return 0;
}

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

const int MAX = 1000000;
int tri[200];
int dp[MAX], o_dp[MAX];

int main()
{
	for (int i = 0; i < 200; i++) {
		tri[i] = i*(i + 1)*(i + 2) / 6;
	}

	dp[0] = 0;
	o_dp[0] = 0;

	for (int i = 1; i < MAX; i++) {
		dp[i] = i;
		o_dp[i] = i;

		for (int j = 1; i - tri[j] >= 0; j++) {
			dp[i] = min(dp[i], dp[i - tri[j]] + 1);

			if (tri[j] % 2 == 1) {
				o_dp[i] = min(o_dp[i], o_dp[i - tri[j]] + 1);
			}
		}
	}

	while (true) {
		int n;
		cin >> n;

		if (n == 0) {
			break;
		}

		cout << dp[n] << " " << o_dp[n] << endl;
	}

	return 0;
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1111111];
int memo2[1111111];
 
int solve(int n){
   
  if(!n) return 0;
  if(~memo[n]) return memo[n];
 
  int ans = INF;
  for(int i=180;i>0;i--) if(n >= p[i]) ans = min(ans, solve(n-p[i])+1);
   
  return memo[n] = ans;
}
 
int solve2(int n){
   
  if(!n) return 0;
  if(~memo2[n]) return memo2[n];
 
  int ans = INF;
  for(int i=180;i>0;i--) if(p[i]&1 && n >= p[i]) ans = min(ans, solve2(n-p[i])+1);
 
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  memset(memo, -1, sizeof(memo));
  memset(memo2, -1, sizeof(memo2));
 
  for(int i=0;i<181;i++) p[i] = i*(i+1)*(i+2)/6;

  for(int i=0;i<1111111;i++){ solve(i), solve2(i); }
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
 
}

C++: #include<stdio.h>
int list[181],dp[999999],dq[999999];
int main(){
    for(int i=0;i<999999;i++){
        dp[i]=1000000;
        dq[i]=1000000;
    }
    for(int i=0;i<181;i++){
        list[i]=(i+1)*(i+2)*(i+3)/6;
        dp[list[i]-1]=1;
        if(i%4==0) dq[list[i]-1]=1;
    }
    for(int i=0;i<999999;i++){
        for(int j=0;list[j]<=i;j++){
            if(dp[i]>dp[i-list[j]]+1) dp[i]=dp[i-list[j]]+1;
            if(j%4==0&&dq[i]>dq[i-list[j]]+1) dq[i]=dq[i-list[j]]+1;
        }
    }
    while(1){
        int n;
        scanf("%d",&n);
        if(n==0) return 0;
        printf("%d %d\n",dp[n-1],dq[n-1]);
    }
}

C++: #include<iostream>
#include<algorithm>
 
using namespace std;
 
const int N=1000000;
const int INF=1<<30;
 
int main(){
  static int dp[N];
  static int dpo[N];
  fill(begin(dp),end(dp),INF);
  fill(begin(dpo),end(dpo),INF);
  dp[0]=dpo[0]=0;
  for(int i=0;;i++){
    int q=i*(i+1)*(i+2)/6;
    if(q>N)break;
    for(int j=q;j<N;j++){
      dp[j]=min(dp[j],dp[j-q]+1);
      if(q%2){
    dpo[j]=min(dpo[j],dpo[j-q]+1);
      }
    }
  }
  for(int n;cin>>n,n;){
    cout<<dp[n]<<' '<<dpo[n]<<endl;
  }
}