fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24. template<const int mod>
  25. struct mint {
  26.     int val;
  27.     constexpr mint(long long x = 0) : val((x % mod + mod) % mod) {}
  28.     explicit operator int() const { return val; }
  29.     mint& operator+=(const mint &b) { val += b.val; val -= mod * (val >= mod); return *this; }
  30.     mint& operator-=(const mint &b) { val -= b.val; val += mod * (val < 0); return *this; }
  31.     mint& operator*=(const mint &b) { val = 1ll * val * b.val % mod; return *this; }
  32.     mint& operator/=(const mint &b) { return *this *= b.inv(); }
  33.     mint inv() const { int x = 1, y = 0, t; for(int a=val, b=mod; b; swap(a, b), swap(x, y)) t = a/b, a -= t * b, x -= t * y; return mint(x); }
  34.     mint power(int b) const { mint a = *this, res(1); for(; b; a *= a, b /= 2)  if(b & 1) res *= a; return res; }
  35.     mint operator-() const { return val == 0 ? 0 : mod - val; }
  36.     mint& operator++() { val = val == mod - 1 ? 0 : val + 1; return *this; }
  37.     mint& operator--() { val = val == 0 ? mod - 1 : val - 1; return *this; }
  38.     mint operator++(int32_t) { mint before = *this; ++*this; return before; }
  39.     mint operator--(int32_t) { mint before = *this; --*this; return before; }
  40.     friend mint operator+(const mint &a, const mint &b) {return mint(a) += b;}
  41.     friend mint operator-(const mint &a, const mint &b) {return mint(a) -= b;}
  42.     friend mint operator*(const mint &a, const mint &b) {return mint(a) *= b;}
  43.     friend mint operator/(const mint &a, const mint &b) {return mint(a) /= b;}
  44.     friend bool operator==(const mint &a, const mint &b) {return a.val == b.val;}
  45.     friend bool operator!=(const mint &a, const mint &b) {return a.val != b.val;}
  46.     friend bool operator<(const mint &a, const mint &b) {return a.val < b.val;}
  47.     friend istream& operator>>(istream &in, mint &a) {return in >> a.val;}
  48.     friend ostream& operator<<(ostream &os, const mint &a) {return os << a.val;}
  49. };
  50. using Mint = mint<M>;
  51.  
  52. namespace comb {
  53.     int n(0);
  54.     vector<Mint> _fac{1}, _invfac{1}, _inv{0};
  55.     void init(int m) {
  56.         m = min (m, M - 1);
  57.         if (m <= n) return;
  58.         _fac.resize(m + 1); _invfac.resize(m + 1); _inv.resize(m + 1);
  59.         for (int i = n + 1; i <= m; i++) _fac[i] = _fac[i - 1] * i;
  60.         _invfac[m] = _fac[m].inv();
  61.         for (int i = m; i > n; i--) _invfac[i - 1] = _invfac[i] * i, _inv[i] = _invfac[i] * _fac[i - 1];
  62.         n = m;
  63.     }
  64.     Mint fact(int m) { if (m > n) init(2 * m); return _fac[m]; }
  65.     Mint invfact(int m) { if (m > n) init(2 * m); return _invfac[m]; }
  66.     Mint inv(int m) { if (m > n) init(2 * m); return _inv[m]; }
  67.     Mint nCr(int n, int r) { if (n < r || r < 0) return 0; return fact(n) * invfact(r) * invfact(n - r); }
  68. }
  69. using comb::fact;
  70. using comb::invfact;
  71. using comb::inv;
  72. using comb::nCr;
  73.  
  74. //_ ***************************** START Below *******************************
  75.  
  76.  
  77.  
  78.  
  79. string a;
  80.  
  81. int consistency(int n){
  82.  
  83.     vector<int> f(26, 0);
  84.     for(int i=0; i<n; i++) f[a[i]-'a']++;
  85.  
  86.     int dnr = 1;
  87.     for(int i=0; i<26; i++){
  88.         if(f[i] == 0) continue;
  89.         int ct = f[i];
  90.         dnr = (dnr * (int)fact(ct))%M;
  91.     }
  92.  
  93.     int ans = ((int)fact(n) * power(dnr, M-2))%M;
  94.  
  95.     return ans;
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102.  
  103.  
  104.  
  105.  
  106.  
  107.  
  108.  
  109.  
  110.  
  111.  
  112. int practice(int n){
  113.  
  114.  
  115.     return 0;
  116. }
  117.  
  118.  
  119.  
  120.  
  121.  
  122. void solve() {
  123.  
  124.     int n;
  125.     cin >> a;
  126.     n = a.size();
  127.  
  128.     cout << consistency(n) << endl;
  129.  
  130.  
  131. }
  132.  
  133.  
  134.  
  135.  
  136.  
  137. int32_t main() {
  138.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  139.  
  140.     int t = 1;
  141.     // cin >> t;
  142.     while (t--) {
  143.         solve();
  144.     }
  145.  
  146.     return 0;
  147. }
Success #stdin #stdout 0.01s 5316KB
comments (?)
stdin
copy 
aabac
stdout
copy 
20
https://ideone.com/RpBRDm
language:
C++14 (gcc 8.3)
created:
9 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!