Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- using namespace std;
- ll mul(ll a, ll b, ll MOD = 1e9 + 7) {
- return ((a % MOD) * (b % MOD)) % MOD;
- }
- ll add(ll a, ll b, ll MOD = 1e9 + 7) {
- return ((a % MOD) + (b % MOD)) % MOD;
- }
- ll sub(ll a, ll b, ll MOD = 1e9 + 7) {
- return (((a - b) % MOD) + MOD) % MOD;
- }
- ll fact(ll n)
- {
- if(n == 0)
- return 1;
- ll res = 1;
- for (ll i = 2; i <= n; i++)
- res = mul(res, i);
- return res;
- }
- ll MOD = 1e9+7;
- int main() {
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- string s;
- cin >> s;
- ll a[125]={};
- for (ll i=0; i<s.size(); i++) {
- a[s[i]]++;
- }
- ll ans;
- ans=fact(s.size())%MOD;
- for (ll i=97; i<125; i++) {
- if (a[i]) ans/=fact(a[i]);
- }
- cout << ans%MOD;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment