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];
	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+1;
			}
		}
	}
	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 <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
 
//const int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
//const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
 
int main()
{
	int n;
	cin >> n;
	int match = n * (n-1) / 2;
	int team[n] = {};

	REP(i, match){
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		if (c == d){
			team[a-1]++;
			team[b-1]++;
		}
		else if (c > d) team[a-1] += 3;
		else team[b-1] += 3;
	}

	int ans[n] = {};
	REP(i, n){
		REP(j, n){
			if (team[i] < team[j]) ans[i]++;
		}
	}

	for (auto x : ans) cout << x+1 << endl;


}

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

using namespace std;

int ti[101];
int ra[101];

main(){
  int i,j;
  int n,a,b,c,d;
  scanf("%d",&n);
  for(i=0;i<n*(n-1)/2;i++){
    scanf("%d %d %d %d",&a,&b,&c,&d);
    if(c>d) ti[a]+=3;
    else if(c<d) ti[b]+=3;
    else{ti[a]++; ti[b]++;}
  }
  for(i=1;i<=n;i++){
    ra[i]=1;
    for(j=1;j<=n;j++){
      if(ti[i]<ti[j]) ra[i]++;
    }
    printf("%d\n",ra[i]);
  }
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <functional>

using namespace std;

#define fr first
#define sc second
#define pb push_back
#define mp make_pair
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep(i,x) for(ll i=0;i<x;++i)
#define rep1(i,x) for(ll i=1;i<=x;++i)
#define rrep(i,x) for(ll i=x-1;i>=0;--i)
#define rrep1(i,x) for(ll i=x;i>=1;--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rev(a) reverse(all(a))

template<typename T> T get(){T a;cin >> a;return a;}

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int inf = 1e9;
const ll linf = 1e18;

int main()
{
    int N; cin >> N;

    vi team(N), rnk(N);

    fill(all(team), 0); fill(all(rnk), 1);

    rep(i, (N*N-N)/2) {
        int a, b, c, d; cin >> a >> b >> c >> d;
        a--; b--;
        if (c > d) team[a]+=3;
        else if (d > c) team[b]+=3;
        else {team[a]++;team[b]++;}
    }

    rep(i, N) rep(j, N) {
        if (team[i] < team[j]) rnk[i]++;
    }

    rep(i, N) cout << rnk[i] << endl;
}

C++: #include<stdio.h>
int main()
{
	int i,j,A,B,a,b,m,n,max,min,r;
	int st1[100];
	scanf("%d",&n);
	r=n*(n-1)/2;
	for(i=0;i<r;i++){
		scanf("%d %d %d %d",&a,&b,&c,&d);
			if(c>d){
				str[a]+=3;
				str[b]+=0;
			}
			else if(d<c){
				str[b]+=3;
				str[a]+=0;
			}
			else{
				str[a]+=1;
				str[b]+=1;
			}
		}
		for(i=0;i<n;i++){
			printf("%d\n",str[i]);
		}
		return 0;
	}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int INF=-5;
int main(){
	int n,ten[107]={0};
	cin>>n;
	for(int i=0;i<n*(n-1)/2;i++){
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		if(c>d)ten[a]+=3;
		else if(c<d)ten[b]+=3;
		else ten[a]++,ten[b]++;
	}
	//for(int i=1;i<=n;i++)cout<<ten[i];
	int same=0;vector<int>s;int kekka[107]={0};
	int tenpu=0;
	for(int i=1;i<=n;i++){
		int tmp=INF,tmpj=INF;//暫定一位
		for(int j=1;j<=n;j++){
			if(tmp<ten[j]){
			tmp=ten[j];
			tmpj=j;
			//kekka[j]=i;
			}
		}
		kekka[tmpj]=i;
		ten[tmpj]=INF;
		//この時点で、tmpは残っている中で一位
		for(int j=1;j<=n;j++){
			if(tmpj!=j&&tmp==ten[j]){//暫定一位とは別の同じお特典があったら
				kekka[j]=i;i++;
				ten[j]=INF;
			}
		}
		//cout<<kekka[1]<<kekka[2]<<kekka[3]<<kekka[4]<<endl;
	}
	for(int i=1;i<=n;i++)cout<<kekka[i]<<endl;
	return 0;
}