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 <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 ans_tmp=0;
    int ans2_tmp=0;

    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;j++){
	if(i+coin[j]<=x){
	  dp[i+coin[j]]=min(dp[i+coin[j]],dp[i]+1);
	}
      }
    }


    int ans1=dp[x];

    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){
	  ans2_tmp=min(dp2[i+coin_ki[j]],dp2[i]+1);
	  dp2[i+coin_ki[j]]=ans2_tmp;
	}
      }
    }
   
    
    int ans2=dp2[x];
    
    for(int i=0;i<count;i++)
      printf("coin[%d]=%d\n",i,coin[i]);
    for(int i=0;i<count_ki;i++)
      printf("coin_ki[%d]=%d\n",i,coin_ki[i]);


    printf("%d %d\n",ans1,ans2);
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;

int a[201];
int dp1[1000001],dp2[1000001];
int main(){
    FOR(i,1,201){
        a[i-1]=i*(i+1)*(i+2)/6;
    }
    int n;
    while(cin>>n,n){
        rep(i,n+1) dp1[i]=dp2[i]=1000100010;
        dp1[n]=0,dp2[n]=0;
        rep(i,200)for(int j=n;j>=a[199-i];--j){
            dp1[j-a[199-i]]=min(dp1[j-a[199-i]],dp1[j]+1);
            if(a[199-i]%2==1) dp2[j-a[199-i]]=min(dp2[j-a[199-i]],dp2[j]+1);
        }
        cout<<dp1[0]<<" "<<dp2[0]<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <map>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <list>
#include <stack>
#include <queue>
#define INF 1000000
using namespace std;

typedef list<int> L;
typedef pair <int,int> P;
typedef vector<int> V;
typedef queue<int> Q;
typedef stack<int> S;
typedef map<string,int> M;

int N;
int dp[1000001];
int dp2[1000001];
int tetra[1000];

int main()
{
    for (int i = 0; i <= INF; i++) {dp[i] = INF;dp2[i] = INF;}
    int n = 1;
    int tmp;
    while ((tmp = (n * (n + 1) * (n + 2) / 6)) <= 1000000) {
        tetra[n++] = tmp;
        dp[tmp] = 1;
        if (tmp % 2) dp2[tmp] = 1;
    }
    int max = 1;
    while (cin >> N, N) {
        if (max > N) {
            cout <<  dp[N] << " ";
        } else {
            for (int i = max; i <= N; i++) {
                for (int j = 1; tetra[j] <= i; j++) {
                    dp[i] = min(dp[i], dp[i - tetra[j]] + 1);
                }
            }
            cout << dp[N] << " ";
        }

        if (max > N) {
            cout << dp2[N] << endl;
        } else {
            for (int i = 1; i <= N; i++) {
                for (int j = 1; tetra[j] <= i; j++) {
                    if (tetra[j] % 2)
                        dp2[i] = min(dp2[i], dp2[i - tetra[j]] + 1);
                }
            }
            cout << dp[N] << endl;
            max = N;
        }
    }

    return 0;
}

C++: #include <stdio.h>
#include <string.h>
#define INF 1000000

int main(void){
	int i, j, n ,c;
	int dp1[1000000],dp2[1000000];
	scanf("%d",&n);
	while(n != 0){
		for(i = 0;i <= n;i++)
			dp1[i] = dp2[i] = INF;
		dp1[0] = dp2[0] = 0;
		for(i = 0;i < n;i++){
			if(dp1[i] != INF || dp2[i] != INF){
				for(j = 1,c = j * (j + 1) * (j + 2);c / 6 + i <= n;j++,c = j * (j + 1) * (j + 2)){
					if(dp1[c / 6 + i] > dp1[i] + 1 && dp1[i] != INF)
						dp1[c / 6 + i] = dp1[i] + 1;
					if(dp2[c / 6 + i] > dp2[i] + 1 && (c / 6) % 2 == 1 && dp2[i] != INF)
						dp2[c / 6 + i] = dp2[i] + 1;
				}
			}
			if(dp1[n] != INF && dp2[n] != INF)
				break;
		}
		printf("%d %d\n",dp1[n],dp2[n]);
		scanf("%d",&n);
	}
	return 0;
}

C++: #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)

int main(){
    int dp[1000001];
    int odp[1000001];
    rep(i, 1000001){
        dp[i] = odp[i] = i;
    }

    for(int n=3, p=4; p<=1000000; n++){
        for(ll i=0; i+p<=1000000; i++){
            dp[i+p] = min(dp[i+p], dp[i]+1);
        }

        if(p%2 == 1){
            for(int i = 0; i+p <= 1000000; i++){
                odp[i+p] = min(odp[i+p], odp[i] + 1);
            }
        }

        p = n*(n+1)*(n+2)/6;
    }
    while(true){
        ll n; cin>>n;
        if(n == 0) break;
        cout << dp[n] << " " << odp[n] << endl;
    }
}