結果

問題 No.1964 sum = length
ユーザー rlangevin
提出日時 2023-10-11 20:55:04
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 1,481 bytes
コンパイル時間 436 ms
コンパイル使用メモリ 82,028 KB
実行使用メモリ 269,552 KB
最終ジャッジ日時 2024-09-13 19:47:19
合計ジャッジ時間 46,918 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 34 TLE * 6
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

N = int(input())
M = 450
mod = 998244353
pre = [[0] * M for _ in range(M)]
pre[0][0] = 1
for _ in range(N):
    dp = [[0] * M for _ in range(M)]
    Ac = [[0] * M for _ in range(M)]
    for i in range(M):
        for j in range(M):
            if i + 1 <= M - 1 and j + 2 <= M - 1: 
                dp[i + 1][j + 2] += pre[i][j]
                dp[i + 1][j + 2] %= mod
            if i + 10 <= M - 1 and j + 2 <= M - 1: 
                dp[i + 10][j + 2] -= pre[i][j]
                dp[i + 10][j + 2] %= mod
            if i + 10 <= M - 1 and j + 3 <= M - 1: 
                dp[i + 10][j + 3] += pre[i][j]
                dp[i + 10][j + 3] %= mod
            if i + 100 <= M - 1 and j + 3 <= M - 1: 
                dp[i + 100][j + 3] -= pre[i][j]
                dp[i + 100][j + 3] %= mod
            if i + 100 <= M - 1 and j + 4 <= M - 1: 
                dp[i + 100][j + 4] += pre[i][j]
                dp[i + 100][j + 4] %= mod
            # dp[i + 405][j + 4] -= pre[i][j]
            # for n in range(1, M):
            #     num = len(str(n))
            #     if i + n <= M - 1 and j + num + 1 <= M - 1: 
            #         dp[i + n][j + num + 1] += pre[i][j]
            #         dp[i + n][j + num + 1] %= mod
    for i in range(1, M):
        for j in range(M):
            Ac[i][j] = (Ac[i - 1][j] + dp[i][j]) % mod
            
    Ac, pre = pre, Ac
ans = 0
for i in range(M - 1):
    ans += pre[i][i + 1]
    ans %= mod                
print(ans)
# print(pre)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0