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 Ans[100];
	for (int i = 0; i < 100; i++) {
		Ans[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) 
			Ans[a] += 3;
		if (c == d) {
			Ans[a]++;
			Ans[b]++;
		}
		if (c < d)
			Ans[b] += 3;
	}
	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 <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;


int main() {
	int N;
	int A, B, C, D;
	pair<int,int>score[101] = {};
	cin >> N;
	for (int i = 0; i < 101; i++) score[i].second = i;
		for (int i = 0; i < (N*(N - 1) / 2); i++) {
		cin >> A >> B >> C >> D;
		if (C > D) {
			score[A].first+=3;
		}
		else if (C < D) {
			score[B].first+=3;
		}
		else {
			score[A].first++;
			score[B].first++;
		}
	}

	sort(score, score + 101);
	reverse(score, score + 101);

	int ans[101] = {};
	int tmp = 0;
	int s = 1;
	int num = 0;
	for (int i = 0; i < N; i++) {
		if (tmp != score[i].first) {
			num+=s;
			s = 1;
		}
		else {
			s++;
		}
		ans[score[i].second] = num;
		tmp = score[i].first;
	}

	for (int i = 1; i <= N; i++) {
		cout << ans[i] << endl;
	}
	
	return 0;
	
}

C++: #include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int n,i,j,gou;
	int a[10001],b[10001],c[10001],d[10001],t[10001],jun[10001];
	scanf("%d",&n);
	gou=n*(n-1)/2;
	for(i=0;i<10001;i++){
		t[i]=0;
		jun[i]=1;
	}
	for(i=1;i<=gou;i++){
		scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
		if(c[i]>d[i]){
			t[a[i]]+=3;
		}
		else if(c[i]<d[i]){
			t[b[i]]+=3;
		}
		else{
			t[a[i]]+=1;
			t[b[i]]+=1;
		}
	}
	for(i=1;i<n;i++){
		for(j=1+i;j<=n;j++){
			if(t[i]==t[j]){}
			else if(t[i]>t[j]){
				jun[j]+=1;
			}
			else if(t[i]<t[j]){
				jun[i]+=1;
			}
		}
	}
	for(i=1;i<=n;i++){
		printf("%d\n",jun[i]);
	}
	return 0;
}

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

int main() {
  int n; cin >> n;
  int win[n];
  fill(win, win + 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) {
      win[a] += 3;
    }
    if(c == d) {
      win[a] += 1;
      win[b] += 1;
    }
    if(c < d) {
      win[b] += 3;
    }
  }
  for(int i = 0; i < n; i++) {
    int k = 0;
    for(int j = 0; j < n; j++) {
      if(win[j] > win[i]) k++;
    }
    cout << k + 1 << endl;
  }
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(void){
int n,i,j,a[101],b[101],c[101],d[101],p=0,team[101],team2[101],team3[101],result[101],cnt=0,z;

cin>>n;

for(i=0;i<=n;i++){
	a[i]=0;
	b[i]=0;
	c[i]=0;
	d[i]=0;
	team[i]=0;
	team2[i]=0;
	team3[i]=0;
	result[i]=0;
}

p=n*(n-1)/2;

for(i=1;i<=p;i++){
	cin>>a[i]>>b[i]>>c[i]>>d[i];

	if(c[i]>d[i]){
	team[a[i]]=team[a[i]]+3;
	}

	else if(c[i]<d[i]){
	team[b[i]]=team[b[i]]+3;
	}

	else{
	team[a[i]]=team[a[i]]+1;
	team[b[i]]=team[b[i]]+1;
	}


}
for(i=1;i<=n;i++){
team2[i]=team[i];
}
for(i=1;i<=n;i++){
    for(j=i+1;j<=n;j++){
	if(team[i]<=team[j]){
	z=team[i];
	team[i]=team[j];
	team[j]=z;
	}
    }
}
for(i=1;i<=n;i++){
	for(j=1;j<=n;j++){
		if(team[i]==team2[j]){
		team3[j]=i;
		team2[j]=-1;
		}
	}
}
for(i=1;i<=n;i++){
printf("%d\n",team3[i]);
}
return 0;
}

C++: #include <bits/stdc++.h>

#define ALL(a) (a).begin(), (a).end()
#define llong long long

using namespace std;

signed main(){
	int n; cin >> n;
	vector<vector<int> > m(n, vector<int>(n));
	for(int i = 0; i < n*(n-1)/2; i++){
		int a,b,c,d; cin >> a >> b >> c >> d;
		a--;b--;
		m[a][b] = c;
		m[b][a] = d;
	}
	vector<pair<int, int> > l(n);
	for(int i = 0; i < n; i++){
		l[i] = {0,i};
		for(int j = 0; j < n; j++){
			if(m[i][j] > m[j][i])l[i].first += 3;
			else if(m[i][j] == m[j][i])l[i].first++;
		}
	}
	sort(ALL(l),greater<pair<int, int> >());
	vector<int> a(n);
	a[l[0].second] = 1;
	int cnt = 1;
	for(int i = 1; i < n; i++){
		if(l[i-1].first == l[i].first){
			a[l[i].second] = cnt;
		}
		else{
			a[l[i].second] = i+1;
			cnt = i+1;
		}


	}
	for(auto e : a)cout << e << endl;
	


	return 0;
}