Submission #4770817


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n
}; 
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/









int N, X, S[201];
mint dp[201][101010];
Comb<mint, 1010> com;
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> X;
	rep(i, 0, N) cin >> S[i];
	sort(S, S + N, greater<int>());

	dp[0][X] = 1;
	rep(i, 0, N) rep(x, 1, X + 1) if(0 < dp[i][x].get()){
		rep(nxt, i, N) {
			int notuse = nxt - i;
			int xx = x % S[nxt];
			int rest = N - 1 - nxt;
			dp[nxt + 1][xx] += dp[i][x] * com.aPb(rest + notuse, notuse);
		}
	}

	mint ans = 0;
	rep(x, 1, X + 1) ans += dp[N][x] * x;
	cout << ans << endl;
}

Submission Info

Submission Time
Task D - Modulo Operations
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 600
Code Size 4265 Byte
Status AC
Exec Time 432 ms
Memory 79744 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 3
AC × 25
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt
Case Name Status Exec Time Memory
sample_01.txt AC 25 ms 79616 KB
sample_02.txt AC 25 ms 79616 KB
sample_03.txt AC 26 ms 79616 KB
test_01.txt AC 25 ms 79616 KB
test_02.txt AC 25 ms 79616 KB
test_03.txt AC 432 ms 79616 KB
test_04.txt AC 158 ms 79616 KB
test_05.txt AC 183 ms 79616 KB
test_06.txt AC 397 ms 79616 KB
test_07.txt AC 164 ms 79616 KB
test_08.txt AC 123 ms 79616 KB
test_09.txt AC 207 ms 79616 KB
test_10.txt AC 234 ms 79616 KB
test_11.txt AC 274 ms 79616 KB
test_12.txt AC 398 ms 79616 KB
test_13.txt AC 130 ms 79744 KB
test_14.txt AC 44 ms 79616 KB
test_15.txt AC 109 ms 79616 KB
test_16.txt AC 28 ms 79616 KB
test_17.txt AC 40 ms 79616 KB
test_18.txt AC 26 ms 79616 KB
test_19.txt AC 167 ms 79616 KB
test_20.txt AC 31 ms 79616 KB
test_21.txt AC 63 ms 79616 KB
test_22.txt AC 26 ms 79616 KB