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 REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
using namespace std;

void pol(vector<int> vt,set<int> s,int N){
	int count=1;
	while(s.find(N)==s.end()){
		count++;
		set<int> tmps;
		for(auto itr=s.begin();itr!=s.end();itr++){
			for(auto itr2=vt.begin();itr2!=vt.end();itr2++){
				tmps.insert(*itr + *itr2);
			}
		}
		s=tmps;
	}

	cout<<count<<" ";

	return;
}

int main(){
	int N;
	while(cin>>N,N){
		int num=0,dnum=0;
		set<int> s,sodd;
		vector<int> vt,vtodd;
		for(int i=1;num<=N;i++){
			dnum+=i;
			num+=dnum;
			if(num>N) break;
			vt.push_back(num);
			s.insert(num);
			if(num%2) {
				sodd.insert(num);
				vtodd.push_back(num);
			}
		}
		pol(vt,s,N);
		pol(vtodd,sodd,N);
		p("");
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#define INF 1 << 9
#define MAX 1000001
using namespace std;

int pollock[200];
int pollock2[200] = {INF};
int dp[MAX];
int dpo[MAX];

void calcDpo() {
  for (int i = 0; i < MAX; i++)
    dpo[i] = i;
  for (int i = 0; i < 200; i++) {
    if (pollock2[i] > MAX) break;
    for (int j = pollock2[i]; j < MAX - 1; j++) {
      dpo[j] = min(dpo[j], dpo[j - pollock2[i]] + 1);
    }
  }
}

void calcDp() {
  for (int i = 0; i < MAX; i++)
    dp[i] = i;
  for (int i = 1; i < 200; i++) {
    if (pollock[i] > MAX) break;
    for (int j = pollock[i]; j < MAX - 1; j++) {
      dp[j] = min(dp[j], dp[j - pollock[i]] + 1);
    }
  }
}

void calcPollock() {
  for (int i = 0; i < 200; i++) {
    pollock[i] = i * (i + 1) * (i + 2) / 6;
  }
  pollock2[0] = 0;
  int j = 1;
  for (int i = 0; i < 200; i++) {
    if (pollock[i] % 2)
      pollock2[j++] = pollock[i];
  }
}

int main() {
  calcPollock();
  calcDp();
  calcDpo();
  

  while (true) {
    int n;
    cin >> n;
    if (n == 0) return 0;

    cout << dp[n] << ' ' << dpo[n] << endl;
  }
}

C++: #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"

using namespace std;

const long long int MOD = 1000000007;


long long int N, M, K, H, W, L, R;

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

	vector<int>e(1000000, MOD);
	e[0] = 0;
	for (int i = 0; i < 1000000; i++) {
		for (int j = 1; j < 1000; j++) {
			int box = i + j * (j + 1)*(j + 2) / 6;
			if (box >= 1000000)break;
			e[box] = min(e[box], e[i] + 1);
		}
	}
	vector<int>o(1000000, MOD);
	o[0] = 0;
	for (int i = 0; i < 1000000; i++) {
		for (int j = 1; j < 1000; j += 2) {
			int box = i + j * (j + 1)*(j + 2) / 6;
			if (box >= 1000000)break;
			o[box] = min(o[box], o[i] + 1);
		}
	}
	cin >> N;
	while (N) {
		cout << e[N] << " " << o[N] << endl;
		cin >> N;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#define INF 1<<28
using namespace std;
 
int p[222];
int memo[1000001];
int memo2[1000001];
 
int solve(int n){

  if(!n) return 0;
  if(memo[n]) return memo[n];
   
  int ans = INF;
  for(int i=1;p[i]<=n; 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=1;p[i]<=n;i++){
    if(p[i]&1) ans = min(ans, solve2(n-p[i])+1);
  }
   
  return memo2[n] = ans;
}
 
int main(){
   
  int n;
   
  for(int i=0;i<=181;i++) p[i] = i*(i+1)*(i+2)/6;
  for(int i=1;i<=1000000;i+=100) solve(i), solve2(i);
   
  while(cin >> n, n) cout << solve(n) << " " << solve2(n) << endl;
}