Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

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

func nextLineInt() []int {
	arr := strings.Split(nextLine(), " ")
	var ret []int
	for _, v := range arr {
		x, _ := strconv.Atoi(v)
		ret = append(ret, x)
	}
	return ret
}

type Pair struct {
	First int
	Second int
}

type Pairs []Pair

func (s Pairs) Len() int {
	return len(s)
}

func (s Pairs) Swap(i, j int) {
	s[i], s[j] = s[j], s[i]
}

func (s Pairs) Less(i, j int) bool {
	return s[i].First > s[j].First
}

func main() {
	var n int
	arr := nextLineInt()
	n = arr[0]
	result := []Pair{}
	for i := 0; i < n; i++ {
		result = append(result, Pair{0, i})
	}
	for i := 0; i < n * (n - 1) / 2; i++ {
		arr := nextLineInt()
		A := arr[0]
		B := arr[1]
		C := arr[2]
		D := arr[3]
		if C > D {
			result[A-1].First += 3
		} else if C < D {
			result[B-1].First += 3
		} else {
			result[A-1].First++
			result[B-1].First++
		}
	}
	sort.Sort(Pairs(result))
	var ans [111]int
	point := 1000000000
	top := 0
	for i, r := range result {
		// 前の人よりポイントが低い
		if point > r.First {
			top = i + 1
			point = r.First
		}
		ans[r.Second] = top
	}
	for i := 0; i < n; i++ {
		fmt.Println(ans[i])
	}
}

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

int main()
{	
	//サッカー

	int N;
	cin >> N;
	int P[100];
	for (int i = 0; i < 100; i++) {
		P[i] = 0;
	}
	for (int i = 0; i < N*(N - 1) / 2; i++) {
		int a, b,c,d;
		cin >> a >> b >> c >> d;
		if (c > d) 
			P[a] += 3;
		if (c == d) {
			P[a]++;
			P[b]++;
		}
		if (c < d)
			P[b] += 3;
	}
	int Q[100];
	int temps=0,n;
	for (int i = 0; i < N; i++) {
		Q[i] = P[i];
	}
	sort(Q, Q + 100);
	int Ans[100];
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (P[i] == Q[j]) {
				Ans[i] = j;
			}
		}
	}
	for (int i = 0; i < N; i++) {
		cout << Ans[i] << endl;
	}

	//レシート
	/*
	int N;
	int ans[5];
	int a;
	int i = 0;
	while (true)
	{
		cin >> N;
		if (N == 0) break;
		for (int j = 0; j < 9; j++) {
			cin >> a;
			N -= a;
		}
		ans[i] = N;
		i++;
	}
	for (int k = 0; k < 5; k++)
		cout << ans[k] << endl;
	*/
	//コンテスト	
	/*
	int W[10], K[10];
	for (int i = 0; i < 10; i++) {
		cin >> W[i];
	}
	for (int i = 0; i < 10; i++) {
		cin >> K[i];
	}
	sort(W, W + 10);
	reverse(W, W + 10);
	sort(K, K + 10);
	reverse(K, K + 10);
	cout << W[0] + W[1] + W[2] << " " << K[0] + K[1] + K[2] << endl;
	*/
	//ポイントカード
	/*
	int N, M;
	cin >> N >> M;
	int a;
	int A[5000];
	int b = 0;
	int x = 0;
	for (int i = 0; i <  M; i++) {
		cin >> a;
		if (a < N) {
			A[x]=a;
			x++;
		}
		else
		{
			b++;
		} 
		cin >> a;
	}
	int sum = 0;
	if (b < M - 1) {
		sort(A, A+x);
		reverse(A, A+x);
		for (int i = 0; i < M - 1 - b; i++) {
			sum += N - A[i];
		}
	}
	cout << sum << endl;
	*/

	//合計時間
	/*
	int sum=0, n;
	for (int i = 0; i < 4; i++) {
	cin >> n;
	sum += n;
	}
	cout << sum / 60 << endl;
	cout << sum % 60 << endl;
	//平均点
	/*
	int P[5];
	int sum=0;
	for (int i = 0; i < 5; i++) {
	cin >> P[i];
	if (P[i] < 40) P[i] = 40;
	sum += P[i];
	}
	cout << sum / 5 << endl;
	*/
	//投票
	/*
	int N, M;
	cin >> N >> M;
	int A[1000], vote[1000];
	for (int i = 0; i < N; i++) {
	cin >> A[i];
	vote[i] = 0;
	}
	int b;
	for (int i = 0; i < M; i++) {
	cin >> b;
	for (int j = 0; j < N; j++) {
	if (A[j] <= b) {
	vote[j]++;
	break;
	}
	}
	}
	int temps = 0, ans;
	for (int i = 0; i < N; i++) {
	if (vote[i] > temps) {
	temps = vote[i];
	ans = i;
	}
	}
	cout << ans + 1 << endl;
	*/

	//2.すごろく	
	/*
	int n;
	cin >> n;
	int A, _A = 1;
	int k = 0;
	int A_count[100];
	A_count[0] = 1;
	for (int i = 0; i < n; i++)
	{
	cin >> A;
	if (A == 1)
	{
	if (A == _A)
	{
	A_count[k]++;
	}
	else
	{
	k++;
	A_count[k] = 2;
	}
	}
	_A = A;
	}
	sort(A_count, A_count + k + 1);
	cout << A_count[k] << endl;
	*/

	//タイムカード
	/*
	int t[2][3];
	int x[3][3];
	for (int n=0; n < 3; n++)
	{
	for (int i=0; i < 2; i++)
	for (int k=0; k < 3; k++)
	cin >> t[i][k];

	for (int m = 2; m >= 0; m--)
	{
	x[n][m] = t[1][m] - t[0][m];
	if (t[0][m] > t[1][m])
	{
	x[n][m] += 60;
	t[1][m - 1]--;
	}
	}
	}
	for (int n= 0; n < 3; n++)
	{
	cout << x[n][0] << ' ' << x[n][1] <<' '<< x[n][2] << endl;
	}
	*/



	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <list>

using namespace std;

int main()
{
    vector<int> rank;
    int n;
    int t[101];
    int l;
    int a,b,c,d;
    cin >> n;
    l = n*(n-1)/2;
    for(int i=0;i<101;++i) t[i] = 0;
    for(int i=0;i<l;++i)
    {
        cin >> a >> b >> c >> d;
        if(c > d) t[a] += 3;
        else if(c == d) t[a] += 1, t[b] += 1;
        else t[b] += 3;
    }
    for(int i=1;i<=n;++i) rank.push_back(t[i]);
    sort(rank.begin(), rank.end(), greater<int>());
    for(int i=1;i<=n;++i){
        for(int j=0;j<rank.size();++j){
            if(t[i] == rank[j])
            {
                cout << j+1 << endl;
                break;
            }
        }
    }
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
	int n,a,b,pa,pb,point[101],rank[101];
	while(cin >> n,n){
		for(int i = 0;i < 101;++i){
			point[i] = 0;
			rank[i] = 1;
		}
		for(int i = 0;i < ((n*(n-1))/2);++i){
			cin >> a >> b >> pa >> pb;
			--a; --b;
			if(pa > pb) point[a] += 3;
			else if(pa < pb) point[b] += 3;
			else {
				++point[a];
				++point[b];
			}
		}
		for(int i = 0;i < n;++i){
			a = 1;
			pa = point[i];
			for(int j = 0;j < n;++j){
				if(pa < point[j]) ++a;
			}
			rank[i] = a;
		}
		for(int i = 0;i < n;++i){
			cout << rank[i] << endl;
		}
		
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

typedef pair<int,int> P;

int main(){
	int n;
	cin >> n;
	int table[101][101] = {0};
	for(int i=0 ; i < n*(n-1)/2 ; i++ ){
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		a--, b--;
		int s1, s2;
		if( c > d ){ 
			s1 = 3;
			s2 = 0;
		}else if( c == d ){
			s1 = s2 = 1;
		}else{
			s1 = 0;
			s2 = 3;
		}
		table[a][b] = s1;
		table[b][a] = s2;
	}
	vector<P> v;
	int score[101] = {0};
	for(int i=0 ; i < n ; i++ ){
		for(int j=0 ; j < n ; j++ ){
			if( i == j ) continue;
			score[i] += table[i][j];
		}
		v.push_back( P(-score[i],i) );
	}
	sort( v.begin() , v.end() );
	int rank[101] = {0};
	int r=1, sub=0;
	for(int i=0 ; i < v.size() ; i++ ){
		rank[ v[i].second ] = r++;
	}
	for(int i=1 ; i < v.size() ; i++ ){
		if( v[i].first == v[i-1].first ){
			rank[ v[i].second ]--;
			if( v[i].first == v[i+1].first ){
				rank[ v[i].second+1 ]--;
			}
		}
	}
	for(int i=0 ; i < n ; i++ ){
		cout << rank[i] << endl;
	}
}

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

int main(){
	int n;
	cin>>n;
	vector<int> p(n,0);
	for(int i=0;i<n*(n-1)/2;i++){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		a--;
		b--;
		if(c>d)
			p[a]+=3;
		else if(c<d)
			p[b]+=3;
		else{
			p[a]++;
			p[b]++;
		}
	}
	vector<int> q(n);
	for(int i=0;i<n;i++)
		q[i]=i;
	sort(q.begin(),q.end(),[&](int a,int b){
		return p[a]>p[b];
	});
	vector<int> ans(n);
	int last=INT_MAX;
	for(int i=0;i<n;i++){
		if(last==p[q[i]])
			ans[q[i]]=ans[q[i-1]];
		else
			ans[q[i]]=i+1;
		last=p[q[i]];
	}
	for(int i=0;i<n;i++)
		cout<<ans[i]<<endl;
}