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 <bits/stdc++.h>
 
#define loop(n, i) for(int i=0;i<n;i++)
#define from_to(from, to, i) for(int i=from;i<=to;i++)

using namespace std;
typedef long long ll;
const int MAX = 1000010;
const int INF = 1<<29;

int main(int argc, char const* argv[])
{
    vector<int> V;
    for (int i = 1; i*(i+1)*(i+2)/6 < MAX; i++) {
        V.push_back(i*(i+1)*(i+2)/6);
    }

    int all[MAX], odd[MAX];
    fill(all, all+MAX, INF);
    fill(odd, odd+MAX, INF);

    all[0] = odd[0] = 0;
    for (int v : V) {
        loop (v, i) {
            for (int j = 1; i+v*j < MAX; j++) {
                all[i+v*j] = min(all[i+v*j], all[i+v*(j-1)] + 1);

                if (v%2) {
                    odd[i+v*j] = min(odd[i+v*j], odd[i+v*(j-1)] + 1);
                }
            }
        }
    }

    while (1) {
        int n; cin >> n;
        if (!n) break;
        printf("%d %d\n", all[n], odd[n]);
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int b[1000000],d[1000000];
int main(){
  
  int c[181];
  fill(b,b+1000000,1000000);
  fill(d,d+1000000,1000000);
  for(int i=1;i<=180;i++){
    c[i] = i*(i+1)*(i+2)/6;
    b[ c[i] ] = 1;
    if(c[i]%2 == 1) d[ c[i] ] = 1;
  }
  
  for(int i=1;i<=180;i++){
    for(int j=1;j<1000000-c[i];j++){
      b[j+c[i]] = min(b[j+c[i]],b[j]+1);
      if(c[i]%2 == 1) d[j+c[i]] = min(d[j+c[i]],d[j]+1);
    }
  }
  
  
  
  int n;
  while(cin>>n,n!=0)
    cout << b[n] << ' ' << d[n] << endl;
  
  return (0);
}

C++: #include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll mod = ll(1e9) + 7;
const int INF = int(1e9);

int dp[1000000] = {};
int dp_o[1000000] = {};
map<int, int>mp, mp_o;
int DP(int num) {
	if (dp[num] != 0)return dp[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 1;
	while (1) {
		rec = min(DP(mp[cnt]) + DP(num - mp[cnt]), rec);
		cnt++;
		if (mp[cnt] > num)break;
	}
	dp[num] = rec;
	return rec;

}
int DP_o(int num) {
	if (dp_o[num] != 0)return dp_o[num];
	if (num == 0)return 0;
	int rec = INF;
	int cnt = 1;
	while (1) {
		rec = min(DP(mp_o[cnt]) + DP(num - mp_o[cnt]), rec);
		cnt++;
		if (mp_o[cnt] > num)break;
	}
	dp_o[num] = rec;
	return rec;

}

int main() {
	cin.sync_with_stdio(false);
	ll cnt1 = 1, cnt2 = 1;
	dp[1] = 1, dp[1] = 1;
	mp[1] = 1, mp_o[1] = 1;
	int cnt_o = 2;
	reps(i, 2, 1000001) {
		cnt1 += i;
		cnt2 += cnt1;
		dp[cnt2] = 1;
		mp[i] = cnt2;
		if (cnt2 % 2 == 1) {
			dp_o[cnt2] = 1;
			mp[cnt_o] = cnt2;
			cnt_o++;
		}
	}
	while (1) {
		int Q;
		cin >> Q;
		if (Q == 0)break;
		cout << DP(Q) << " ";
		cou << DP_o(Q) << endl;
	}


	return 0;
}

C++: #include<iostream>
using namespace std;
int prime[180],oddprime[100];
int dp[200][1000000];
int main(){
	int count=1,oddcount=1;
	prime[0]=1,oddprime[0]=1;
	while(true){
		prime[count]=prime[count-1]*(count+3)/count;
		if(prime[count]%2==1){
			oddprime[oddcount]=prime[count];
			oddcount++;
		}
		if(prime[count]>=1000000)
			break;
		count++;
	}
	int n;
	while(true){
	cin>>n;
	if(n==0)
		break;
	for(int i=0;i<=n;i++)
		dp[0][i]=i;
	for(int i=1;i<count;i++)
		for(int j=0;j<=n;j++)
			dp[i][j]=100000;
	for(int i=1;i<count;i++)
		for(int j=0;j<=n;j++)
			for(int k=j;k>=0;k-=prime[i])
				dp[i][j]=min(dp[i][j],dp[i-1][k]+(j-k)/prime[i]);
	cout<<dp[count-1][n]<<" ";
	for(int i=1;i<oddcount;i++)
		for(int j=0;j<=n;j++)
			dp[i][j]=100000;
	for(int i=1;i<oddcount;i++)
		for(int j=0;j<=n;j++)
			for(int k=j;k>=0;k-=oddprime[i])
				dp[i][j]=min(dp[i][j],dp[i-1][k]+(j-k)/oddprime[i]);
	cout<<dp[oddcount-1][n]<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
#define INF 100000000
#define ll long long

int dp1[1000001];
int dp2[1000001];
int main()
{
	vector<ll> poloc;
	
	int i = 1;
	while (i*(i + 1)*(i + 2) / 6 <= 1000000) {
		poloc.push_back(i*(i + 1)*(i + 2) / 6);
		i++;
	}

	REP(i, 1, 1000001) dp1[i] = dp2[i] = INF;
	dp1[0] = dp2[0] = 0;
	REP(i, 0, poloc.size()) {
		REP(j, 0, 1000001) {
			if (j + poloc[i] > 1000000) break;
			dp1[j + poloc[i]] = min(dp1[j + poloc[i]], dp1[j] + 1);
		}

		if (poloc[i] % 2 == 1) {
			REP(j, 0, 1000001) {
				if (j + poloc[i] > 1000000) break;
				dp2[j + poloc[i]] = min(dp2[j + poloc[i]], dp2[j] + 1);
			}
		}
	}

	int n;
	while (cin >> n, n) {
		cout << dp1[n] << " " << dp2[n] << endl;
	}
	return 0;
}

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

const int MAX = 1000000;
const int INF = 1<<29;

int main() {
    vector<int> dp(MAX, INF), odddp(MAX, INF);
    dp[0] = odddp[0] = 0;
    for (int i = 1;; ++i) {
        int num = i * (i+1) * (i+2) / 6;
        if (num >= MAX) break;
        for (int j = num; j < MAX; ++j) {
            dp[j] = min(dp[j], dp[j-num]+1);
            if (num % 2 == 1) odddp[j] = min(odddp[j], odddp[j-num]+1);
        }
    }
    int n;
    while (cin >> n) {
        if (n == 0) break;
        cout << dp[n] << " " << odddp[n] << endl;
    }
}