C :

#include<stdio.h>
int main()
{
	int n,i,r,t,x=0,y=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d%d",&r,&t);
		if(r==t){
			continue;
		}else if(r==1){
			if(t==2){
				x++;
			}else{
				y++;
			}
		}else if(r==2){
			if(t==1){
				y++;
			}else{
				x++;
			}
		}else{
			if(t==1){
				x++;
			}else{
				y++;
			}
		}
	}
	if(x==y){
		printf("tie");
	}else if(x>y){
		printf("a win");
	}else{
		printf("b win");
	}
 	return 0;
}

C++ :

#include <iostream>
using namespace std;
int main(){
	//a b代表a和b赢的次数 
	int n,a = 0,b = 0,i,x,y;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>x>>y;
		if(x == 1 && y == 2 || x == 2 && y == 3 || x == 3 && y == 1){
			a++;
		}else if(x != y){
			b++;
		}
	}
	
	if(a > b){
		cout<<"a win"<<endl;
	}else if(a < b){
		cout<<"b win"<<endl;
	}else{
		cout<<"tie"<<endl;
	}
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
//        int num2 = scanner.nextInt();
        int[][] a = new int[num1][2];
//        int[][] b = new int[num1][num2];
        int x = 0,y = 0;
        for (int i = 0; i < num1; i++) {
            for(int k = 0;k < 2;k++){
                a[i][k] = scanner.nextInt();
            }
        }for (int i = 0; i < num1; i++) {
                if(a[i][0] == 1 && a[i][1] == 2 || a[i][0] == 2 && a[i][1] == 3 || a[i][0] == 3 && a[i][1] == 1) x++;
                else if(a[i][1] == 1 && a[i][0] == 2 || a[i][1] == 2 && a[i][0] == 3 || a[i][1] == 3 && a[i][0] == 1)y++;
        }
        if(x > y) System.out.println("a" + " " +"win");
        else if(x < y) System.out.println("b" + " " + "win");
        else System.out.println("tie");





    }public static void paiXu(int[] a,int length){
        int temp;
        for(int i = 0;i < length - 1;i++){
            for(int k = 0;k < length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXud(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] < a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXux(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX2(int[][] a){
        int max = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(max < a[i][j])max = a[i][j];
            }
        }
        return max;
    }public static int MIN2(int[][] a){
        int min = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(min > a[i][j])min = a[i][j];
            }
        }
        return min;
    }
    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
    public static int sum(int a){
        int x,s = 0;
        while(a != 0){
            x = a % 10;
            s = s + x;
            a /= 10;
        }
        return s;
    }
    public static boolean isPrime(int a){
        if(a <= 1)return false;
        else
        for(int i = 2;i <= Math.sqrt(a);i++){
            if(a % i == 0)return false;
        }return true;
    }

    public static long qiuYu(long i){
        long a;
        a = i % 10;
        return a;
    }
    public static int daoXu(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s * 10 + m;
            x /= 10;
        }
        return s;
    }

    public static int jiaWei(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s + m;
            x /= 10;
        }
        return s;
    }

    public static int fun(int x){
        if(x == 1 || x == 2)return 1;
        else return fun(x - 1) + fun(x - 2);
    }
}

Python :

n=int(input())
a=[[0 for i in range(2)] for j in range(n)]
js1=0
js2=0
for i in range(n):
    sr=input().split()
    for j in range(2):
        a[i][j]=int(sr[j])
    if(a[i][0]-a[i][1]==-1 or a[i][0]-a[i][1]==2):
        js1=js1+1
    elif(a[i][0]-a[i][1]==1 or a[i][0]-a[i][1]==-2):
        js2=js2+1
if(js1>js2):
    print("a win")
elif(js1==js2):
    print("tie")
else:
    print("b win")