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<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };


int dp[190][1000010] = { 0 };
int dpodd[190][1000010] = { 0 };


int N = 0;
int C[191];
int Codd[51];

void input(void) {
	CI N;

	return;
}


int main(void) {
	int C_N;
	for (int i = 1; i <= 190;i++) {
		C[i - 1] = i * (i + 1) * (i + 2) / 6;
	}
	int ii = 1, jj = 0;
	while (true) {
		if (ii * (ii + 1) * (ii + 2) / 6 > 1000000) {
			break;
		}
		if ((ii * (ii + 1) * (ii + 2) / 6) % 2 == 1) {
			Codd[jj] = ii * (ii + 1) * (ii + 2) / 6;
			jj++;
		}
		ii++;
	}

	for (int i = 1; i <= N; i++) {
		dp[0][i] = 1001000;
	}
	for (int i = 1; i <= N; i++) {
		dpodd[0][i] = 1001000;
	}

	for (int j = 1; j <= 189; j++) {
		for (int i = 1; i <= 1000002; i++) {
			if (i < C[j - 1]) {
				dp[j][i] = dp[j - 1][i];
			}
			else {
				dp[j][i] = min(dp[j - 1][i], dp[j][i - C[j - 1]] + 1);
			}
		}
	}

	for (int j = 1; j <= 50; j++) {
		for (int i = 1; i <= 1000002; i++) {
			if (i < Codd[j - 1]) {
				dpodd[j][i] = dpodd[j - 1][i];
			}
			else {
				dpodd[j][i] = min(dpodd[j - 1][i], dpodd[j][i - Codd[j - 1]] + 1);
			}
		}
	}

	while (true) {
		input();
		if (N == 0) {
			break;
		}
		for (int i = 0; i < 190; i++) {
			if (C[i] > N) {
				C_N = i;
				break;
			}
		}
	

		

		CO dp[C_N][N] << " ";

		
		for (int i = 0; i < 50; i++) {
			if (Codd[i] > N) {
				C_N = i;
				break;
			}
		}
		

		CO dpodd[C_N][N] E
		
		
	}
	
	
	return 0;
}

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

const int MAX_N = 1000001;
const int INF = 1e+8;
 
int f(int n){
	return (n * (n + 1) * (n + 2)) / 6;
}

int main(){
	vector<int> v, w;
	for(int i=1 ; f(i) < MAX_N ; i++ ){
		v.push_back( f(i) );
		if( f(i) % 2 == 1 ){
			w.push_back( f(i) );
		}
	}
	
	// dp[i] := 整数 i を正四面体数の和で表すときの個数の最小値
	int dp[MAX_N];
	int dp2[MAX_N];
	for(int i=0 ; i < MAX_N ; i++ ){
		dp[i] = dp2[i] = INF;
	}
	for(int i=0 ; i < v.size() ; i++ ){
		dp[ v[i] ] = 1;
	}
	for(int i=0 ; i < w.size() ; i++ ){
		dp2[ w[i] ] = 1;
	}
	for(int i=1 ; i < MAX_N ; i++ ){
		if( dp[i] != INF ){
			for(int j=0 ; j < v.size() && i + v[j] < MAX_N ; j++ ){
				dp[ i + v[j] ] = min( dp[i+v[j]] , dp[i] + 1 );
			}
		}
		if( dp2[i] != INF ){
			for(int j=0 ; j < w.size() && i + w[j] < MAX_N ; j++ ){
				dp2[ i + w[j] ] = min( dp2[i+w[j]] , dp2[i] + 1 );
			}
		}
	}
	
	int n;
	while( cin >> n , n ){
		cout << dp[n] << " " << dp2[n] << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

int dp[1000000];
int dpodd[1000000];
int num[200];
int INF = 10000000;
int main(){
	for(int i = 0; i < 200; i++){
		num[i] = (i + 1) * (i + 2) * (i + 3)/ 6;
	}
	dp[0] = 0;
	dpodd[0] = 0;
	for(int i = 1; i < 1000000; i++){
		dp[i] = INF;
		dpodd[i] = INF;
		for(int j = 0; num[j] <= i; j++){
			dp[i] = min(dp[i], dp[i - num[j]] + 1);
			if(num[j] % 2 == 1){
				dpodd[i] = min(dpodd[i], dpodd[i - num[j]] + 1);
			}
		}
	}
	int N;
	while(cin >> N, N){
		cout << dp[N] << " " << dpodd[N] << endl;
	}
}

C++: #include<iostream> 
#include<vector>
#include<algorithm>
int memo[1001][1001];
long long int mem1[100001];
	int n;
	int u;	
	int w[1000], v[1000];
	int pol[200];
int mm(int i, int u) {
	int max = 0;
	if (memo[i][u]!=-1) {
		return memo[i][u];
	}
		if (u - w[i] > 0) {
			max += std::max(mm(1+i, u - w[i]) + v[i] , mm(1+i, u) ); 
		
			
		}
		else if(u-w[i]<0) max = mm(i + 1, u);
	
	return	memo[i][u] = max;
}
int pollock(int i, int u) {
	int count = 0;
	
	if (u == 0) {
		return 0;
	}
	if (u>=pol[i]) {
		if (u - pol[i] == pol[i]) {
			return 2;
		}
		else count =1+ std::min(pollock(i + 1, u - pol[i]), pollock(i + 1, u));
	}
	else return 0;
	return mem1[u - pol[i]] = count;
}
int main() {
	for (int i = 0; i < 200; ++i) {
		int num = i + 1;
		pol[i] = num * (num + 1)*(num + 2) / 6;
	}
	
	/*for (int i = 0; i < 1001; ++i) {
		for (int j = 0; j < 1001; ++j) {
			memo[i][j] = -1;
		}
	}
	std::cin >> n>>u;
	for (int i = 0; i < n; ++i) {
		std::cin >> v[i] >> w[i];
	}
	std::cout << mm(0, u) << std::endl;*/
	
	while (std::cin >> n) {
	std::cout << pollock(0, n) << std::endl;
	}

}