Go: package main

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

var scanner= bufio.NewScanner(os.Stdin)

type entry struct {
	id, score int
}

type lessFunc func(p1, p2 *entry) bool

type multiSorter struct {
	entries []entry
	less []lessFunc
}

func (ms *multiSorter) sort(entries []entry) {
	ms.entries = entries
	sort.Sort(ms)
}

func OrderedBy(less ...lessFunc) *multiSorter {
	return &multiSorter{
		less: less,
	}
}

func (ms *multiSorter) Len() int {
	return len(ms.entries)
}

func (ms *multiSorter) Swap(i, j int) {
	ms.entries[i], ms.entries[j] = ms.entries[j], ms.entries[i]
}

func (ms *multiSorter) Less(i, j int) bool {
	p, q := &ms.entries[i], &ms.entries[j]
	var k int
	for k = 0; k < len(ms.less)-1; k++ {
		less := ms.less[k]
		switch  {
		case less(p, q):
			return true
		case less(q, p):
			return false
		}
	}
	return ms.less[k](p, q)
}

func main() {
	for scanner.Scan() {
		m, _ := strconv.Atoi(scanner.Text())
		if m == 0 {
			break
		}
		results := make([]entry, 0)
		for i := 0; i < m; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			data := make([]int, len(buf))
			for i := range data {
				data[i], _ = strconv.Atoi(buf[i])
			}
			id, score := score(data)
			results = append(results, entry{id, score})
		}
		score_axis := func(e1, e2 *entry) bool {
			return e1.score > e2.score
		}
		id_axis := func(e1, e2 *entry) bool {
			return e1.id > e2.id
		}
		OrderedBy(score_axis, id_axis).sort(results)
		// log.Println(results)
		for _, e := range results {
			fmt.Printf("%d %d\n", e.id, e.score)
		}
	}
}

func score(input []int) (int, int) {
	id := input[0]
	data := input[1:]
	frame := 1
	scores := make([]int, 11)
	for frame <= 10 {
		if data[0] == 10 {
			scores[frame] = data[0] + data[1] + data[2]
			data = data[1:]
			frame += 1
		} else if data[0] + data[1] == 10 {
			scores[frame] = data[0] + data[1] + data[2]
			data = data[2:]
			frame += 1
		} else {
			scores[frame] = data[0] + data[1]
			data = data[2:]
			frame += 1
		}
	}
	sum := 0
	for i, v := range scores {
		if i != 0 {
			sum += v
		}
	}
	return id, sum
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
P t[40];
int u[11];
int n,a,b,sum,cnt;
int main(){
  while(cin>>n&&n){
    for(int I=0;I<n;I++){
      cin>>t[I].second;
      for(int i=0;i<=10;i++)u[i]=0;
      sum=0;
      for(int i=1;i<=10;i++){
	cin>>a;

	if(u[i-1]==2)sum+=a;
	if(i-2>=0&&u[i-1]==2&&u[i-2]==2)sum+=a;
	if(u[i-1]==1)sum+=a;

	if(a==10){
	  sum+=a;
	  u[i]=2;
	}else{
	  cin>>b;
	  if(u[i-1]==2)sum+=b;
	  sum+=(a+b);
	  if(a+b==10)u[i]=1;
	}
      }
      
      if(u[10]==2){
	cin>>a>>b;
	sum+=a;
	sum+=b;
	if(u[9]==2)sum+=a;
      }else if(u[10]==1){
	cin>>a;
	sum+=a;
      }
      t[I].first=sum*-1;
    }//for n

    sort(t,t+n);
    for(int i=0;i<n;i++){
      cout<<t[i].second<<' '<<t[i].first*-1<<endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>

using namespace std;

typedef pair<int,int> P;

vector<int> Point(string s){
  stringstream ss(s);
  int num;
  vector<int> v;

  while(ss >> num){
    v.push_back(num);
  }

  return v;
}

int getScore(string s){
  vector<int> a;
  a = Point(s);
  int len = (int)a.size();
  int score = 0 , sum = 0;
  int p = 0,n = 0;

  for(int i = 0 ; i < len ; i++){
    if(p >= 9){
      p++;
      score += a[i];
    }else{
      if(a[i] == 10){
	score += a[i] + a[i+1] + a[i+2];
	p++;
      }else{
	n++;
	sum += a[i];
	if(n == 2){
	  n = 0;
	  score += sum;
	  if(sum == 10){
	    score += a[i+1];
	  }
	  p++;
	  sum = 0;
	}
      }
    }
  }

  return -score;
}

int main(){
  int m;
  while(cin >> m ,m){
    vector<P> v;
    string pin;
    for(int i = 0 ; i < m ; i++){
      int score,num;
      cin >> num;

      cin.ignore();
      getline(cin,pin);
      score = getScore(pin);
  
      v.push_back(P(score,num));
    }
    sort(v.begin(),v.end());
    for(int i = 0 ; i < m ; i++){
      cout << v[i].second << " " << -v[i].first << endl;
    }
  }

  return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef pair<int, int>P;

int s[10][5];

P operator+(P a, int d) {
	rep(i, d) {
		if (!~s[a.first][a.second + 1]) {
			a.first++; a.second = 0;
		}
		else a.second++;
	}
	return a;
}
int main() {
	int m;
	while (scanf("%d", &m), m) {
		vector<P>v;
		rep(i, m) {
			string s; cin >> s;
			stringstream ss(s);
			int d, cnt = 0;
			while (ss >> d) {
				cnt++;
			}
			if (cnt == 13)abort();
			/*
			memset(s, -1, sizeof(s));
			int id; scanf("%d", &id);
			int f = 0; bool b = 0;
			while (f < 9) {
				scanf("%d", &s[f][b]);
				if (s[f][b] > 10)abort();
				if (s[f][b] == 10)f++;
				else {
					if (b)f++;
					b = !b;
				}
			}
			scanf("%d%d", &s[9][0], &s[9][1]);
			if (s[9][0] + s[9][1] >= 10)scanf("%d", &s[9][2]);
			P p(0, 0);
			while (p.first < 9) {
				if (s[p.first][p.second] == 10) {
					P a = p + 1, b = p + 2;
					s[p.first][p.second] += s[a.first][a.second] + s[b.first][b.second];
				}
				if (p.second&& s[p.first][p.second - 1] + s[p.first][p.second] == 10) {
					P a = p + 1;
					s[p.first][p.second] += s[a.first][a.second];
				}
				p = p + 1;
			}
			int cnt = 0;
			rep(i, 10)rep(j, 3) {
				if (~s[i][j])cnt += s[i][j];
			}
			v.push_back(P(cnt, id));*/
		}
		puts("Hello,world!");
		sort(v.begin(), v.end(), [](P a, P b) {
			if (a.first != b.first)return a.first > b.first;
			return a.second < b.second;
		});
		for (auto p : v) {
			printf("%d %d\n", p.second, p.first);
		}
	}
}

C++: // 2011/02/27 Tazoe

#include <iostream>
#include <string>
#include <sstream>
using namespace std;

struct player{
	int num;
	int sco;
};

int main()
{
	while(true){
		string str;
		getline(cin, str);
		istringstream ist(str);
		int m;
		ist >> m;
		if(m==0)
			break;

		struct player ply[40];
		for(int i=0; i<m; i++){
			getline(cin, str);
			istringstream ist2(str);

			ist2 >> ply[i].num;
			int pin[21];
			for(int j=0; ist2 >> pin[j]; j++)
				;

			ply[i].sco = 0;
			int k = 0;
			for(int j=1; j<=9; j++){
				ply[i].sco += pin[k++];
				if(pin[k-1]==10){
					ply[i].sco += (pin[k]+pin[k+1]);
					continue;
				}
				ply[i].sco += pin[k++];
				if(pin[k-2]+pin[k-1]==10){
					ply[i].sco += pin[k];
					continue;
				}
			}
			ply[i].sco += pin[k++];
			ply[i].sco += pin[k++];
			if(pin[k-2]==10||pin[k-2]+pin[k-1]==10)
				ply[i].sco += pin[k];

		}

		for(int i=0; i<m-1; i++)
			for(int j=i+1; j<m; j++)
				if(ply[i].sco<ply[j].sco||(ply[i].sco==ply[j].sco&&ply[i].num>ply[j].num)){
					struct player tmp = ply[i];
					ply[i] = ply[j];
					ply[j] = tmp;
				}

		for(int i=0; i<m; i++)
			cout << ply[i].num << ' ' << ply[i].sco << endl;
	}

	return 0;
}