-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCreatingStrings2.cpp
More file actions
63 lines (52 loc) · 1.09 KB
/
CreatingStrings2.cpp
File metadata and controls
63 lines (52 loc) · 1.09 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//Creating Strings II - https://cses.fi/problemset/task/1715
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
ll expo(ll a, ll b, ll mod) {
ll res = 1;
while (b > 0) {
if (b & 1) {
res *= a;
res %= mod;
}
a *= a;
a %= mod;
b >>= 1;
}
return res;
}
ll inverse(ll a, ll mod) {
return expo(a, mod - 2, mod);
}
void solve() {
string s;
cin >> s;
int n = (int) s.size();
vector<int> cnt(26, 0);
for (auto &c: s) cnt[c - 'a']++;
vector<ll> fact(n + 1, 1);
vector<ll> inv(n + 1, 1);
for (int i = 2; i <= n; i++) {
fact[i] = (i * fact[i - 1]) % MOD;
inv[i] = inverse(fact[i], MOD);
}
ll ans = fact[n];
for (int i = 0; i < 26; i++) {
if (cnt[i] == 0) continue;
ans *= inv[cnt[i]];
ans %= MOD;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
// cin >> T;
while (T--) {
solve();
}
return 0;
}