Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
	"strings"
)

const MaxW = 1000
const MaxN = 1000

type Tuple struct {
	Value  int
	Weight int
}

func nextLine(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

func solve(w int, n int, vws []Tuple) Tuple {
	var dp [MaxN + 1][MaxW + 1]int

	for i := 0; i < n; i++ {
		for j:= w; j > 0; j-- {
			if j < vws[i].Weight {
				dp[i + 1][j] = dp[i][j]
			} else {
				dp[i + 1][j] = int(math.Max(float64(dp[i][j]), float64(dp[i][j - vws[i].Weight] + vws[i].Value)))
			}
		}
	}

	maxValue := dp[n][w]
	minWeight := w

	for j := w - 1; j > 0; j-- {
		if maxValue == dp[n][j] {
			minWeight = j
		} else {
			break
		}
	}

	return Tuple{Value: maxValue, Weight: minWeight}
}

func main() {
	var sc = bufio.NewScanner(os.Stdin)
	index := 1
	for {
		var w, n int
		w, _ = strconv.Atoi(nextLine(sc))
		if w == 0 {
			return
		}
		n, _ = strconv.Atoi(nextLine(sc))

		vws := make([]Tuple, n, n)
		for i := 0; i < n; i++ {
			array := strings.Split(nextLine(sc), ",")
			v, _ := strconv.Atoi(array[0])
			w, _ := strconv.Atoi(array[1])
			vws[i] = Tuple{Value: v, Weight: w}
		}

		t := solve(w, n, vws)
		fmt.Printf("Case %d:\n", index)
		fmt.Println(t.Value)
		fmt.Println(t.Weight)
		index++
	}
}

C++: #include<iostream>
#include<string>
int dp[1000][1000];
using namespace std;
int main(){
	int t,n;
	int w[2000],v[2000];
	int k=0;
	char z;
	while(true){
	cin>>t;
	if(t==0)
		break;
	cin>>n;
	for(int i=0;i<n;i++){
		for(int j=0;j<=t;j++){
			dp[i][j]=-1;
		}
	}
	for(int i=0;i<n;i++){
		cin>>v[i]>>z>>w[i];
		dp[i][0]=0;
	}
	dp[0][w[0]]=v[0];
	for(int i=1;i<n;i++){
		for(int j=1;j<=t;j++){
			if(j-w[i]<0){
				if(dp[i-1][j]==-1)
					dp[i][j]=-1;
				if(dp[i-1][j]!=-1)
					dp[i][j]=dp[i-1][j];
			}
			if(j-w[i]>=0){
				if(dp[i-1][j]==-1&&dp[i-1][j-w[i]]==-1)
					dp[i][j]=-1;
				if(dp[i-1][j]==-1&&dp[i-1][j-w[i]]!=-1)
					dp[i][j]=dp[i-1][j-w[i]]+v[i];
				if(dp[i-1][j]!=-1&&dp[i-1][j-w[i]]==-1)
					dp[i][j]=dp[i-1][j];
				if(dp[i-1][j]!=-1&&dp[i-1][j-w[i]]!=-1){
					if(dp[i-1][j]>=dp[i-1][j-w[i]]+v[i])
						dp[i][j]=dp[i-1][j];
					if(dp[i-1][j]<dp[i-1][j-w[i]]+v[i])
						dp[i][j]=dp[i-1][j-w[i]]+v[i];
				}
			}
		}
	}
	int c=0;
	for(int j=0;j<=t;j++){
		if(dp[n-1][j]>c)
			c=dp[n-1][j];
	}
	k++;
	bool g=false;
	for(int j=0;j<=t;j++){
		if(c==dp[n-1][j]&&g==false){
			cout<<"Case "<<k<<":"<<endl;
			cout<<c<<endl;
			cout<<j<<endl;
			g=true;
		}
	}
	}
	return 0;
}

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

const int MAX_N = 1001;
const int MAX_W = 1001;

int t;
int n, W;
int v[MAX_N], w[MAX_N];

int dp[MAX_N][MAX_W];

int main() {
	while (1) {
		std::cin >> W;
		if (w == 0)
			break;
		std::cin >> n;
		char ch;
		for (int i = 1; i <= n; ++i)
			std::cin >> v[i] >> ch >> w[i];
		std::memset(dp, 0, sizeof(dp));
		for (int i = 1; i <= n; ++i) {
			for (int j = 0; j <= W; ++j) {
				if (w[i] > j)
					continue;
				dp[i][j] = std::max(dp[i - 1][j - w[i]] + v[i], dp[i][j]);
			}
		}
		int max = 0, maxv;
		for (int i = 0; i <= W; ++i) {
			if (max < dp[n][i]) {
				maxv = i;
				max = dp[n][i];
			}
		}
		++t;
		std::cout << "Case " << t << ':' << std::endl;
		std::cout << max << std::endl << maxv << std::endl;
	}
	return 0;
}

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

#define READ_BY_TEXT false

vector<string> splitByDelimiter(string target, string delim) {
    std::string s = target;
    std::string delimiter = delim;
    size_t pos = 0;
    std::string token;
    vector<string> arr;
    while ((pos = s.find(delimiter)) != std::string::npos) {
        token = s.substr(0, pos);
        arr.push_back(token);
        s.erase(0, pos + delimiter.length());
    }
    arr.push_back(s);
    return arr;
}

int W, N;
int w[1000], v[1000];
int dp[1000][1000];
//vector<int> lines;
//int max_v, min_w;

int recursive(int i, int j) {
    
    if (dp[i][j] != -1) return dp[i][j];
    
    int ret;
    if (i >= N) {
        ret = 0;
    }
    else if (j < w[i]) {
        ret = recursive(i+1, j);
    }
    else {
        ret = max(recursive(i+1, j), recursive(i+1, j-w[i])+v[i]);
    }
    dp[i][j] = ret;
    
    return ret;
}

int calcMinWeight(int i, int j) {
    
    if (i >= N) {
        return 0;
    }
    
    int m_w = W;
    if (dp[i][j] == -1) {
        m_w = min(m_w, calcMinWeight(i+1, j));
    }
    else {
        m_w = min(m_w, calcMinWeight(i+1, j-w[i]) + w[i]);
    }
    
    return m_w;
}

int main() {
    
#if READ_BY_TEXT
    // Get values from test.txt
    std::ifstream ifs("test.txt");
    std::string str;
    if (ifs.fail())
    {
        std::cerr << "??±???" << std::endl;
        return -1;
    }
    getline(ifs, str);
    vector<string> words = splitByDelimiter(str, " ");
    num_d = stoi(words[0]);
    num_n = stoi(words[1]);
    for (int i=0; i<num_n; i++) {
        getline(ifs, str);
        lines.push_back(stoi(str));
    }
#else
    
    int case_v = 1;
    while (true) {
        cin >> W;
        if (!W) break;
        cin >> N;
        string input;
        for (int i = 0; i < N; i++) {
//            getline(cin, input);
            cin >> input;
            vector<string> words = splitByDelimiter(input, ",");
            v[i] = stoi(words[0]);
            w[i] = stoi(words[1]);
        }
        memset(dp, -1, sizeof(dp));
        
        // Solve
        int min_w = W;
        int max_v = recursive(0, W);
        for (int i = 0; i < N; i++) {
            for (int j = 0; j <= W; j++) {
//                cout << "dp[" << i << "][" << j << "] = " << dp[i][j] << endl;
                if (dp[i][j] == max_v) {
//                    cout << "i " << i << " j " << j << endl;
                    min_w = min(min_w, calcMinWeight(i, j));
//                    min_w = min(j, min_w);
                }
            }
        }
        
        cout << "Case " << case_v << ":" << endl;
        cout << max_v << endl;
        cout << min_w << endl;
        case_v++;
    }
    
//    string input;
//    getline(cin, input);
//    vector<string> words = splitByDelimiter(input, " ");
//    num_d = stoi(words[0]);
//    num_n = stoi(words[1]);
//    string input1;
//    for (int i=0; i<num_n; i++) {
//        getline(cin, input1);
//        lines.push_back(stoi(input1));
//    }
#endif
    
//    recursive(0, 0, "");
//    cout << result << endl;
    
    //    cout << "num_d = " << num_d << " num_n = " << num_n << "\n";
    //
    //    // Check parsed contents
    //    for (int i = 0; i < lines.size(); i++) {
    //        cout << "line[" << i << "] " << to_string(lines[i]) << "\n";
    //    }
    
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;

int main(){

  int m,n;
  int v[1001],w[1001];
  int dp[1001][1001];
  int cnt = 0;
  int d = 0;

  while(cin >> m, m){
    cin >> n;

    for(int i=0;i<n;i++) scanf("%d,%d",&v[i],&w[i]);

    memset(dp,0,sizeof(dp));

    for(int i=0;i<n;i++){
      for(int j=0;j<=m;j++){
	if(w[i] > j) dp[i+1][j] = dp[i][j];
	else dp[i+1][j] = max(dp[i][j-w[i]]+v[i],dp[i][j]);
      }
    }

    for(int i=m;i>=0;i--){
      if(dp[n][i] == dp[n][m]) d = i;
    }

    cnt++;
    printf("Case %d:\n",cnt);
    printf("%d\n%d\n",dp[n][d],d);
  }
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int DP[1001][1001];
int main(){
	int W,N,C=0;
	while(cin>>W){
		if(!W) break;
		cin>>N;
		int v[1000],w[1000],SUMW=W;
		for(int i=0;i<N;++i) scanf("%d,%d",&v[i],&w[i]);
		for(int i=0;i<=W;++i) DP[0][i]=0;
		for(int i=0;i<N;++i){
			for(int j=0;j<=W;++j){
				if(w[i]>j){//入らない時
					DP[i+1][j]=DP[i][j];
				}else{//入る時
					DP[i+1][j]=max(DP[i][j],DP[i][j-w[i]]+v[i]);
				}
			}
		}
		for(int j=W;j>=0;--j) if(DP[N][W]==DP[N][j])SUMW=j;
		cout<<"case "<<++C<<":\n";
		cout<<DP[N][W]<<"\n"<<SUMW<<"\n";
	}
	return 0;
}