lina_os

Untitled

Mar 18th, 2025
7
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.87 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define ll long long
  3.  
  4. using namespace std;
  5.  
  6. ll mul(ll a, ll b, ll MOD = 1e9 + 7) {
  7. return ((a % MOD) * (b % MOD)) % MOD;
  8. }
  9.  
  10. ll add(ll a, ll b, ll MOD = 1e9 + 7) {
  11. return ((a % MOD) + (b % MOD)) % MOD;
  12. }
  13.  
  14. ll sub(ll a, ll b, ll MOD = 1e9 + 7) {
  15. return (((a - b) % MOD) + MOD) % MOD;
  16. }
  17.  
  18.  
  19. ll fact(ll n)
  20. {
  21. if(n == 0)
  22. return 1;
  23. ll res = 1;
  24. for (ll i = 2; i <= n; i++)
  25. res = mul(res, i);
  26. return res;
  27. }
  28.  
  29. ll MOD = 1e9+7;
  30.  
  31. int main() {
  32. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  33. string s;
  34. cin >> s;
  35. ll a[125]={};
  36. for (ll i=0; i<s.size(); i++) {
  37. a[s[i]]++;
  38. }
  39. ll ans;
  40. ans=fact(s.size())%MOD;
  41. for (ll i=97; i<125; i++) {
  42. if (a[i]) ans/=fact(a[i]);
  43. }
  44. cout << ans%MOD;
  45. return 0;
  46. }
  47.  
  48.  
Advertisement
Add Comment
Please, Sign In to add comment