Submission #6419473
Source Code Expand
D = int(input()) N = input() MOD = 10 ** 9 + 7 dp = [[[0, 0] for _ in range(D)] for _ in range(len(N)+1)] dp[0][0][0] = 1 for i in range(len(N)): n = int(N[i]) for d in range(D): dp[i+1][(d+n)%D][0] += dp[i][d][0] for e in range(10): if e < n: dp[i+1][(d+e)%D][1] += dp[i][d][0] dp[i+1][(d+e)%D][1] += dp[i][d][1] dp[i+1][(d+e)%D][1] %= MOD print((sum(dp[-1][0]) - 1) %MOD)
Submission Info
Submission Time | |
---|---|
Task | E - 数 |
User | qython |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 475 Byte |
Status | TLE |
Exec Time | 2115 ms |
Memory | 111136 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 | 107 ms | 4340 KB |
01 | TLE | 2108 ms | 69924 KB |
02 | TLE | 2115 ms | 111136 KB |
90 | AC | 17 ms | 3064 KB |
91 | AC | 19 ms | 3064 KB |