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

using namespace std;

vector<int> v;
vector<int> vodd;
const int N = 1000001;

int dp[N];
int dpodd[N];

void dodp(int arr[], vector<int>& v) {
    for (int i = 0; i < N; ++i) {
        arr[i] = 1000;
    }
    arr[0] = 0;

    for (int vi : v) {
        for (int i = 0; i < N; ++i) {
            if (i - vi >= 0 && arr[i - vi] != 1000) {
                arr[i] = min(arr[i], arr[i - vi] + 1);
            }
        }
    }
}

int main() {
    v.push_back(1);
    vodd.push_back(1);
    int tri = 1;
    int i = 2;
    while(v.back() <= 1000000 ) {
        tri += i;
        int tmp = v.back() + tri;
        v.push_back(tmp);
        if (tmp % 2 == 1) vodd.push_back(tmp);
        ++i;
    }
    // v.size() = 181

    dodp(dp, v);
    dodp(dpodd, vodd);

    // for (int i = 0; i < N; ++i) {
    //     cout << dpodd[i] << " ";
    // }
    // cout << endl;
    while(1) {
        int n;
        cin >> n;
        if (n == 0) break;
        cout << dp[n] << " " << dpodd[n] << endl;
    }
}

C++: #include <iostream>
#include <deque>
#include <string>
#include <cstdio>
#include <vector>
#include <algorithm>
#define loop(i,a,b) for(int i=a; i<int(b); i++)
#define rep(i,n) loop(i,0,n)

using namespace std;

typedef vector<int> vi;
int const inf = 1 << 28;

int main(){
    vi q, r;
    for (int i = 1;; i++){
        int pq = i*(i + 1)*(i + 2) / 6;
        q.push_back(pq);
        if (pq > 1e6 + 100) break;
    }

    int n = 1000000;

    vi dp1(n + 1, inf);
    vi dp2(n + 1, inf);
    dp1[0] = 0;
    dp2[0] = 0;
    rep(i, q.size()){
        rep(j, n + 1){
            if (j - q[i] >= 0){
                dp1[j] = min(dp1[j], dp1[j - q[i]] + 1);
            }
        }
        if(q[i]&1){
            rep(j, n + 1){
                if (j - q[i] >= 0){
                    dp2[j] = min(dp2[j], dp2[j - q[i]] + 1);
                }
            }
        }
    }

    int t;
    while (cin >> t && t){
        cout << dp1[t] << " " << dp2[t] << endl;
    }
}

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

    cout << dp[x] << " ";
    //fill(dp,dp + x + 1,100000);
  
    for(int i=0;i<100000;i++)
      dp[i]=100000;

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

C++: //http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2510

#include<iostream>
#include<fstream>

#define N 1000//データの最大個数
#define ami 0
#define mami 1

int n = 0;
int wTime[N] = {};

int sum(int a[]){
	int ans = 0;
	for (int i = 0; a[i] != 0; i++)
		ans += a[i];
	return ans;
}

int timeCalc(int differ, int sum){
	bool dp[10000] = {true,};

	//wTime[0 ? n-2]はsort済み
	int time = 0;
	int max = 0;

	for (int i = 0; i < n - 2; i++){
		for (int j = differ; j >= wTime[i]; j--){
			if(dp[j - wTime[i]])dp[j] = true;
			if(dp[j] && time < j)time = j;
		}
	}
	return time;
}

int main(){
	using namespace std;

	int rTime[N] = {};
	int allTime[2] = {0, 0};

	while (true){
		cin >> n;
		if (n == 0)break;//終了条件

		for (int i = 0; i < N; i++){//初期化
			rTime[i] = wTime[i] = 0;
		}

		for (int i = 0; i < n; i++){
			cin >> rTime[i] >> wTime[i];
		}

		if (n == 1){
			cout << 2 * rTime[0] + wTime[0] << endl;
			continue;
		}

		//読書時間でbubble sort
		for (int i = n - 1; i >= 0; i--){
			for (int j = 0; j < i; j++){
				if (rTime[j] > rTime[j + 1]){
					int tmp = rTime[j];
					rTime[j] = rTime[j + 1];
					rTime[j + 1] = tmp;
				}
			}
		}
		//計算開始

		//read
		//最も読む時間のかかる一つと、その他の全ての和を比較

		//max <= sum
		if (sum(rTime) >= 2 * rTime[n - 1]){
			cout << sum(rTime) + sum(wTime) << endl;
		}

		//max > sum
		else if (sum(rTime) < 2 * rTime[n - 1]){

			allTime[ami] = rTime[n - 1];
			allTime[mami] = sum(rTime) - rTime[n - 1];

			int differ = allTime[ami] - allTime[mami];

			for (int i = n - 2; i >= 0; i--){
				for (int j = 0; j < i; j++){
					if (wTime[j] > wTime[j + 1]){
						int tmp = wTime[j];
						wTime[j] = wTime[j + 1];
						wTime[j + 1] = tmp;
					}
				}
			}
			
			int writingTime = timeCalc(differ, allTime[mami]);

			cout << sum(rTime) + sum(wTime) + differ - writingTime << endl;

		}

	}
	return 0;
}