結果
問題 | No.2527 H and W |
ユーザー |
![]() |
提出日時 | 2023-11-03 23:05:45 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 34 ms / 2,000 ms |
コード長 | 1,356 bytes |
コンパイル時間 | 257 ms |
コンパイル使用メモリ | 31,104 KB |
実行使用メモリ | 17,408 KB |
最終ジャッジ日時 | 2024-09-25 21:22:15 |
合計ジャッジ時間 | 1,869 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
#include <stdio.h>long long power_mod (long long a, long long b, long long mod_num) {long long ans = 1LL;if (b > 0LL) {ans = power_mod(a, b/2LL, mod_num);ans = (ans * ans) % mod_num;if (b%2LL == 1LL) {ans = (ans * (a % mod_num)) % mod_num;}}return ans;}int main () {int h = 0;int w = 0;long long k = 0LL;int res = 0;long long ans = 0LL;long long mod_num = 998244353LL;long long fact[1000001] = {};long long invf[1000001] = {};res = scanf("%d", &h);res = scanf("%d", &w);res = scanf("%lld", &k);fact[0] = 1LL;for (int i = 0; i < 1000000; i++) {fact[i+1] = fact[i];fact[i+1] *= (long long)(i+1);fact[i+1] %= mod_num;}invf[1000000] = power_mod(fact[1000000], mod_num-2LL, mod_num);for (int i = 1000000; i > 0; i--) {invf[i-1] = invf[i];invf[i-1] *= (long long)i;invf[i-1] %= mod_num;}for (int i = 0; i < h; i++) {if (k%((long long)(h-i)) == 0LL && k/((long long)(h-i)) <= w) {int j = (int)(k/((long long)(h-i)));long long tmp = fact[h]*invf[i];tmp %= mod_num;tmp *= invf[h-i];tmp %= mod_num;tmp *= fact[w];tmp %= mod_num;tmp *= (invf[j]*invf[w-j])%mod_num;ans += tmp%mod_num;}}printf("%lld\n", ans%mod_num);return 0;}