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++: #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 1<<30
#define MOD 1000000007
#define mod 998244353
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp(pair<ll,ll>a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi<b.fi;
}
//----------------------------------------------------------------------

//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_time=clock();
    //-------------------------------
    
    int dp[1000100],dpodd[1000100];
    for(int i=0;i<1000100;i++){
        dp[i]=INF;
        dpodd[i]=INF;
    }
    dp[0]=0;
    dpodd[0]=0;
        for(int i=1;;i++){
            ll y=i*(i+1)*(i+2)/6;
            if(y>1e6)break;
            for(int j=y;j<1000100;j++){
                chmin(dp[j],dp[j-y]+1);
                if(y%2!=0)chmin(dpodd[j],dpodd[j-y]+1);
            }
        }
    int n;cin>>n;
    while(n){
        cout<<dp[n]<<" "<<dpodd[n]<<Endl;
        cin>>n;
    }
    //-------------------------------  
    //ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------

C++: #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<P,P> PP;
const ll MOD=10000;
const ll INF=1000000010;
const int MAX=100001;
int dx[8]={0,1,0,-1,1,-1,1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
int main(){
	int s[110];
	for(int i=0;i<110;i++){
		s[i]=(i+1)*(i+2)*(i+3)/6;
	}
	int n;
	while(cin>>n,n){
		int nn=n;
		int c=0;
		while(n){
			c++;
			int ss;
			for(int i=0;i<110;i++){
				if(s[i]>n){
					ss=s[i-1];
					break;
				}
			}
			n-=ss;
		}
		cout<<c<<" ";
		n=nn;
		c=0;
		while(n){
			c++;
			int ss;
			for(int i=0;i<110;i++){
				if(s[i]>n){
					ss=i-1;
					break;
				}
			}
			for(int i=ss;i>=0;i--){
				if(s[i]%2){
					ss=s[i];
					break;
				}
			}
			n-=ss;
		}
		cout<<c<<endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;

const int NUM = 222;
const int MAX_N = 1010101;
const int INF = 1001001001;

ll tri[NUM];
ll tet[NUM];
ll dp_a[MAX_N];
ll dp_o[MAX_N];

int main() {
    for (int i = 1; i < NUM; i++) {
        tri[i] = tri[i - 1] + i;
    }
    for (int i = 1; i < NUM; i++) {
        tet[i] = tet[i - 1] + tri[i];
    }
    fill(dp_a, dp_a + MAX_N, INF);
    fill(dp_o, dp_o + MAX_N, INF);
    dp_a[0] = dp_o[0] = 0;
    for (int i = 0; i < NUM; i++) {
        for (int j = tet[i]; j <= MAX_N; j++) {
            dp_a[j] = min(dp_a[j], dp_a[j - tet[i]] + 1);
            if (tet[i] & 1) dp_o[j] = min(dp_o[j], dp_o[j - tet[i]] + 1);
        }
    }
    int n;
    while (cin >> n && n) {
        cout << dp_a[n] << ' ' << dp_o[n] << endl;
    }
}

C++: #include <stdio.h>
#define INF 0x7FFFFFFF

int main(void){
	int i, j, n, min1;
	int dp[1000000];
	scanf("%d",&n);
	while(n != 0){
		for(i = 0;i <= n;i++)
			dp[i] = INF;
		dp[0] = 0;
		for(i = 0;i < n;i++){
			for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
				if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1)
					dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
			}
		}

		min1 = dp[n];
		for(i = 0;i <= n;i++)
			dp[i] = INF;
		dp[0] = 0;
		for(i = 0;i < n;i++){
			for(j = 1;(j * (j + 1) * (j + 2)) / 6 + i <= n;j++){
				if(dp[(j * (j + 1) * (j + 2)) / 6 + i] > dp[i] + 1 && j * (j + 1) * (j + 2) / 6 % 2 == 1)
					dp[(j * (j + 1) * (j + 2)) / 6 + i] = dp[i] + 1;
			}
		}
		printf("%d %d\n",min1,dp[n]);
		scanf("%d",&n);
	}
	return 0;
}