玄学卡常(雾
```cpp
int dec(int a, int b){
a-=b;
if(a<0) a+=MOD;
return a;
}
```
by oisdoaiu @ 2021-01-14 08:17:21
@[vectorwyx](/user/238408) 哦对,您可以参考一下您下面那个帖子
by oisdoaiu @ 2021-01-14 08:19:02
这一段改成这样试一试:
```
fo(w,max(1,j-siz[now]+siz[p]),min(j,lim)){
//f0:i放,i的父放
f0[j]=(f0[j]+f0[j-w]*(0ll+dp[p][w][3]+dp[p][w][2]))%lmq;
//f1:i不放,i的父不放,i的儿子们也全都不放
f1[j]=(f1[j]+1ll*f1[j-w]*dp[p][w][1])%lmq;
//f2:i不放,父放
f2[j]=(f2[j]+1ll*f2[j-w]*(dp[p][w][0]+dp[p][w][1]))%lmq;
//f3:i放,i的父不放,i的儿子们也全都不放
f3[j]=(f3[j]+1ll*f3[j-w]*dp[p][w][2])%lmq;
}
```
@[vectorwyx](/user/238408)
by Gemini7X @ 2021-01-14 11:04:25
@[Flying_Bird](/user/328405) 过了!!!谢谢巨佬awa!!!/qq
by vectorwyx @ 2021-01-14 11:21:00