Aristocracy

#include <bits/stdc++.h>
using namespace std;

long long p = 1000000007;

long long power(long long x, long long n) {
  if(n == 0) return (1 % p);
  long long xx = power(x, n/2);
  xx = (xx * xx) % p;
  if(n%2==1) xx = (xx * x) % p;
  return xx;
}

int main() {
  int n;
  cin >> n;
  map <string, int> mp;
  for(int i=0; i<n; i++) {
    string s; int t;
    cin >> s >> t;
    mp[s]++;
  }
  long long f[n+1];
  f[0] = 1;
  for(int i=1; i<=n; i++) f[i] = (f[i-1] * i) % p;
  long long If[n+1];
  If[n] = power(f[n], p-2);
  for(int i=n-1; i>=1; i--) If[i] = (If[i+1] * (i+1)) % p;
  long long ans = f[n];
  for(auto [l,r] : mp) {
    ans = (ans * If[r]) % p;
  }
  cout << ans << endl;
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED