小V和方程 牛客 DP 整数拆分

小V和方程

solution

$\sum _{i=1}^n\sqrt{x_i}=\sqrt{m}=>\sum _{i=1}^n\sqrt{a_i^{2}x}=\sqrt{A^{2}x}$

$\sum _{i=1}^n{a}_i\sqrt{x}=A\sqrt{x}$

$\sum _{i=1}^n{a}_i=A$

/*SiberianSquirrel*//*CuteKiloFish*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ill = __int128;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = ll(998244353);
const ll INF = ll(1e18 + 10);
const int N = int(1e6 + 10);
const int M = int(1e3 + 10);
inline int rnd(){static int seed=2333;return seed=(((seed*666666ll+20050818)%998244353)^1000000007)%1004535809;}
template <class T> void read(T &x) {
    static char ch;static bool neg;
    for(ch=neg=0;ch<'0' || '9'<ch;neg|=ch=='-',ch=getchar());
    for(x=0;'0'<=ch && ch<='9';(x*=10)+=ch-'0',ch=getchar());
    x=neg?-x:x;
}
ll add(ll a, ll b) {return (a + b) % MOD;}
ll sub(ll a, ll b) {return (a - b + MOD) % MOD;}
ll mul(ll a, ll b) {a %= MOD; b %= MOD;return a * b % MOD;}
//VAR
int n2[M];
int dp[M][M];
// FUNCTION
void init() {
    for(int i = 0; i <= int(1e3); ++ i) n2[i] = i * i;
}
//WORK
void solve() {
    memset(dp, 0, sizeof dp);
    init();
    int n, m; cin >> n >> m;
    int temp = 1;
    for(int i = int(1e3); i >= 1; -- i) {
        if(m % n2[i] == 0) {
            m /= n2[i];
            temp *= i;
        }
    }
    dp[0][0] = 1;
    for(int i = 1; i <= n; ++ i) {
        for (int j = 0; j <= int(1e3); ++ j) {
            dp[i][j] = dp[i - 1][j];
            if(j >= i) dp[i][j] = (1ll * dp[i][j] + dp[i][j - i]) % MOD;
        }
    }
    cout << dp[n][temp] << endl;
}
//MAIN
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
    signed test_index_for_debug = 1;
    char acm_local_for_debug = 0;
    do {
        if (acm_local_for_debug == '$') exit(0);
        if (test_index_for_debug > 20)
            throw runtime_error("Check the stdin!!!");
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    } while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}