157A - Game Outcome - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

#define beshoo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

long long sum1,sum2,c,mx,mn,t;

bool z=0;

set<long long>se;

vector<long long>v;

map<pair<long long,long long>,long long>mp;

set<long long>::iterator its=se.begin();

map<pair<long long,long long>,long long>::iterator itm=mp.begin();

int main()

{

    beshoo

    int n;cin>>n;int arr1[n]={},arr2[n]={};

    for(int i=0;i<n;i++){

        for(int j=0;j<n;j++){

            int x;cin>>x;

            arr1[i]+=x;

            arr2[j]+=x;

        }

    }

    for(int i=0;i<n;i++){

        for(int j=0;j<n;j++){

            if(arr2[j]>arr1[i])c++;

        }

    }

    cout<<c;



    return 0;

}



// Our functions



long long factorial(long long x)

{

    long long fact=1;for(long long i=1;i<=x;i++){fact*=i;}

    return fact;

}



long long permutations(long long x,long long y)

{

    long long fact1=1;for(long long i=1;i<=max(x,y);i++){fact1*=i;}

    long long fact2=1;for(long long i=1;i<=abs(x-y);i++){fact2*=i;}

    return fact1/fact2;

}



long double combinations(long double x,long double y)

{

    long double ans =1;

    for(long double i=0,w=min(y,abs(x-y));i<w;i++){ans =(ans*(x-i))/(i+1);}

    return ans;

}



bool isprime(long long n)

{

    if(n<2||n%2==0)return false;

    if(n==2)return true;

    for(long long i=3;i<=sqrt(n);i+=2){if(n%i==0)return false;}

    return true;

}



//Done bro