Submission #3421476
Source Code Expand
D = int(input()) N = input() L = len(N) MOD = 10**9+7 dp = [[[0]*D for j in range(2)] for i in range(L+1)] #dp[i][less][modD] dp[0][0][0] = 1 for i in range(L): for less in range(2): lim = 9 if less else int(N[i]) for r in range(D): for d in range(lim+1): dp[i+1][less or d < lim][(r+d)%D] += dp[i][less][r] dp[i+1][less or d < lim][(r+d)%D] %= MOD print(dp[-1][1][0] - 1)
Submission Info
Submission Time | |
---|---|
Task | E - 数 |
User | prd_xxx |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 449 Byte |
Status | TLE |
Exec Time | 2106 ms |
Memory | 26392 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 4 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 00, 01, 02, 90, 91 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00 | AC | 130 ms | 3444 KB |
01 | TLE | 2105 ms | 20120 KB |
02 | TLE | 2106 ms | 26392 KB |
90 | AC | 17 ms | 3064 KB |
91 | AC | 19 ms | 3064 KB |