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<queue>

using namespace std;
unsigned 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;
	}
	bool operator < (const Node &o) const{
		return deep >o.deep;
	}
};
typedef queue <Node> Q;

int bfs(int limit){
	Q pq;
	pq.push(Node(0,0,1));
	while(!pq.empty()){
		Node cur=pq.front();
		pq.pop();
		if(cur.sum==limit)return cur.deep;
		for(int i=cur.num;i<=182;i++){
			if(cur.sum+tetra[i]>limit)break;
			pq.push(Node(cur.deep+1,cur.sum+tetra[i],i));
		}
	}
	return -1;
}
int bfs2(int limit){
	Q pq;
	pq.push(Node(0,0,1));
	while(!pq.empty()){
		Node cur=pq.front();
		pq.pop();
		if(cur.sum==limit)return cur.deep;
		for(int i=cur.num;i<=182;i++){
			if(cur.sum+tetra[i]>limit)break;
			if(!(tetra[i]%2))continue;
			pq.push(Node(cur.deep+1,cur.sum+tetra[i],i));
		}
	}
	return -1;
}

int
main(){
	tetra[1]=1;
	for(int i=0;i<=192;i++){
		tetra[i]=(i*(i+1)*(i+2))/6;
	}
	while(true){
		int n;
		cin>>n;
		if(!n)break;
		int count;
		if((count=bfs(n))>0){
			cout<<count;
		}
		if((count=bfs2(n))>0){
			cout<<" "<<count<<endl;
		}
	}
	return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
   
using namespace std;

int main()
{
    vector<vector<int> > tetra(2);
    for(int i = 1; (i * (i + 1) * (i + 2)) / 6 < 1000001; i++){
        tetra[0].push_back((i * (i + 1) * (i + 2)) / 6);
        tetra[((i * (i + 1) * (i + 2)) / 6) % 2].push_back((i * (i + 1) * (i + 2)) / 6);
    }
    // for(int i = 0; i < 2; i++){
    //     for(int j = 0; j < tetra[i].size(); j++){
    //         cout << tetra[i][j] << endl;
    //     }
    //     cout << endl;
    // }
    int result[1000001][2];
    for(int i = 0; i < 1000001; i++){
        for(int j = 0; j < 2; j++){
            result[i][j] = 1000001;
        }
    }
    result[0][0] = 0;
    result[0][1] = 0;
    for(int i = 0; i < 2; i++){
        for(int j = 0; j < tetra[i].size(); j++){
            for(int k = 0; k + tetra[i][j] < 100001; k++){
                result[k + tetra[i][j]][i] = min(result[k + tetra[i][j]][i], result[k][i] + 1);
            }
        }
    }
    int n;
    while(1){
        cin >> n;
        if(n == 0)break;
        cout << result[n][0] << " " << result[n][1] << endl;
    }
    return 0;
}

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

int main(){
    vector<long long> polock;
    vector<long long> oddpolock;
    long long pol = 1;
    polock.push_back(1);
    oddpolock.push_back(1);
    
    for (int i=2; i<201; i++){
        pol += i;
        long long stack = polock.back() + pol;
        polock.push_back(stack);
        if (stack%2==1){
            oddpolock.push_back(stack);
        }
    }
    
    long long INF = pow(10,18);
    vector<long long> dp(pow(10,6), INF);
    vector<long long> dp2(pow(10,6), INF);
    dp[0] = 0;
    dp2[0] = 0;
    
    for (int i=1; i < pow(10,6); i++){
        for (int j = 0; j < polock.size(); j++){
            if (polock[j] > i) break;
            dp[i] = min(dp[i],dp[i-polock[j]] + 1);
        }
    }
    
    for (int i=1; i < pow(10,6); i++){
        for (int j = 0; j < oddpolock.size(); j++){
            if (oddpolock[j] > i) break;
            dp2[i] = min(dp2[i],dp2[i-oddpolock[j]] + 1);
        }
    }
    
    int n;
    cin >> n;
    while (n!=0){
        cout << dp[n] << ' ' << dp2[n] << endl;
        cin >> n;
    }
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
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];
    
    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);
	  tmp=min(dp[i+coin[j]],dp[i]+1);
	  dp[i+coin[j]]=tmp;
	}
      }
    }


    int ans1=1;

    int dp2[100000];
    
    for(int i=0;i<100000;i++)
      dp2[i]=100000;



    dp2[0]=0;
    for(int i = 0;i<x;i++){
      for(int j=0;j<count_ki;j++){
	if(i+coin_ki[j]<=x){
	  //dp2[i+coin_ki[j]]=min(dp2[i+coin_ki[j]],dp2[i]+1);
	  tmp=min(dp2[i+coin_ki[j]],dp[i]+1);
	  dp[i+coin_ki[j]]=tmp;
	}
      }
    }
   
    
    int ans2=1;
    
    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}