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 <bits/stdc++.h>

using namespace std;

int all[1000001];
int odd[1000001];

int const INF = 1<<29;

int main() {
  
  fill(all, all+1000001, INF);
  fill(odd, odd+1000001, INF);
  
  all[0] = odd[0] = 0;
  
  for(int i=1; ; i++) {
    int n = i*(i+1)*(i+2);
    if(n > 1000000) break;
    for(int j=n; j<=1000000; j++) {
      all[j] = min(all[j-n]+1, all[j]);
      if(n % 2) {
	odd[j] = min(odd[j-n]+1, odd[j]);
      }
    }
  }
  
  int N;
  while(cin >> N && N) {
    cout << all[N] << ' ' << odd[N] << endl;
  }
  
  return 0;
}

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

int main(void){
  int size;
  vector<ll> v(200);
  for(ll i=1;;i++){
    if((i*(i+1)*(i+2))/6 > 1000000) break;
    v[i-1] = (i*(i+1)*(i+2))/6;
    size = i-1;
  }

  while(1){
  int x; cin >> x;
  if(x == 0) break;
  int ans = 0;
  int dp[1000000]; // dp[i] := number of tetrahedron with value i
  fill(dp, dp+x+1, INT_MAX);
  dp[0] = 0;

  for(int i = 0; i <= x; i++){
    for(int j = 0; j < size; j++){
      if(i+v[j] > x) continue;
      dp[i + v[j]] = min(dp[i+v[j]], dp[i]+1);
    }
  }

  cout << dp[x] << " ";

  fill(dp, dp+x+1, INT_MAX);
  dp[0] = 0;
  for(int i = 0; i <= x; i++){
    for(int j = 0; j < size; j++){
      if(i+v[j] > x) continue;
      if(v[j] % 2 == 0) continue;
      dp[i + v[j]] = min(dp[i+v[j]], dp[i]+1);
    }
  }
  cout << dp[x] << endl;
  }
  return 0;
}

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

using namespace std;

typedef pair<int, int> pii;

int main() {
    int table[1000000];
    int max;
    for (int i = 1; i < 1000000; i++) {
        table[i] = i * (i + 1) * (i + 2) / 6;
        if (table[i] >= 1000000) {
            max = i - 1;
            break;
        }
    }

    int m;
    while (cin >> m, m) {
        bool used[1000000];
        fill_n((bool *)used, 1000000, false);
        priority_queue<pii, vector<pii>, greater<pii>> q;
        q.push({0, 0});
        while (!q.empty()) {
            pii p = q.top(); q.pop();
            int count = p.first;
            int total = p.second;
            if (used[total])
                continue;
            used[total] = true;

            // goal
            if (total == m) {
                cout << count << " ";
                break;
            }

            for (int i = 1; i < max; i++) {
                if (table[i] + total <= m)
                    q.push({count+1, table[i] + total});
            }
        }
        while(!q.empty())
            q.pop();
        fill_n((bool *)used, 1000000, false);
        q.push({0, 0});
        while (!q.empty()) {
            pii p = q.top(); q.pop();
            int count = p.first;
            int total = p.second;
            if (used[total])
                continue;
            used[total] = true;

            // goal
            if (total == m) {
                cout << count << endl;
                break;
            }

            for (int i = 1; i < max; i++) {
                if (table[i] % 2 && table[i] + total <= m)
                    q.push({count+1, table[i] + total});
            }
        }
    }
    
    return 0;
}

C++: #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;

ll dp[100][1000010];
ll dp2[100][1000010];
int main(void){
    ll n,i,j;
    while(cin >> n && n){
        std::vector<ll> v,v2;
        for(i=1;(i*(i+1)*(i+2)/6)<=n;i++){
            v.push_back(i*(i+1)*(i+2)/6);
            if((i*(i+1)*(i+2)/6)%2)v2.push_back(i*(i+1)*(i+2)/6);
        }
        ll vs = v.size();
        
        fill(dp[0],dp[0]+(vs+1)*(n+1),1000000);
        //cout << dp[0][0] << endl;
        dp[0][0]=0;
        
        for(i=1;i<=vs;i++){
            for(j=0;j<=n;j++){
                if(j-v[i-1]<0)dp[i][j]=dp[i-1][j];
                else dp[i][j]=min(dp[i][j-v[i-1]]+1,dp[i-1][j]);
            }
        }
        
        ll ret1 = dp[vs][n];//直にやるほう
        vs = v2.size();
        fill(dp2[0],dp2[0]+(vs+1)*(n+1),1000000);
        dp2[0][0]=0;
        for(i=1;i<=vs;i++){
            for(j=0;j<=n;j++){
                if(j-v2[i-1]<0)dp2[i][j]=dp2[i-1][j];
                else dp2[i][j]=min(dp2[i][j-v2[i-1]]+1,dp2[i-1][j]);
            }
        }
        ll ret2 = dp2[vs][n];
        cout << ret1 << " " << ret2 << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
const int MAX = 1000000;
const int INF = 1<<29;
int main(){
  vector<int> dp_1(MAX+1,INF);
  vector<int> dp_2(MAX+1,INF);
  vector<int> poll(1000,0);
  for(int i = 0;i < 200;i++)poll[i] = i*(i+1)*(i+2)/6;
  dp_1[0] = 0;
  dp_2[0] = 0;
  for(int i = 1;i < MAX;i++){
    dp_1[i] = i;
    dp_2[i] = i;
    for(int j = 0;i-poll[j]>=0;j++){
      dp_1[i] = min(dp_1[i],dp_1[i-poll[j]]+1);
      if(poll[j] % 2 == 1)dp_2[i] = min(dp_2[i],dp_2[i-poll[j]]+1);
    }
  }
  int n;
  cout << "aaaaaa" << endl;
  while(cin >> n,n != 0){
    cout << dp_1[n] << " " << dp_2[n] << endl;
    
  }
  
  return 0;
}