n,k=map(int,input().split()) f=[0]*1000000 f[0]=1 for i in range(1,n+1): for j in range(1,k+1): if j<=i: f[i]=(f[i]+f[i-j])%100003 print(f[n])
P1192 台阶问题(洛谷)(该程序运行超时,只有40分)
最新推荐文章于 2024-05-30 16:17:47 发布
n,k=map(int,input().split()) f=[0]*1000000 f[0]=1 for i in range(1,n+1): for j in range(1,k+1): if j<=i: f[i]=(f[i]+f[i-j])%100003 print(f[n])