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 prime[200],dprime[100];
int dp[1000000];
int main(){
	int a=1,b=2,count=1,dcount=1;
	prime[0]=1,dprime[0]=1;
	while(true){
		a+=b;
		b++;
		if(prime[count-1]+a>=1000000)
			break;
		if((prime[count-1]+a)%2==1){
			dprime[dcount]=prime[count-1]+a;
			dcount++;
		}
		prime[count]=prime[count-1]+a;
		count++;
	}
	int n;
	while(true){
	cin>>n;
	if(n==0)
		break;
	for(int i=0;i<=n;i++)
		dp[i]=i;
	for(int i=1;i<count;i++)
		for(int j=n;j>=0;j--)
			for(int k=j;k>=0;k-=prime[i])
				dp[j]=min(dp[j],dp[k]+(j-k)/prime[i]);
	cout<<dp[n]<<" ";
	for(int i=0;i<=n;i++)
		dp[i]=i;
	for(int i=1;i<dcount;i++)
		for(int j=n;j>=0;j--)
			for(int k=j;k>=0;k-=dprime[i])
				dp[j]=min(dp[j],dp[k]+(j-k)/dprime[i]);
	cout<<dp[n]<<endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int a[200]={0},b[150]={0},c[1500001]={0,1,2,3},d[1500001],k=0,i,j,n;
  for(i=1;i<200;i++)a[k++]=i*(i+1)*(i+2)/6;
  for(j=k=0;j<i;j++)if(a[j]%2)b[k++]=a[j];
  for(i=1;i<198;i++)for(j=a[i];j<a[i+1];j++)c[j]=c[j-a[i]]+1;
  for(i=0;i<36;i++)d[i]=i;
  for(i=1;i<k-1;i++)for(j=b[i];j<b[i+1];j++)d[j]=d[j-b[i]]+1;
  while(cin>>n,n)cout<<c[n]<<' '<<d[n]<<endl;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int x[8000000][2], a[999], b[999], s, n;
int main() {
	a[0] = 1; b[0] = 1;
	for (int i = 1; i < 300; i++) {
		a[i] = a[i - 1] + (i + 1)*(i + 2) / 2;
		if (a[i] % 2 == 1) {
			s++; b[s] = a[i];
		}
	}
	n = 1200000;
	memset(x, 127, sizeof(x));
	x[0][0] = 0; x[0][1] = 0;
	for (int i = 0; i < 200; i++) {
		for (int j = 0; j < n; j++) {
			x[j + a[i]][0] = min(x[j + a[i]][0], x[j][0] + 1);
		}
	}
	for (int i = 0; i < 50; i++) {
		for (int j = 0; j < n; j++) {
			x[j + b[i]][1] = min(x[j + b[i]][1], x[j][1] + 1);
		}
	}
	while (true) {
		cin >> n; if (!n) { break; }
		cout << x[n][0] << x[n][1] << endl;
	}
}

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

struct P{
  int sum,k,n;
  P(){}
  P(int S,int K,int N){ sum=S;k=K;n=N; }
};

int a[200];

int main(){
  int n, ans1,ans2;
  queue<P> q;
  P p;


  for( int i=1;i<200 ; i++ )
    if( (a[i]=i*(i+1)*(i+2)/6)>1000000 )
      break;

  int size,n2;
  while( cin>>n && n ){

    ans1=0;
    while( !q.empty() ) q.pop();
    for( int i=1;i<200;i++ ){
      if( a[i]==n ){
	ans1=1; size=i+1;
	break;
      }
      if( a[i]<n ) q.push( P(a[i],i,1) );
      else{
	size=i; break;
      }
    }
    while( !ans1 ){
      p=q.front(); q.pop();
      n2=p.n+1;
      for( int i=p.k,j;i<size;i++ ){
	j=p.sum+a[i];
	if( j==n ){
	  ans1=n2; break;
	}
	q.push( P(j,i,n2) );
      }
    }

    ans2=0;
    while( !q.empty() ) q.pop();
    for( int i=1;i<size;i++ ){
      if( a[i]%2==1 ){
	if( a[i]==n ){ ans2=1; break; }
	q.push( P(a[i],i,1) );
      }
    }
    while( !ans2 ){
      p=q.front(); q.pop();
      n2=p.n+1;
      for( int i=p.k,j;i<size;i++ ){
	if( a[i]%2==1 ){
	  j=p.sum+a[i];
	  if( j==n ){
	    ans2=n2; break;
	  }
	  q.push( P(j,i,n2) );
	}
      }
    }
    
    cout << ans1 << " " << ans2 << endl;
  }
    
  return 0;
}

C++: #include <iostream>
#include <vector>

using namespace std;

int m;
int f(int n) { return n*(n+1)*(n+2)/6; }
vector<int> l1, l2;

void r(int n, int step, vector<int> &l, int p) {
  if(step+1 >= m) return;
 
  for(int i=p; i>=0; i--) {
    int n2 = n-l[i];
    if(n2<0) continue;
    if(n2==0) {
      m = step+1;
      return;
    }
    if(n2>0) {
      r(n2, step+1, l, i);
    }
  }
  
}

int main() {
  while(1) {
    vector<int> l1, l2;
    int n;

     cin >> n;
     if(n==0) break;
    
    // not over
    for(int i=1; true; i++) {
      int mm = f(i);
      if(mm>n) break;
      l1.push_back(mm);
      if(mm&1) l2.push_back(mm);
    }

    m = n;
    r(n, 0, l1, l1.size()-1);
    cout << m;

    cout << ' ';
    
    m = n;
    r(n, 0, l2, l2.size()-1);
    cout << m;

    cout << "\n";

    
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#define N 1000000

using namespace std;

int main(){
	vector<int> sq;
	vector<int> sqodd;
	int a[N];
	int aodd[N];
	for(int i = 1; i * (i + 1) * (i + 2) <= N; i++)  sq.push_back((i * (i + 1) * (i + 2)) / 6);
	for(int i = 1; i * (i + 1) * (i + 2) <= N; i++){
		if(((i * (i + 1) * (i + 2)) / 6) % 2)
		 	sqodd.push_back((i * (i + 1) * (i + 2)) / 6);
	}
	for(int i = 0; i < N; i++) a[i] = N;
	for(int i = 0; i < N; i++) aodd[i] = N;
	for(int i = 0; i < sq.size(); i++) a[sq[i]] = 1;
	for(int i = 0; i < sqodd.size(); i++) aodd[sqodd[i]] = 1;
	for(int i = 1; i < N; i++){
		if(a[i] == N) continue;
		for(int j = 0; j < sq.size(); j++){
			if(sq[j] + i < N && a[sq[j] + i] > a[i] + 1) a[sq[j] + i] = a[i] + 1;
		}
	}
	for(int i = 1; i < N; i++){
		if(aodd[i] == N) continue;
		for(int j = 0; j < sqodd.size(); j++){
			if(sqodd[j] + i < N && aodd[sqodd[j] + i] > aodd[i] + 1) aodd[sqodd[j] + i] = aodd[i] + 1;
		}
	}	
	int n;
	while(cin >> n, n){
		cout << a[n] << " " << aodd[n] << endl;
	}
	return 0;
}