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 <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <climits>
#include <cassert>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF INT_MAX/3
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cout<<#x<<":"<<x<<endl
#define debug2(x,y) cout<<#x","<<#y":"<<x<<","<<y<<endl

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

vi num;
vi num_odd;
int N;
int N_odd;
int dp[1000001];
int dpdp[1000001];

void init(){
    int t=1;
    int i=1;
    while(t<1000000){
        num.EB(t);
        i++;
        t = i*(i+1)*(i+2)/6;
    }
    N = num.size();

    for(i=0;i<N;i++){
        if(num[i]%2==1) num_odd.emplace_back(num[i]);
    }
    N_odd = num_odd.size();
}

void solve(int n){
    for(int i=0;i<=n;i++) dp[i] = INF,dpdp[i]= INF;
    dp[0]=0;
    for(int i=0;i<N;i++){
        for(int j=num[i];j<=n;j++){
            dp[j] = min(dp[j],dp[j-num[i]]+1);
        }
    }


    dpdp[0] = 0;
    for(int i=0;i<N_odd;i++){
        for(int j=num_odd[i];j<=n;j++){
            dpdp[j] = min(dpdp[j],dpdp[j-num_odd[i]]+1);
        }
    }
}

int main(){
    init();
    int n;

    for(int i=0;i<1000001;i++) dp[i] = INF,dpdp[i]= INF;
    dp[0] = 0;
    dpdp[0] = 0;

    solve(1000000);

    while(cin>>n){
        if(n==0) break;
        cout << dp[n] << " " << dpdp[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;
      }
    }
    ////
    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]]=min(dp[i+coin[j]],dp[i]+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<iostream>
#include<queue>

using namespace std;
int tri[1900];
int tetra[190];

class Node{
public:
	int deep;
	int sum;
	int num;
	Node(int d,int s,int n){
		deep=d;
		sum=s;
		num=n;
	}
	void print(){
		cout<<"("<<deep<<","<<sum<<","<<num<<")"<<endl;
	}
	bool operator < (const Node &o) const{
		return deep >o.deep;
	}
};
typedef priority_queue <Node> PQ;
int getTriNum(int n){
//	cout<<"tri:"<<n<<endl;
	if(n==1)return (tri[1]=1);
	if(tri[n]!=0)return tri[n];
	return (tri[n]=getTriNum(n-1)+n);
}

int getTetraNum(int n){
//	cout<<"tetra:"<<n<<endl;
	if(n==1)return (tetra[1]=1);
	if(tetra[n]!=0)return tetra[n];
	return (tetra[n]=getTetraNum(n-1)+getTriNum(n));
}
void print(){
	cout<<"============="<<endl;
	for(int i=1;i<10;i++){
		cout<<tri[i]<<endl;
	}
	cout<<"-------------"<<endl;
	for(int i=1;i<10;i++){
		cout<<tetra[i]<<endl;
	}
	cout<<"============="<<endl;
}
int dijkstra(int limit){
	PQ pq;
	pq.push(Node(0,0,1));
	while(!pq.empty()){
		Node cur=pq.top();
		pq.pop();
	//	cur.print();
		if(cur.sum==limit)return cur.deep;
		for(int i=cur.num;i<=190;i++){
			if(cur.sum+getTetraNum(i)>limit)break;
			pq.push(Node(cur.deep+1,cur.sum+getTetraNum(i),i));
		}
	}
	return -1;
}
int dijkstra2(int limit){
	PQ pq;
	pq.push(Node(0,0,1));
	while(!pq.empty()){
		Node cur=pq.top();
		pq.pop();
//		cur.print();
		if(cur.sum==limit)return cur.deep;
		for(int i=cur.num;i<=190;i++){
			if(cur.sum+getTetraNum(i)>limit)break;
			if(!(getTetraNum(i)%2))continue;
			pq.push(Node(cur.deep+1,cur.sum+getTetraNum(i),i));
		}
	}
	return -1;
}

int
main(){
	while(true){
		int n;
		cin>>n;
		if(!n)break;
		int count;
		if((count=dijkstra(n))>0){
			cout<<count;
		}
		if((count=dijkstra2(n))>0){
			cout<<" "<<count<<endl;
		}
	}

	//	print();
	return 0;
}

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

#define REP(i,n) for(int i=0;i<(int)(n);i++)
const int INF = 1e+8;

using namespace std;

int main() {
  int m=1e+6;
  vector<int> dp1(2*m, INF), dp2(2*m, INF);
  dp1[0]=dp2[0]=0;
  REP(i,200) {
    int t=i*(i+1)*(i+2)/6;
    if (t>m) break;
    REP(j,m){
      dp1[j+t] = min(dp1[j+t], dp1[j]+1);
      if(t%2) dp2[j+t] = min(dp2[j+t], dp2[j]+1);
    }
  }
  while(1){
    int n;
    cin>>n;
    if(!n)break;
    cout<<dp1[n]<<' '<<dp2[n]<<endl;
  }
  return 0;
}