Aristocracy

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

const int M = 1e9 + 7;

long ppow(long a, long b) {
	if (b == 0) return 1 % M;
	if (b % 2 == 0) {
		long x = ppow(a, b / 2);
		return x * x % M;
	}
	return a * ppow(a, b - 1) % M;
}

long inv(long a) { return ppow(a, M - 2); }

const int N = 1e5 + 1;
long fac[N], ifac[N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	fac[0] = 1;
	for (int i = 1; i < N; ++i) {
		fac[i] = fac[i - 1] * i % M;
		ifac[i] = ppow(fac[i], M - 2);
	}
	

	int n;
	cin >> n;

	map<string, int> m;

	for (int i = 0; i < n; ++i) {
		string s;
		cin >> s;
		m[s]++;
		int x;
		cin >> x;
	}

	long ans = fac[n];

	for (auto [a, b] : m) {
		ans = ans * inv(fac[b]) % M;
	}

	cout << ans << endl;
}

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