Sorted_permutation_rank.txt

# define mod 1000003
int Solution::findRank(string A) {
    int n=A.size();
    long long int fact[n];
    fact[0]=1;
    for(int i=1;i<n;i++){
        fact[i]=((fact[i-1] % mod)*(i%mod))%mod;
    }
    
    int ans=0;
    for(int i=0;i<n;i++){
        int count=0;
        for(int j=i+1;j<n;j++){
            if(A[j] < A[i])
                count++;
        }
        ans= (ans + count * fact[n-i-1]% mod )% mod;
    }
        
    
    return (ans + 1)%mod;
}