Codeforces Round #589 DIV2 E問題 (2250pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int N, K;
mint dp[251], nx[251];
mint pK[251], pKm[251], c[251][251];
{
rd(N,K);
pK[0] = 1;
rep(i,N) pK[i+1] = K * pK[i];
pKm[0] = 1;
rep(i,N) pKm[i+1] = (K-1) * pKm[i];
rep(i,N+1) c[i][0] = 1;
rep(i,1,N+1) rep(j,1,N+1) c[i][j] = c[i-1][j-1] + c[i-1][j];
dp[0] = 1;
rep(N){
rep(i,N+1) nx[i] = 0;
rep(i,N+1){
nx[i] += dp[i] * (pK[i] - pKm[i]) * pKm[N-i];
rep(j,i+1,N+1) nx[j] += dp[i] * pK[i] * c[N-i][j-i] * pKm[N-j];
}
rep(i,N+1) dp[i] = nx[i];
}
wt(dp[N]);
}
Current time: 2024年04月28日17時29分19秒
Last modified: 2019年10月06日04時50分55秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF589 CF_Div2_E
トップページに戻る
Logged in as: unknown user (not login)